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.r391-oct2-167903715500621.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPt-PT-010B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500621
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 185K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679279121741

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:25:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 02:25:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:25:24] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-20 02:25:24] [INFO ] Transformed 783 places.
[2023-03-20 02:25:24] [INFO ] Transformed 713 transitions.
[2023-03-20 02:25:24] [INFO ] Found NUPN structural information;
[2023-03-20 02:25:24] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 713 rows 783 cols
[2023-03-20 02:25:24] [INFO ] Computed 111 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :15
FORMULA ShieldPPPt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
[2023-03-20 02:25:25] [INFO ] Invariant cache hit.
[2023-03-20 02:25:25] [INFO ] [Real]Absence check using 111 positive place invariants in 55 ms returned sat
[2023-03-20 02:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:25:25] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-20 02:25:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:25:26] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2023-03-20 02:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:25:26] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-20 02:25:26] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 4 ms to minimize.
[2023-03-20 02:25:27] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:25:27] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2023-03-20 02:25:27] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:25:27] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2023-03-20 02:25:27] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2023-03-20 02:25:28] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 1 ms to minimize.
[2023-03-20 02:25:28] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:25:28] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:25:28] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2023-03-20 02:25:29] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2023-03-20 02:25:29] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:25:29] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:25:29] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:25:29] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:25:30] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 1 ms to minimize.
[2023-03-20 02:25:30] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 0 ms to minimize.
[2023-03-20 02:25:30] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:25:30] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:25:31] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 1 ms to minimize.
[2023-03-20 02:25:31] [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 0
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 783 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 712/712 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 1176 edges and 781 vertex of which 780 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 780 transition count 516
Reduce places removed 195 places and 1 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 197 rules applied. Total rules applied 394 place count 585 transition count 513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 395 place count 584 transition count 513
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 395 place count 584 transition count 473
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 475 place count 544 transition count 473
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 543 place count 476 transition count 405
Iterating global reduction 3 with 68 rules applied. Total rules applied 611 place count 476 transition count 405
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 611 place count 476 transition count 377
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 667 place count 448 transition count 377
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 1007 place count 278 transition count 207
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1063 place count 250 transition count 207
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 1092 place count 250 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1093 place count 249 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1094 place count 248 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1094 place count 248 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1098 place count 246 transition count 204
Applied a total of 1098 rules in 175 ms. Remains 246 /783 variables (removed 537) and now considering 204/712 (removed 508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 246/783 places, 204/712 transitions.
// Phase 1: matrix 204 rows 246 cols
[2023-03-20 02:25:31] [INFO ] Computed 109 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 133 resets, run finished after 3371 ms. (steps per millisecond=296 ) properties (out of 1) seen :1
FORMULA ShieldPPPt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10326 ms.
ITS solved all properties within timeout

BK_STOP 1679279134996

--------------------
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 UpperBounds -timeout 360 -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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPt-PT-010B, 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 r391-oct2-167903715500621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;