About the Execution of 2022-gold for CSRepetitions-PT-10
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.r095-smll-167814411000012.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 CSRepetitions-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-167814411000012
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 409K Feb 25 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 721K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 216K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 550K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 240K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 735K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 679K Feb 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:22 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 CSRepetitions-PT-10-UpperBounds-00
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-01
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-02
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-03
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-04
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-05
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-06
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-07
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-08
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-09
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-10
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-11
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-12
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-13
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-14
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678173452309
Running Version 202205111006
[2023-03-07 07:17:35] [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-07 07:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:17:35] [INFO ] Load time of PNML (sax parser for PT used): 644 ms
[2023-03-07 07:17:35] [INFO ] Transformed 1311 places.
[2023-03-07 07:17:36] [INFO ] Transformed 2300 transitions.
[2023-03-07 07:17:36] [INFO ] Parsed PT model containing 1311 places and 2300 transitions in 931 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 31 ms.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-07 07:17:36] [INFO ] Computed 110 place invariants in 123 ms
FORMULA CSRepetitions-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 10) seen :155
FORMULA CSRepetitions-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :40
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-07 07:17:37] [INFO ] Computed 110 place invariants in 39 ms
[2023-03-07 07:17:37] [INFO ] [Real]Absence check using 110 positive place invariants in 85 ms returned sat
[2023-03-07 07:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:39] [INFO ] [Real]Absence check using state equation in 1227 ms returned unsat
[2023-03-07 07:17:39] [INFO ] [Real]Absence check using 110 positive place invariants in 71 ms returned sat
[2023-03-07 07:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:40] [INFO ] [Real]Absence check using state equation in 1310 ms returned unsat
[2023-03-07 07:17:41] [INFO ] [Real]Absence check using 110 positive place invariants in 64 ms returned sat
[2023-03-07 07:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:42] [INFO ] [Real]Absence check using state equation in 1151 ms returned unsat
[2023-03-07 07:17:42] [INFO ] [Real]Absence check using 110 positive place invariants in 73 ms returned sat
[2023-03-07 07:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:43] [INFO ] [Real]Absence check using state equation in 1237 ms returned unsat
[2023-03-07 07:17:44] [INFO ] [Real]Absence check using 110 positive place invariants in 51 ms returned sat
[2023-03-07 07:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:45] [INFO ] [Real]Absence check using state equation in 1219 ms returned unsat
[2023-03-07 07:17:45] [INFO ] [Real]Absence check using 110 positive place invariants in 77 ms returned sat
[2023-03-07 07:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:46] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2023-03-07 07:17:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:17:47] [INFO ] [Nat]Absence check using 110 positive place invariants in 79 ms returned sat
[2023-03-07 07:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:49] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2023-03-07 07:17:49] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-07 07:17:49] [INFO ] [Nat]Added 100 Read/Feed constraints in 23 ms returned sat
[2023-03-07 07:17:49] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 350 ms.
[2023-03-07 07:17:50] [INFO ] Added : 1 causal constraints over 1 iterations in 959 ms. Result :sat
Minimization took 399 ms.
[2023-03-07 07:17:51] [INFO ] [Real]Absence check using 110 positive place invariants in 76 ms returned sat
[2023-03-07 07:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:52] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2023-03-07 07:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:17:52] [INFO ] [Nat]Absence check using 110 positive place invariants in 48 ms returned sat
[2023-03-07 07:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:53] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2023-03-07 07:17:53] [INFO ] [Nat]Added 100 Read/Feed constraints in 15 ms returned sat
[2023-03-07 07:17:54] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 225 ms.
[2023-03-07 07:17:54] [INFO ] Added : 1 causal constraints over 1 iterations in 619 ms. Result :sat
Minimization took 371 ms.
[2023-03-07 07:17:55] [INFO ] [Real]Absence check using 110 positive place invariants in 54 ms returned sat
[2023-03-07 07:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:56] [INFO ] [Real]Absence check using state equation in 1186 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, -1, -1, 10] Max seen :[10, 10, 10, 10, 10, 2, 4, 10]
FORMULA CSRepetitions-PT-10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 1311 transition count 2202
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 1111 transition count 2102
Discarding 990 places :
Symmetric choice reduction at 1 with 990 rule applications. Total rules 1388 place count 121 transition count 1112
Iterating global reduction 1 with 990 rules applied. Total rules applied 2378 place count 121 transition count 1112
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 2467 place count 32 transition count 222
Iterating global reduction 1 with 89 rules applied. Total rules applied 2556 place count 32 transition count 222
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 2645 place count 32 transition count 133
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 2675 place count 12 transition count 123
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 18 edges and 12 vertex of which 10 / 12 are part of one of the 1 SCC in 5 ms
Free SCC test removed 9 places
Iterating post reduction 2 with 100 rules applied. Total rules applied 2775 place count 3 transition count 24
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 2793 place count 3 transition count 6
Applied a total of 2793 rules in 686 ms. Remains 3 /1311 variables (removed 1308) and now considering 6/2300 (removed 2294) transitions.
Finished structural reductions, in 1 iterations. Remains : 3/1311 places, 6/2300 transitions.
// Phase 1: matrix 6 rows 3 cols
[2023-03-07 07:17:57] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 22051 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 6401 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 2) seen :10
Incomplete Best-First random walk after 1000001 steps, including 6362 resets, run finished after 305 ms. (steps per millisecond=3278 ) properties (out of 2) seen :10
// Phase 1: matrix 6 rows 3 cols
[2023-03-07 07:17:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-07 07:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:58] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-07 07:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:17:58] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[10, 10]
FORMULA CSRepetitions-PT-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23458 ms.
BK_STOP 1678173478656
--------------------
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="CSRepetitions-PT-10"
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 CSRepetitions-PT-10, 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 r095-smll-167814411000012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-10.tgz
mv CSRepetitions-PT-10 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 ;