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.r249-tall-167856436000338.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 smartxred
Input is LeafsetExtension-PT-S64C4, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r249-tall-167856436000338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678737211619

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LeafsetExtension-PT-S64C4
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 19:53:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 19:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:53:33] [INFO ] Load time of PNML (sax parser for PT used): 538 ms
[2023-03-13 19:53:33] [INFO ] Transformed 21462 places.
[2023-03-13 19:53:33] [INFO ] Transformed 21129 transitions.
[2023-03-13 19:53:33] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 685 ms.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 1667 ms. (steps per millisecond=5 ) properties (out of 21462) seen :2939
Running SMT prover for 18523 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 19:53:38] [INFO ] Computed 333 place invariants in 2541 ms
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 19:54:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:54:04] [INFO ] After 25094ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18523 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 18523 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 20111 are kept as prefixes of interest. Removing 1351 places using SCC suffix rule.51 ms
Discarding 1351 places :
Also discarding 219 output transitions
Drop transitions removed 219 transitions
Drop transitions removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 20111 transition count 20759
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 1 with 122 rules applied. Total rules applied 274 place count 20076 transition count 20672
Reduce places removed 87 places and 0 transitions.
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Iterating post reduction 2 with 232 rules applied. Total rules applied 506 place count 19989 transition count 20527
Reduce places removed 145 places and 0 transitions.
Iterating post reduction 3 with 145 rules applied. Total rules applied 651 place count 19844 transition count 20527
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 651 place count 19844 transition count 20421
Deduced a syphon composed of 106 places in 13 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 863 place count 19738 transition count 20421
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 866 place count 19735 transition count 20418
Iterating global reduction 4 with 3 rules applied. Total rules applied 869 place count 19735 transition count 20418
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 884 place count 19735 transition count 20403
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 899 place count 19720 transition count 20403
Applied a total of 899 rules in 1723 ms. Remains 19720 /21462 variables (removed 1742) and now considering 20403/21129 (removed 726) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1726 ms. Remains : 19720/21462 places, 20403/21129 transitions.
Interrupted random walk after 186802 steps, including 7090 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 18447
Incomplete Best-First random walk after 100001 steps, including 102 resets, run finished after 265 ms. (steps per millisecond=377 ) properties (out of 76) seen :4
Incomplete Best-First random walk after 100001 steps, including 99 resets, run finished after 292 ms. (steps per millisecond=342 ) properties (out of 72) seen :4
Incomplete Best-First random walk after 100001 steps, including 97 resets, run finished after 218 ms. (steps per millisecond=458 ) properties (out of 68) seen :3
Incomplete Best-First random walk after 100001 steps, including 97 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 65) seen :4
Incomplete Best-First random walk after 100001 steps, including 104 resets, run finished after 264 ms. (steps per millisecond=378 ) properties (out of 61) seen :7
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 207 ms. (steps per millisecond=483 ) properties (out of 54) seen :12
Incomplete Best-First random walk after 100001 steps, including 99 resets, run finished after 210 ms. (steps per millisecond=476 ) properties (out of 42) seen :8
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 209 ms. (steps per millisecond=478 ) properties (out of 34) seen :8
Incomplete Best-First random walk after 100001 steps, including 102 resets, run finished after 210 ms. (steps per millisecond=476 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 215 ms. (steps per millisecond=465 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 100001 steps, including 99 resets, run finished after 207 ms. (steps per millisecond=483 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 98 resets, run finished after 197 ms. (steps per millisecond=507 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 207 ms. (steps per millisecond=483 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 198 ms. (steps per millisecond=505 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 186 ms. (steps per millisecond=537 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 179 ms. (steps per millisecond=558 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 174 ms. (steps per millisecond=574 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 179 ms. (steps per millisecond=558 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 20403 rows 19720 cols
[2023-03-13 19:54:41] [INFO ] Computed 129 place invariants in 1200 ms
[2023-03-13 19:54:44] [INFO ] After 2963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:54:47] [INFO ] [Nat]Absence check using 0 positive and 129 generalized place invariants in 114 ms returned sat
[2023-03-13 19:55:28] [INFO ] After 39961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:55:33] [INFO ] After 45208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2278 ms.
[2023-03-13 19:55:35] [INFO ] After 51334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 19720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19720/19720 places, 20403/20403 transitions.
Graph (complete) has 36251 edges and 19720 vertex of which 331 are kept as prefixes of interest. Removing 19389 places using SCC suffix rule.9 ms
Discarding 19389 places :
Also discarding 11954 output transitions
Drop transitions removed 11954 transitions
Drop transitions removed 4155 transitions
Reduce isomorphic transitions removed 4155 transitions.
Discarding 62 places :
Implicit places reduction removed 62 places
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 4278 rules applied. Total rules applied 4279 place count 269 transition count 4233
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 125 rules applied. Total rules applied 4404 place count 207 transition count 4170
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 4435 place count 176 transition count 4170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4435 place count 176 transition count 4169
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4437 place count 175 transition count 4169
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 4466 place count 146 transition count 4140
Iterating global reduction 3 with 29 rules applied. Total rules applied 4495 place count 146 transition count 4140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4499 place count 144 transition count 4138
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4500 place count 144 transition count 4137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4501 place count 143 transition count 4137
Free-agglomeration rule (complex) applied 62 times.
Iterating global reduction 4 with 62 rules applied. Total rules applied 4563 place count 143 transition count 4075
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 4625 place count 81 transition count 4075
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 4657 place count 81 transition count 4075
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 4658 place count 80 transition count 4075
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4659 place count 80 transition count 4074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4660 place count 79 transition count 4074
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 7 with 63 rules applied. Total rules applied 4723 place count 79 transition count 4011
Applied a total of 4723 rules in 934 ms. Remains 79 /19720 variables (removed 19641) and now considering 4011/20403 (removed 16392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 934 ms. Remains : 79/19720 places, 4011/20403 transitions.
Finished random walk after 124 steps, including 22 resets, run visited all 4 properties in 16 ms. (steps per millisecond=7 )
Able to resolve query StableMarking after proving 21462 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 123395 ms.
ITS solved all properties within timeout

BK_STOP 1678737337664

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is LeafsetExtension-PT-S64C4, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r249-tall-167856436000338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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