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.r247-tall-167856434300338.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 ltsminxred
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 r247-tall-167856434300338
=====================================================================

--------------------
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 1678713632619

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LeafsetExtension-PT-S64C4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 13:20:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 13:20:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:20:34] [INFO ] Load time of PNML (sax parser for PT used): 490 ms
[2023-03-13 13:20:34] [INFO ] Transformed 21462 places.
[2023-03-13 13:20:34] [INFO ] Transformed 21129 transitions.
[2023-03-13 13:20:35] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 650 ms.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 1667 ms. (steps per millisecond=5 ) properties (out of 21462) seen :2989
Running SMT prover for 18473 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 13:20:39] [INFO ] Computed 333 place invariants in 2411 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 13:21:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 13:21:04] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18473 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 18473 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 20099 are kept as prefixes of interest. Removing 1363 places using SCC suffix rule.48 ms
Discarding 1363 places :
Also discarding 229 output transitions
Drop transitions removed 229 transitions
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 161 rules applied. Total rules applied 162 place count 20099 transition count 20739
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 133 rules applied. Total rules applied 295 place count 20063 transition count 20642
Reduce places removed 97 places and 0 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 2 with 257 rules applied. Total rules applied 552 place count 19966 transition count 20482
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 3 with 160 rules applied. Total rules applied 712 place count 19806 transition count 20482
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 115 Pre rules applied. Total rules applied 712 place count 19806 transition count 20367
Deduced a syphon composed of 115 places in 10 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 4 with 230 rules applied. Total rules applied 942 place count 19691 transition count 20367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 943 place count 19690 transition count 20366
Iterating global reduction 4 with 1 rules applied. Total rules applied 944 place count 19690 transition count 20366
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 954 place count 19690 transition count 20356
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 964 place count 19680 transition count 20356
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 965 place count 19680 transition count 20356
Applied a total of 965 rules in 1851 ms. Remains 19680 /21462 variables (removed 1782) and now considering 20356/21129 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1855 ms. Remains : 19680/21462 places, 20356/21129 transitions.
Interrupted random walk after 210772 steps, including 8146 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 18435
Incomplete Best-First random walk after 100001 steps, including 98 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 38) seen :5
Incomplete Best-First random walk after 100001 steps, including 98 resets, run finished after 263 ms. (steps per millisecond=380 ) properties (out of 33) seen :5
Incomplete Best-First random walk after 100001 steps, including 99 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 102 resets, run finished after 246 ms. (steps per millisecond=406 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 100001 steps, including 97 resets, run finished after 236 ms. (steps per millisecond=423 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 100001 steps, including 99 resets, run finished after 238 ms. (steps per millisecond=420 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 97 resets, run finished after 236 ms. (steps per millisecond=423 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 99 resets, run finished after 234 ms. (steps per millisecond=427 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 100001 steps, including 103 resets, run finished after 233 ms. (steps per millisecond=429 ) properties (out of 20) seen :9
Incomplete Best-First random walk after 100001 steps, including 100 resets, run finished after 229 ms. (steps per millisecond=436 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 100001 steps, including 103 resets, run finished after 226 ms. (steps per millisecond=442 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 211 ms. (steps per millisecond=473 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 212 ms. (steps per millisecond=471 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 20356 rows 19680 cols
[2023-03-13 13:21:41] [INFO ] Computed 120 place invariants in 1141 ms
[2023-03-13 13:21:45] [INFO ] After 3874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 13:21:49] [INFO ] [Nat]Absence check using 0 positive and 120 generalized place invariants in 118 ms returned sat
[2023-03-13 13:22:35] [INFO ] After 44809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 13:22:44] [INFO ] After 53955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4352 ms.
[2023-03-13 13:22:48] [INFO ] After 63555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 7 out of 19680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19680/19680 places, 20356/20356 transitions.
Graph (complete) has 36204 edges and 19680 vertex of which 528 are kept as prefixes of interest. Removing 19152 places using SCC suffix rule.7 ms
Discarding 19152 places :
Also discarding 11653 output transitions
Drop transitions removed 11653 transitions
Drop transitions removed 4152 transitions
Reduce isomorphic transitions removed 4152 transitions.
Discarding 31 places :
Implicit places reduction removed 31 places
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 4333 rules applied. Total rules applied 4334 place count 497 transition count 4401
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 4484 place count 347 transition count 4401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4484 place count 347 transition count 4398
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4490 place count 344 transition count 4398
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 4519 place count 315 transition count 4369
Iterating global reduction 2 with 29 rules applied. Total rules applied 4548 place count 315 transition count 4369
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 2 with 4 rules applied. Total rules applied 4552 place count 313 transition count 4367
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 4585 place count 313 transition count 4334
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 4618 place count 280 transition count 4334
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 3 with 125 rules applied. Total rules applied 4743 place count 280 transition count 4334
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 4747 place count 276 transition count 4334
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4748 place count 276 transition count 4333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4749 place count 275 transition count 4333
Applied a total of 4749 rules in 707 ms. Remains 275 /19680 variables (removed 19405) and now considering 4333/20356 (removed 16023) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 275/19680 places, 4333/20356 transitions.
Finished random walk after 2392 steps, including 363 resets, run visited all 7 properties in 69 ms. (steps per millisecond=34 )
Able to resolve query StableMarking after proving 21462 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 135413 ms.
ITS solved all properties within timeout

BK_STOP 1678713770841

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ltsminxred"
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 ltsminxred"
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 r247-tall-167856434300338"
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 ;