About the Execution of ITS-Tools for RefineWMG-PT-100101
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572500581.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-100101, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572500581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.4K Apr 30 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 02:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 218K 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 RefineWMG-PT-100101-UpperBounds-00
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-01
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-02
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-03
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-04
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-05
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-06
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-07
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-08
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-09
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-10
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-11
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-12
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-13
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-14
FORMULA_NAME RefineWMG-PT-100101-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1653087270799
Running Version 202205111006
[2022-05-20 22:54:32] [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-20 22:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:54:32] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-05-20 22:54:32] [INFO ] Transformed 504 places.
[2022-05-20 22:54:32] [INFO ] Transformed 403 transitions.
[2022-05-20 22:54:32] [INFO ] Parsed PT model containing 504 places and 403 transitions in 242 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:32] [INFO ] Computed 202 place invariants in 17 ms
FORMULA RefineWMG-PT-100101-UpperBounds-13 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-UpperBounds-11 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-UpperBounds-08 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-UpperBounds-06 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-UpperBounds-04 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-UpperBounds-00 101 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :303
FORMULA RefineWMG-PT-100101-UpperBounds-14 101 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-10 101 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-09 101 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:33] [INFO ] Computed 202 place invariants in 11 ms
[2022-05-20 22:54:33] [INFO ] [Real]Absence check using 202 positive place invariants in 76 ms returned sat
[2022-05-20 22:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:34] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2022-05-20 22:54:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:35] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2022-05-20 22:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:35] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 22:54:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-20 22:54:36] [INFO ] Added : 139 causal constraints over 28 iterations in 844 ms. Result :sat
Minimization took 200 ms.
[2022-05-20 22:54:36] [INFO ] [Real]Absence check using 202 positive place invariants in 42 ms returned sat
[2022-05-20 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:36] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-20 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 1297 ms returned sat
[2022-05-20 22:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:41] [INFO ] [Nat]Absence check using state equation in 3629 ms returned unknown
[2022-05-20 22:54:42] [INFO ] [Real]Absence check using 202 positive place invariants in 39 ms returned sat
[2022-05-20 22:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:42] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-20 22:54:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:42] [INFO ] [Nat]Absence check using 202 positive place invariants in 40 ms returned sat
[2022-05-20 22:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:42] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-20 22:54:42] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-20 22:54:42] [INFO ] Added : 46 causal constraints over 10 iterations in 314 ms. Result :sat
Minimization took 233 ms.
[2022-05-20 22:54:43] [INFO ] [Real]Absence check using 202 positive place invariants in 77 ms returned sat
[2022-05-20 22:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:43] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-05-20 22:54:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 32 ms returned sat
[2022-05-20 22:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:43] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-05-20 22:54:43] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-20 22:54:44] [INFO ] Added : 45 causal constraints over 9 iterations in 270 ms. Result :sat
Minimization took 251 ms.
[2022-05-20 22:54:44] [INFO ] [Real]Absence check using 202 positive place invariants in 37 ms returned sat
[2022-05-20 22:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:44] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-05-20 22:54:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:44] [INFO ] [Nat]Absence check using 202 positive place invariants in 33 ms returned sat
[2022-05-20 22:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:45] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-05-20 22:54:45] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-20 22:54:45] [INFO ] Added : 138 causal constraints over 28 iterations in 790 ms. Result :sat
Minimization took 271 ms.
[2022-05-20 22:54:46] [INFO ] [Real]Absence check using 202 positive place invariants in 31 ms returned sat
[2022-05-20 22:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:46] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-05-20 22:54:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2022-05-20 22:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:47] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-20 22:54:47] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 22:54:48] [INFO ] Added : 198 causal constraints over 40 iterations in 1073 ms. Result :sat
Minimization took 194 ms.
[2022-05-20 22:54:48] [INFO ] [Real]Absence check using 202 positive place invariants in 37 ms returned sat
[2022-05-20 22:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:48] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-20 22:54:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:54:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 45 ms returned sat
[2022-05-20 22:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:54:48] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-05-20 22:54:48] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-20 22:54:49] [INFO ] Added : 162 causal constraints over 33 iterations in 748 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 101, 101, 101, 7, 7] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA RefineWMG-PT-100101-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-07 101 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-05 101 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RefineWMG-PT-100101-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 12 ms
Free SCC test removed 100 places
Drop transitions removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 304 transition count 203
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 401 place count 104 transition count 103
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 497 place count 104 transition count 7
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 97 rules applied. Total rules applied 594 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 595 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 595 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 597 place count 6 transition count 5
Applied a total of 597 rules in 127 ms. Remains 6 /504 variables (removed 498) and now considering 5/403 (removed 398) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 22:55:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 22:55:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/504 places, 5/403 transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 22:55:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 1) seen :7
FORMULA RefineWMG-PT-100101-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 46495 ms.
BK_STOP 1653087318947
--------------------
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="RefineWMG-PT-100101"
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 RefineWMG-PT-100101, 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 r186-tajo-165281572500581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 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 ;