About the Execution of 2022-gold for NoC3x3-PT-5B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
279.544 | 39318.00 | 51756.00 | 353.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r287-smll-167863553800038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is NoC3x3-PT-5B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800038
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 525K Mar 5 18:23 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 NoC3x3-PT-5B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678917763747
Running Version 202205111006
[2023-03-15 22:02:46] [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]
[2023-03-15 22:02:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:02:47] [INFO ] Load time of PNML (sax parser for PT used): 453 ms
[2023-03-15 22:02:47] [INFO ] Transformed 1571 places.
[2023-03-15 22:02:47] [INFO ] Transformed 2173 transitions.
[2023-03-15 22:02:47] [INFO ] Found NUPN structural information;
[2023-03-15 22:02:47] [INFO ] Parsed PT model containing 1571 places and 2173 transitions in 728 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 205 ms.
// Phase 1: matrix 2173 rows 1571 cols
[2023-03-15 22:02:47] [INFO ] Computed 66 place invariants in 82 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 16) seen :11
FORMULA NoC3x3-PT-5B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-5B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2173 rows 1571 cols
[2023-03-15 22:02:48] [INFO ] Computed 66 place invariants in 24 ms
[2023-03-15 22:02:49] [INFO ] [Real]Absence check using 66 positive place invariants in 80 ms returned sat
[2023-03-15 22:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:50] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-15 22:02:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 104 ms returned sat
[2023-03-15 22:02:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:55] [INFO ] [Nat]Absence check using state equation in 4305 ms returned unknown
[2023-03-15 22:02:56] [INFO ] [Real]Absence check using 66 positive place invariants in 115 ms returned sat
[2023-03-15 22:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:02:57] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2023-03-15 22:02:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:02:58] [INFO ] [Nat]Absence check using 66 positive place invariants in 77 ms returned sat
[2023-03-15 22:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:02] [INFO ] [Nat]Absence check using state equation in 4567 ms returned unknown
[2023-03-15 22:03:03] [INFO ] [Real]Absence check using 66 positive place invariants in 113 ms returned sat
[2023-03-15 22:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:04] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2023-03-15 22:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:03:05] [INFO ] [Nat]Absence check using 66 positive place invariants in 113 ms returned sat
[2023-03-15 22:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:09] [INFO ] [Nat]Absence check using state equation in 4440 ms returned unknown
[2023-03-15 22:03:10] [INFO ] [Real]Absence check using 66 positive place invariants in 111 ms returned sat
[2023-03-15 22:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:11] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2023-03-15 22:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:03:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 77 ms returned sat
[2023-03-15 22:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:16] [INFO ] [Nat]Absence check using state equation in 4541 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1571 transition count 1842
Reduce places removed 331 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 333 rules applied. Total rules applied 664 place count 1240 transition count 1840
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 666 place count 1238 transition count 1840
Discarding 272 places :
Symmetric choice reduction at 3 with 272 rule applications. Total rules 938 place count 966 transition count 1568
Iterating global reduction 3 with 272 rules applied. Total rules applied 1210 place count 966 transition count 1568
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1210 place count 966 transition count 1535
Deduced a syphon composed of 33 places in 14 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1276 place count 933 transition count 1535
Discarding 110 places :
Symmetric choice reduction at 3 with 110 rule applications. Total rules 1386 place count 823 transition count 1339
Iterating global reduction 3 with 110 rules applied. Total rules applied 1496 place count 823 transition count 1339
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1552 place count 767 transition count 1224
Iterating global reduction 3 with 56 rules applied. Total rules applied 1608 place count 767 transition count 1224
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1632 place count 743 transition count 1176
Iterating global reduction 3 with 24 rules applied. Total rules applied 1656 place count 743 transition count 1176
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1662 place count 737 transition count 1164
Iterating global reduction 3 with 6 rules applied. Total rules applied 1668 place count 737 transition count 1164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1671 place count 734 transition count 1158
Iterating global reduction 3 with 3 rules applied. Total rules applied 1674 place count 734 transition count 1158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1677 place count 731 transition count 1149
Iterating global reduction 3 with 3 rules applied. Total rules applied 1680 place count 731 transition count 1149
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 2022 place count 560 transition count 978
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2025 place count 560 transition count 975
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2227 place count 459 transition count 1004
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2241 place count 459 transition count 990
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 2313 place count 423 transition count 998
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 2375 place count 423 transition count 936
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2384 place count 414 transition count 936
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 2384 place count 414 transition count 931
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 2394 place count 409 transition count 931
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2430 place count 391 transition count 913
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2432 place count 390 transition count 913
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 2437 place count 390 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2438 place count 389 transition count 912
Applied a total of 2438 rules in 967 ms. Remains 389 /1571 variables (removed 1182) and now considering 912/2173 (removed 1261) transitions.
Finished structural reductions, in 1 iterations. Remains : 389/1571 places, 912/2173 transitions.
// Phase 1: matrix 912 rows 389 cols
[2023-03-15 22:03:17] [INFO ] Computed 57 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 4947 resets, run finished after 5175 ms. (steps per millisecond=193 ) properties (out of 4) seen :4
FORMULA NoC3x3-PT-5B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36600 ms.
BK_STOP 1678917803065
--------------------
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="NoC3x3-PT-5B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is NoC3x3-PT-5B, 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 r287-smll-167863553800038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B 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 '
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 ;