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.r268-smll-171654407500389.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 itstools
Input is Philosophers-COL-000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407500389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 8.5K Apr 13 09:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 13 09:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 09:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 09:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 9.9K May 18 16:43 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 Philosophers-COL-000010-UpperBounds-00
FORMULA_NAME Philosophers-COL-000010-UpperBounds-01
FORMULA_NAME Philosophers-COL-000010-UpperBounds-02
FORMULA_NAME Philosophers-COL-000010-UpperBounds-03
FORMULA_NAME Philosophers-COL-000010-UpperBounds-04
FORMULA_NAME Philosophers-COL-000010-UpperBounds-05
FORMULA_NAME Philosophers-COL-000010-UpperBounds-06
FORMULA_NAME Philosophers-COL-000010-UpperBounds-07
FORMULA_NAME Philosophers-COL-000010-UpperBounds-08
FORMULA_NAME Philosophers-COL-000010-UpperBounds-09
FORMULA_NAME Philosophers-COL-000010-UpperBounds-10
FORMULA_NAME Philosophers-COL-000010-UpperBounds-11
FORMULA_NAME Philosophers-COL-000010-UpperBounds-12
FORMULA_NAME Philosophers-COL-000010-UpperBounds-13
FORMULA_NAME Philosophers-COL-000010-UpperBounds-14
FORMULA_NAME Philosophers-COL-000010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716849402972

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-27 22:36:45] [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-27 22:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:36:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:36:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:36:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 841 ms
[2024-05-27 22:36:46] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2024-05-27 22:36:46] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 10 ms.
[2024-05-27 22:36:46] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2024-05-27 22:36:46] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[10, 0, 10, 0, 0] Max Struct:[10, 10, 10, 5, 10]
FORMULA Philosophers-COL-000010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 22:36:46] [INFO ] Invariant cache hit.
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:36:47] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:36:47] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 22:36:47] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 22:36:47] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 22:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 22:36:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 22:36:47] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 22:36:47] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 22:36:47] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 22:36:47] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[10, 5, 10]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10) 10) 10)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 22:36:47] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions 160 arcs in 30 ms.
[2024-05-27 22:36:47] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[10, 5, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[10, 5, 10]
// Phase 1: matrix 50 rows 50 cols
[2024-05-27 22:36:47] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[10, 5, 10]
RANDOM walk for 10000 steps (57 resets) in 83 ms. (119 steps per ms)
FORMULA Philosophers-COL-000010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (82 resets) in 26 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[5]
[2024-05-27 22:36:47] [INFO ] Invariant cache hit.
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2024-05-27 22:36:47] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-27 22:36:47] [INFO ] Computed and/alt/rep : 30/40/30 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-27 22:36:47] [INFO ] Added : 5 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 16 ms.
[2024-05-27 22:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:36:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-27 22:36:47] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-27 22:36:47] [INFO ] Computed and/alt/rep : 30/40/30 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-27 22:36:47] [INFO ] Added : 5 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[5]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 50/50 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 50 transition count 30
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 50 place count 30 transition count 20
Applied a total of 50 rules in 57 ms. Remains 30 /50 variables (removed 20) and now considering 20/50 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 30/50 places, 20/50 transitions.
// Phase 1: matrix 20 rows 30 cols
[2024-05-27 22:36:48] [INFO ] Computed 20 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[5]
FORMULA Philosophers-COL-000010-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1869 ms. (534 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-27 22:36:50] [INFO ] Flatten gal took : 25 ms
[2024-05-27 22:36:50] [INFO ] Flatten gal took : 7 ms
[2024-05-27 22:36:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4363069958176427268.gal : 7 ms
[2024-05-27 22:36:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6210338548877582769.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4363069958176427268.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6210338548877582769.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4826 ms.

BK_STOP 1716849410313

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Philosophers-COL-000010"
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-5568"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000010, 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 r268-smll-171654407500389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 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 ;