Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024800173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.7M May 10 09:34 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 ShieldIIPs-PT-100B-UpperBounds-00
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-01
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-02
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-03
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-04
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-05
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-06
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-07
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-08
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-09
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-10
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-11
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-12
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-13
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-14
FORMULA_NAME ShieldIIPs-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652948845739

Running Version 202205111006
[2022-05-19 08:27:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 08:27:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:27:27] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2022-05-19 08:27:27] [INFO ] Transformed 6003 places.
[2022-05-19 08:27:27] [INFO ] Transformed 5903 transitions.
[2022-05-19 08:27:27] [INFO ] Found NUPN structural information;
[2022-05-19 08:27:27] [INFO ] Parsed PT model containing 6003 places and 5903 transitions in 669 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 5903 rows 6003 cols
[2022-05-19 08:27:28] [INFO ] Computed 901 place invariants in 75 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 16) seen :7
FORMULA ShieldIIPs-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
// Phase 1: matrix 5903 rows 6003 cols
[2022-05-19 08:27:28] [INFO ] Computed 901 place invariants in 42 ms
[2022-05-19 08:27:30] [INFO ] [Real]Absence check using 901 positive place invariants in 579 ms returned sat
[2022-05-19 08:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:27:33] [INFO ] [Real]Absence check using state equation in 3487 ms returned unknown
[2022-05-19 08:27:35] [INFO ] [Real]Absence check using 901 positive place invariants in 607 ms returned sat
[2022-05-19 08:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:27:38] [INFO ] [Real]Absence check using state equation in 3599 ms returned unknown
[2022-05-19 08:27:39] [INFO ] [Real]Absence check using 901 positive place invariants in 559 ms returned sat
[2022-05-19 08:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:27:43] [INFO ] [Real]Absence check using state equation in 3642 ms returned unknown
[2022-05-19 08:27:45] [INFO ] [Real]Absence check using 901 positive place invariants in 544 ms returned sat
[2022-05-19 08:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:27:48] [INFO ] [Real]Absence check using state equation in 3639 ms returned unknown
[2022-05-19 08:27:50] [INFO ] [Real]Absence check using 901 positive place invariants in 564 ms returned sat
[2022-05-19 08:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:27:53] [INFO ] [Real]Absence check using state equation in 3646 ms returned unknown
[2022-05-19 08:27:55] [INFO ] [Real]Absence check using 901 positive place invariants in 548 ms returned sat
[2022-05-19 08:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:27:58] [INFO ] [Real]Absence check using state equation in 3635 ms returned unknown
[2022-05-19 08:28:00] [INFO ] [Real]Absence check using 901 positive place invariants in 560 ms returned sat
[2022-05-19 08:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:28:03] [INFO ] [Real]Absence check using state equation in 3550 ms returned unknown
[2022-05-19 08:28:05] [INFO ] [Real]Absence check using 901 positive place invariants in 531 ms returned sat
[2022-05-19 08:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:28:08] [INFO ] [Real]Absence check using state equation in 3657 ms returned unknown
[2022-05-19 08:28:10] [INFO ] [Real]Absence check using 901 positive place invariants in 555 ms returned sat
[2022-05-19 08:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:28:13] [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: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 6003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 498 place count 6003 transition count 5405
Reduce places removed 498 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 500 rules applied. Total rules applied 998 place count 5505 transition count 5403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1000 place count 5503 transition count 5403
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1000 place count 5503 transition count 4903
Deduced a syphon composed of 500 places in 40 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2000 place count 5003 transition count 4903
Discarding 698 places :
Symmetric choice reduction at 3 with 698 rule applications. Total rules 2698 place count 4305 transition count 4205
Iterating global reduction 3 with 698 rules applied. Total rules applied 3396 place count 4305 transition count 4205
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 296 Pre rules applied. Total rules applied 3396 place count 4305 transition count 3909
Deduced a syphon composed of 296 places in 20 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 3 with 592 rules applied. Total rules applied 3988 place count 4009 transition count 3909
Performed 1501 Post agglomeration using F-continuation condition.Transition count delta: 1501
Deduced a syphon composed of 1501 places in 11 ms
Reduce places removed 1501 places and 0 transitions.
Iterating global reduction 3 with 3002 rules applied. Total rules applied 6990 place count 2508 transition count 2408
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 693 times.
Drop transitions removed 693 transitions
Iterating global reduction 3 with 693 rules applied. Total rules applied 7683 place count 2508 transition count 2408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7684 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7685 place count 2506 transition count 2407
Applied a total of 7685 rules in 3297 ms. Remains 2506 /6003 variables (removed 3497) and now considering 2407/5903 (removed 3496) transitions.
Finished structural reductions, in 1 iterations. Remains : 2506/6003 places, 2407/5903 transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2022-05-19 08:28:17] [INFO ] Computed 900 place invariants in 137 ms
Incomplete random walk after 1000000 steps, including 81 resets, run finished after 17430 ms. (steps per millisecond=57 ) properties (out of 9) seen :9
FORMULA ShieldIIPs-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 67524 ms.

BK_STOP 1652948914748

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldIIPs-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-100B, 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 r222-tall-165286024800173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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