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.r114-smll-165264477200077.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 HealthRecord-PT-01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477200077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 8.0K Apr 30 11:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 30 11:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 11:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 30 11:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 46K 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 HealthRecord-PT-01-UpperBounds-00
FORMULA_NAME HealthRecord-PT-01-UpperBounds-01
FORMULA_NAME HealthRecord-PT-01-UpperBounds-02
FORMULA_NAME HealthRecord-PT-01-UpperBounds-03
FORMULA_NAME HealthRecord-PT-01-UpperBounds-04
FORMULA_NAME HealthRecord-PT-01-UpperBounds-05
FORMULA_NAME HealthRecord-PT-01-UpperBounds-06
FORMULA_NAME HealthRecord-PT-01-UpperBounds-07
FORMULA_NAME HealthRecord-PT-01-UpperBounds-08
FORMULA_NAME HealthRecord-PT-01-UpperBounds-09
FORMULA_NAME HealthRecord-PT-01-UpperBounds-10
FORMULA_NAME HealthRecord-PT-01-UpperBounds-11
FORMULA_NAME HealthRecord-PT-01-UpperBounds-12
FORMULA_NAME HealthRecord-PT-01-UpperBounds-13
FORMULA_NAME HealthRecord-PT-01-UpperBounds-14
FORMULA_NAME HealthRecord-PT-01-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652692318784

Running Version 202205111006
[2022-05-16 09:12:00] [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-16 09:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:12:01] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2022-05-16 09:12:01] [INFO ] Transformed 117 places.
[2022-05-16 09:12:01] [INFO ] Transformed 218 transitions.
[2022-05-16 09:12:01] [INFO ] Found NUPN structural information;
[2022-05-16 09:12:01] [INFO ] Parsed PT model containing 117 places and 218 transitions in 349 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Normalized transition count is 205 out of 213 initially.
// Phase 1: matrix 205 rows 117 cols
[2022-05-16 09:12:01] [INFO ] Computed 14 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 530 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :13
FORMULA HealthRecord-PT-01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
FORMULA HealthRecord-PT-01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-16 09:12:01] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2022-05-16 09:12:01] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-16 09:12:01] [INFO ] [Real]Absence check using 8 positive place invariants in 34 ms returned sat
[2022-05-16 09:12:01] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2022-05-16 09:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:12:01] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-05-16 09:12:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:12:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:12:02] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-16 09:12:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:12:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:12:02] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 52 ms.
[2022-05-16 09:12:02] [INFO ] Added : 11 causal constraints over 3 iterations in 235 ms. Result :sat
Minimization took 43 ms.
[2022-05-16 09:12:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:12:02] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-05-16 09:12:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:12:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:12:02] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 09:12:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:12:02] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 27 ms.
[2022-05-16 09:12:03] [INFO ] Added : 11 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA HealthRecord-PT-01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 117 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 211/211 transitions.
Graph (trivial) has 172 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 396 edges and 110 vertex of which 80 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Reduce places removed 2 places and 4 transitions.
Drop transitions removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 78 transition count 89
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 123 place count 33 transition count 44
Iterating global reduction 1 with 45 rules applied. Total rules applied 168 place count 33 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 168 place count 33 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 174 place count 30 transition count 41
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 184 place count 20 transition count 31
Iterating global reduction 1 with 10 rules applied. Total rules applied 194 place count 20 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 198 place count 20 transition count 27
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 201 place count 17 transition count 22
Iterating global reduction 2 with 3 rules applied. Total rules applied 204 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 17 transition count 21
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 15 transition count 19
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 15 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 211 place count 15 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 14 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 13 transition count 15
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 218 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 9 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 222 place count 9 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 7 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 7 transition count 8
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 6 with 2 rules applied. Total rules applied 229 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 233 place count 5 transition count 4
Applied a total of 233 rules in 73 ms. Remains 5 /117 variables (removed 112) and now considering 4/211 (removed 207) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/117 places, 4/211 transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 09:12:03] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 166689 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2898 ms.

BK_STOP 1652692323723

--------------------
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="HealthRecord-PT-01"
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 HealthRecord-PT-01, 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 r114-smll-165264477200077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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