About the Execution of 2021-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/mcc2022-input.r028-tall-165251936300247.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 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 gold2021
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 r028-tall-165251936300247
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 267K Apr 30 06:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 871K Apr 30 06:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 324K Apr 30 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 30 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 278K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 695K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 296K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 893K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 32K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:33 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 1652541939327
Running Version 0
[2022-05-14 15:25:40] [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-14 15:25:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:25:41] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-05-14 15:25:41] [INFO ] Transformed 1311 places.
[2022-05-14 15:25:41] [INFO ] Transformed 2300 transitions.
[2022-05-14 15:25:41] [INFO ] Parsed PT model containing 1311 places and 2300 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 94 ms.
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-14 15:25:41] [INFO ] Computed 110 place invariants in 64 ms
FORMULA CSRepetitions-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 51 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 13) seen :366
FORMULA CSRepetitions-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :29
// Phase 1: matrix 2300 rows 1311 cols
[2022-05-14 15:25:41] [INFO ] Computed 110 place invariants in 28 ms
[2022-05-14 15:25:42] [INFO ] [Real]Absence check using 110 positive place invariants in 31 ms returned sat
[2022-05-14 15:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:42] [INFO ] [Real]Absence check using state equation in 599 ms returned unsat
[2022-05-14 15:25:43] [INFO ] [Real]Absence check using 110 positive place invariants in 30 ms returned sat
[2022-05-14 15:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:43] [INFO ] [Real]Absence check using state equation in 535 ms returned unsat
[2022-05-14 15:25:43] [INFO ] [Real]Absence check using 110 positive place invariants in 29 ms returned sat
[2022-05-14 15:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:44] [INFO ] [Real]Absence check using state equation in 562 ms returned unsat
[2022-05-14 15:25:44] [INFO ] [Real]Absence check using 110 positive place invariants in 29 ms returned sat
[2022-05-14 15:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:44] [INFO ] [Real]Absence check using state equation in 597 ms returned unsat
[2022-05-14 15:25:45] [INFO ] [Real]Absence check using 110 positive place invariants in 30 ms returned sat
[2022-05-14 15:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:45] [INFO ] [Real]Absence check using state equation in 599 ms returned unsat
[2022-05-14 15:25:45] [INFO ] [Real]Absence check using 110 positive place invariants in 30 ms returned sat
[2022-05-14 15:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:46] [INFO ] [Real]Absence check using state equation in 614 ms returned unsat
[2022-05-14 15:25:46] [INFO ] [Real]Absence check using 110 positive place invariants in 34 ms returned sat
[2022-05-14 15:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:47] [INFO ] [Real]Absence check using state equation in 541 ms returned unsat
[2022-05-14 15:25:47] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned sat
[2022-05-14 15:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:47] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2022-05-14 15:25:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-14 15:25:48] [INFO ] [Real]Added 100 Read/Feed constraints in 23 ms returned sat
[2022-05-14 15:25:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:25:48] [INFO ] [Nat]Absence check using 110 positive place invariants in 34 ms returned sat
[2022-05-14 15:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:48] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2022-05-14 15:25:48] [INFO ] [Nat]Added 100 Read/Feed constraints in 70 ms returned sat
[2022-05-14 15:25:49] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 128 ms.
[2022-05-14 15:25:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, -1] Max seen :[10, 10, 10, 10, 10, 10, 10, 2]
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
FORMULA CSRepetitions-PT-10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1311 transition count 2201
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 1111 transition count 2101
Discarding 990 places :
Symmetric choice reduction at 1 with 990 rule applications. Total rules 1389 place count 121 transition count 1111
Iterating global reduction 1 with 990 rules applied. Total rules applied 2379 place count 121 transition count 1111
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 2469 place count 31 transition count 211
Iterating global reduction 1 with 90 rules applied. Total rules applied 2559 place count 31 transition count 211
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 2649 place count 31 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 2679 place count 11 transition count 111
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Graph (trivial) has 18 edges and 11 vertex of which 10 / 11 are part of one of the 1 SCC in 2 ms
Free SCC test removed 9 places
Iterating post reduction 2 with 91 rules applied. Total rules applied 2770 place count 2 transition count 21
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 2788 place count 2 transition count 3
Applied a total of 2788 rules in 349 ms. Remains 2 /1311 variables (removed 1309) and now considering 3/2300 (removed 2297) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1311 places, 3/2300 transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-14 15:25:54] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000008 steps, including 21973 resets, run finished after 190 ms. (steps per millisecond=5263 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 7398 resets, run finished after 181 ms. (steps per millisecond=5524 ) properties (out of 1) seen :10
// Phase 1: matrix 3 rows 2 cols
[2022-05-14 15:25:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-14 15:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:54] [INFO ] [Real]Absence check using state equation in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [10] Max seen :[10]
FORMULA CSRepetitions-PT-10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652541956403
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="gold2021"
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 gold2021"
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 r028-tall-165251936300247"
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 ;