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

About the Execution of 2022-gold for Diffusion2D-PT-D50N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
611.783 86072.00 101644.00 520.10 150 150 150 150 150 150 150 150 150 150 150 150 150 150 150 150 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.r159-smll-167819445100035.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 gold2022
Input is Diffusion2D-PT-D50N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445100035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 26 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 04:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 04:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 04:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678465572826

Running Version 202205111006
[2023-03-10 16:26:15] [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]
[2023-03-10 16:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:26:16] [INFO ] Load time of PNML (sax parser for PT used): 1151 ms
[2023-03-10 16:26:16] [INFO ] Transformed 2500 places.
[2023-03-10 16:26:16] [INFO ] Transformed 19404 transitions.
[2023-03-10 16:26:16] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 1487 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-10 16:26:17] [INFO ] Computed 1 place invariants in 282 ms
Incomplete random walk after 10118 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=481 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) 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 16) 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 16) 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 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) 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 16) 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 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-10 16:26:18] [INFO ] Computed 1 place invariants in 238 ms
[2023-03-10 16:26:19] [INFO ] [Real]Absence check using 1 positive place invariants in 79 ms returned sat
[2023-03-10 16:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:23] [INFO ] [Real]Absence check using state equation in 3947 ms returned unknown
[2023-03-10 16:26:23] [INFO ] [Real]Absence check using 1 positive place invariants in 40 ms returned sat
[2023-03-10 16:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:28] [INFO ] [Real]Absence check using state equation in 4564 ms returned unknown
[2023-03-10 16:26:28] [INFO ] [Real]Absence check using 1 positive place invariants in 38 ms returned sat
[2023-03-10 16:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:33] [INFO ] [Real]Absence check using state equation in 4504 ms returned unknown
[2023-03-10 16:26:33] [INFO ] [Real]Absence check using 1 positive place invariants in 43 ms returned sat
[2023-03-10 16:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:38] [INFO ] [Real]Absence check using state equation in 4535 ms returned unknown
[2023-03-10 16:26:38] [INFO ] [Real]Absence check using 1 positive place invariants in 43 ms returned sat
[2023-03-10 16:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:43] [INFO ] [Real]Absence check using state equation in 4528 ms returned unknown
[2023-03-10 16:26:43] [INFO ] [Real]Absence check using 1 positive place invariants in 37 ms returned sat
[2023-03-10 16:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:48] [INFO ] [Real]Absence check using state equation in 4634 ms returned unknown
[2023-03-10 16:26:48] [INFO ] [Real]Absence check using 1 positive place invariants in 63 ms returned sat
[2023-03-10 16:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:53] [INFO ] [Real]Absence check using state equation in 4485 ms returned unknown
[2023-03-10 16:26:53] [INFO ] [Real]Absence check using 1 positive place invariants in 36 ms returned sat
[2023-03-10 16:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:26:58] [INFO ] [Real]Absence check using state equation in 4626 ms returned unknown
[2023-03-10 16:26:58] [INFO ] [Real]Absence check using 1 positive place invariants in 54 ms returned sat
[2023-03-10 16:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:03] [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)
[2023-03-10 16:27:03] [INFO ] [Real]Absence check using 1 positive place invariants in 38 ms returned sat
[2023-03-10 16:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:08] [INFO ] [Real]Absence check using state equation in 4636 ms returned unknown
[2023-03-10 16:27:08] [INFO ] [Real]Absence check using 1 positive place invariants in 53 ms returned sat
[2023-03-10 16:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:13] [INFO ] [Real]Absence check using state equation in 4474 ms returned unknown
[2023-03-10 16:27:13] [INFO ] [Real]Absence check using 1 positive place invariants in 38 ms returned sat
[2023-03-10 16:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:18] [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 11
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)
[2023-03-10 16:27:19] [INFO ] [Real]Absence check using 1 positive place invariants in 62 ms returned sat
[2023-03-10 16:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:23] [INFO ] [Real]Absence check using state equation in 4407 ms returned unknown
[2023-03-10 16:27:23] [INFO ] [Real]Absence check using 1 positive place invariants in 60 ms returned sat
[2023-03-10 16:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:28] [INFO ] [Real]Absence check using state equation in 4611 ms returned unknown
[2023-03-10 16:27:28] [INFO ] [Real]Absence check using 1 positive place invariants in 37 ms returned sat
[2023-03-10 16:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:33] [INFO ] [Real]Absence check using state equation in 4638 ms returned unknown
[2023-03-10 16:27:33] [INFO ] [Real]Absence check using 1 positive place invariants in 62 ms returned sat
[2023-03-10 16:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:27:38] [INFO ] [Real]Absence check using state equation in 4587 ms returned unknown
Current structural bounds on expressions (after SMT) : [150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150, 150] Max seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19160 edges and 2500 vertex of which 2484 / 2500 are part of one of the 1 SCC in 41 ms
Free SCC test removed 2483 places
Drop transitions removed 19160 transitions
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 19372 transitions.
Applied a total of 1 rules in 115 ms. Remains 17 /2500 variables (removed 2483) and now considering 32/19404 (removed 19372) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/2500 places, 32/19404 transitions.
// Phase 1: matrix 32 rows 17 cols
[2023-03-10 16:27:38] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000014 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6135 ) properties (out of 16) seen :2400
FORMULA Diffusion2D-PT-D50N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D50N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83440 ms.

BK_STOP 1678465658898

--------------------
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="Diffusion2D-PT-D50N150"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is Diffusion2D-PT-D50N150, 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 r159-smll-167819445100035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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