Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853500670.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Peterson-COL-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853500670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 43K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-3-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591162605849

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:36:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:36:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:36:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 05:36:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 755 ms
[2020-06-03 05:36:49] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-06-03 05:36:49] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 21 ms.
[2020-06-03 05:36:49] [INFO ] Computed order based on color domains.
[2020-06-03 05:36:49] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 27 ms.
[2020-06-03 05:36:49] [INFO ] Unfolded HLPN properties in 0 ms.
[2020-06-03 05:36:49] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 24 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 134 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=112 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0]
FORMULA Peterson-COL-3-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA Peterson-COL-3-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-06-03 05:36:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:36:49] [INFO ] Computed 15 place invariants in 15 ms
[2020-06-03 05:36:49] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned unsat
[2020-06-03 05:36:49] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2020-06-03 05:36:49] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:50] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2020-06-03 05:36:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:36:50] [INFO ] [Real]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 50 ms returned sat
[2020-06-03 05:36:50] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-03 05:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:50] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2020-06-03 05:36:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 9 places in 264 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 34 places in 351 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 9 places in 678 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 24 places in 163 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 56 places in 189 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 37 places in 166 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 21 places in 217 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 36 places in 114 ms
[2020-06-03 05:36:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2383 ms
[2020-06-03 05:36:53] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 77 ms.
[2020-06-03 05:36:55] [INFO ] Added : 265 causal constraints over 53 iterations in 1700 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 05:36:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-03 05:36:55] [INFO ] [Real]Absence check using 11 positive place invariants in 44 ms returned unsat
[2020-06-03 05:36:55] [INFO ] [Real]Absence check using 11 positive place invariants in 55 ms returned sat
[2020-06-03 05:36:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:55] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Real]Added 66 Read/Feed constraints in 52 ms returned sat
[2020-06-03 05:36:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:56] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 41 places in 117 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 35 places in 144 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 39 places in 101 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 27 places in 152 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 17 places in 129 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 21 places in 202 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 9 places in 120 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 27 places in 195 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 54 places in 120 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 13 places in 104 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 31 places in 93 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 48 places in 69 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-06-03 05:36:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 2766 ms
[2020-06-03 05:36:59] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned unsat
FORMULA Peterson-COL-3-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 17300 steps, including 280 resets, run visited all 1 properties in 95 ms. (steps per millisecond=182 )
FORMULA Peterson-COL-3-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

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="Peterson-COL-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Peterson-COL-3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853500670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;