Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820900469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r132-tall-165271820900469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 10K Apr 29 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 254K May 10 09:34 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 1652792952623

Running Version 202205111006
[2022-05-17 13:09:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 13:09:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 13:09:13] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-17 13:09:13] [INFO ] Transformed 462 places.
[2022-05-17 13:09:13] [INFO ] Transformed 409 transitions.
[2022-05-17 13:09:13] [INFO ] Parsed PT model containing 462 places and 409 transitions in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 409 rows 462 cols
[2022-05-17 13:09:14] [INFO ] Computed 53 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 294 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :18
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-11 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
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :6
// Phase 1: matrix 409 rows 462 cols
[2022-05-17 13:09:14] [INFO ] Computed 53 place invariants in 14 ms
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 15 ms returned unsat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned unsat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 9 ms returned unsat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 15 ms returned sat
[2022-05-17 13:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:09:14] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-17 13:09:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 13:09:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 13:09:15] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 18 ms returned sat
[2022-05-17 13:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 13:09:15] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-05-17 13:09:15] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 34 ms.
[2022-05-17 13:09:15] [INFO ] Added : 21 causal constraints over 5 iterations in 210 ms. Result :sat
Minimization took 45 ms.
[2022-05-17 13:09:15] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-05-17 13:09:15] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-17 13:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:09:15] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-17 13:09:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 13:09:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 13:09:15] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned sat
[2022-05-17 13:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 13:09:15] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-17 13:09:15] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 20 ms.
[2022-05-17 13:09:16] [INFO ] Added : 21 causal constraints over 5 iterations in 191 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, -1, -1] Max seen :[1, 1, 1, 1, 2, 2]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-09 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
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 44 are kept as prefixes of interest. Removing 418 places using SCC suffix rule.227 ms
Discarding 418 places :
Also discarding 273 output transitions
Drop transitions removed 273 transitions
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 92 rules applied. Total rules applied 93 place count 42 transition count 46
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 32 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 31 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 106 place count 31 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 30 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 27 transition count 40
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 27 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 26 transition count 39
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 26 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 23 transition count 36
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 23 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 21 transition count 34
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 129 place count 21 transition count 34
Applied a total of 129 rules in 274 ms. Remains 21 /462 variables (removed 441) and now considering 34/409 (removed 375) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/462 places, 34/409 transitions.
Normalized transition count is 23 out of 34 initially.
// Phase 1: matrix 23 rows 21 cols
[2022-05-17 13:09:16] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 83865 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 17955 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 18252 resets, run finished after 338 ms. (steps per millisecond=2958 ) properties (out of 2) seen :8
[2022-05-17 13:09:18] [INFO ] Flow matrix only has 23 transitions (discarded 11 similar events)
// Phase 1: matrix 23 rows 21 cols
[2022-05-17 13:09:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 13:09:18] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 13:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:09:18] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2022-05-17 13:09:18] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 13:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 13:09:18] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[4, 4]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4339 ms.

BK_STOP 1652792958132

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r132-tall-165271820900469"
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 ;