fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r281-smll-167863550800168
Last Updated
May 14, 2023

About the Execution of Smart+red for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
445.340 79767.00 130803.00 692.60 T normal

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.r281-smll-167863550800168.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 NoC3x3-PT-3B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r281-smll-167863550800168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 581K Mar 5 18:23 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 1678913593836

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=NoC3x3-PT-3B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 20:53:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-15 20:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:53:18] [INFO ] Load time of PNML (sax parser for PT used): 377 ms
[2023-03-15 20:53:18] [INFO ] Transformed 2117 places.
[2023-03-15 20:53:18] [INFO ] Transformed 2435 transitions.
[2023-03-15 20:53:18] [INFO ] Found NUPN structural information;
[2023-03-15 20:53:18] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 596 ms.
Graph (trivial) has 1749 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 19 ms
Free SCC test removed 63 places
Structural test allowed to assert that 340 places are NOT stable. Took 55 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 1624 ms. (steps per millisecond=6 ) properties (out of 1777) seen :1149
Running SMT prover for 628 properties.
[2023-03-15 20:53:20] [INFO ] Flow matrix only has 2364 transitions (discarded 8 similar events)
// Phase 1: matrix 2364 rows 2054 cols
[2023-03-15 20:53:20] [INFO ] Computed 66 place invariants in 43 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-15 20:53:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 20:53:46] [INFO ] After 25132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 628 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 628 out of 2054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2054/2054 places, 2372/2372 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 293 rules applied. Total rules applied 293 place count 2051 transition count 2082
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 283 rules applied. Total rules applied 576 place count 1770 transition count 2080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 577 place count 1769 transition count 2080
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 577 place count 1769 transition count 2056
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 625 place count 1745 transition count 2056
Discarding 193 places :
Symmetric choice reduction at 3 with 193 rule applications. Total rules 818 place count 1552 transition count 1863
Iterating global reduction 3 with 193 rules applied. Total rules applied 1011 place count 1552 transition count 1863
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1011 place count 1552 transition count 1851
Deduced a syphon composed of 12 places in 25 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1035 place count 1540 transition count 1851
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1102 place count 1473 transition count 1784
Iterating global reduction 3 with 67 rules applied. Total rules applied 1169 place count 1473 transition count 1784
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1229 place count 1413 transition count 1722
Iterating global reduction 3 with 60 rules applied. Total rules applied 1289 place count 1413 transition count 1722
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1301 place count 1401 transition count 1700
Iterating global reduction 3 with 12 rules applied. Total rules applied 1313 place count 1401 transition count 1700
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1315 place count 1401 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1325 place count 1391 transition count 1688
Iterating global reduction 4 with 10 rules applied. Total rules applied 1335 place count 1391 transition count 1688
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1341 place count 1385 transition count 1676
Iterating global reduction 4 with 6 rules applied. Total rules applied 1347 place count 1385 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1353 place count 1379 transition count 1670
Iterating global reduction 4 with 6 rules applied. Total rules applied 1359 place count 1379 transition count 1670
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1365 place count 1379 transition count 1664
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 5 with 480 rules applied. Total rules applied 1845 place count 1139 transition count 1424
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1850 place count 1134 transition count 1419
Iterating global reduction 5 with 5 rules applied. Total rules applied 1855 place count 1134 transition count 1419
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1885 place count 1119 transition count 1489
Free-agglomeration rule applied 114 times.
Iterating global reduction 5 with 114 rules applied. Total rules applied 1999 place count 1119 transition count 1375
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2125 place count 1005 transition count 1363
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 2141 place count 1005 transition count 1347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2142 place count 1004 transition count 1347
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2148 place count 1004 transition count 1341
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2154 place count 998 transition count 1341
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 2159 place count 998 transition count 1336
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 2164 place count 993 transition count 1336
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 2175 place count 993 transition count 1336
Partial Post-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 2195 place count 993 transition count 1336
Applied a total of 2195 rules in 1506 ms. Remains 993 /2054 variables (removed 1061) and now considering 1336/2372 (removed 1036) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1507 ms. Remains : 993/2054 places, 1336/2372 transitions.
Interrupted random walk after 757930 steps, including 8731 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 622
Incomplete Best-First random walk after 1000001 steps, including 743 resets, run finished after 2804 ms. (steps per millisecond=356 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 731 resets, run finished after 2576 ms. (steps per millisecond=388 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 742 resets, run finished after 2710 ms. (steps per millisecond=369 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 734 resets, run finished after 2520 ms. (steps per millisecond=396 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 736 resets, run finished after 2515 ms. (steps per millisecond=397 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1336 rows 993 cols
[2023-03-15 20:54:30] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-15 20:54:31] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 20:54:31] [INFO ] [Nat]Absence check using 62 positive place invariants in 33 ms returned sat
[2023-03-15 20:54:32] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-15 20:54:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-15 20:54:32] [INFO ] After 112ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-15 20:54:32] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-15 20:54:32] [INFO ] After 1548ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL SAT_SMT
Total runtime 74940 ms.
ITS solved all properties within timeout

BK_STOP 1678913673603

--------------------
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="NoC3x3-PT-3B"
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 NoC3x3-PT-3B, 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 r281-smll-167863550800168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 ;