fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875000155
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Diffusion2D-PT-D30N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
809.716 40665.00 54623.00 146.10 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.0M May 5 16:51 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-D30N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620551433151

Running Version 0
[2021-05-09 09:10:35] [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]
[2021-05-09 09:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:10:35] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2021-05-09 09:10:35] [INFO ] Transformed 900 places.
[2021-05-09 09:10:35] [INFO ] Transformed 6844 transitions.
[2021-05-09 09:10:35] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 418 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:10:35] [INFO ] Computed 1 place invariants in 100 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :100
FORMULA Diffusion2D-PT-D30N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :4
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:10:36] [INFO ] Computed 1 place invariants in 45 ms
[2021-05-09 09:10:36] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2021-05-09 09:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:37] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2021-05-09 09:10:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:10:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:38] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2021-05-09 09:10:39] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 514 ms.
[2021-05-09 09:10:39] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2021-05-09 09:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:40] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2021-05-09 09:10:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:10:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:42] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2021-05-09 09:10:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 468 ms.
[2021-05-09 09:10:42] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:43] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2021-05-09 09:10:44] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 401 ms.
[2021-05-09 09:10:44] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:45] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2021-05-09 09:10:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:10:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-09 09:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:46] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2021-05-09 09:10:47] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 328 ms.
[2021-05-09 09:10:47] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2021-05-09 09:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:48] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2021-05-09 09:10:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:10:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:49] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2021-05-09 09:10:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 344 ms.
[2021-05-09 09:10:49] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:51] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2021-05-09 09:10:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:10:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:52] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2021-05-09 09:10:52] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 330 ms.
[2021-05-09 09:10:53] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:54] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2021-05-09 09:10:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:10:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:55] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2021-05-09 09:10:55] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 342 ms.
[2021-05-09 09:10:55] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:57] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2021-05-09 09:10:57] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 325 ms.
[2021-05-09 09:10:57] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:10:58] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2021-05-09 09:10:59] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 318 ms.
[2021-05-09 09:10:59] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:00] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2021-05-09 09:11:00] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 332 ms.
[2021-05-09 09:11:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:01] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2021-05-09 09:11:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:11:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:02] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2021-05-09 09:11:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 338 ms.
[2021-05-09 09:11:03] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:11:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:04] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2021-05-09 09:11:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:11:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:05] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2021-05-09 09:11:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 323 ms.
[2021-05-09 09:11:05] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:06] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2021-05-09 09:11:07] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 324 ms.
[2021-05-09 09:11:07] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:08] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2021-05-09 09:11:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:11:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:09] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2021-05-09 09:11:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 317 ms.
[2021-05-09 09:11:10] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2021-05-09 09:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:11] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2021-05-09 09:11:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 09:11:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 09:11:12] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2021-05-09 09:11:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 326 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[0, 0, 1, 0, 0, 0, 0, 1, 1, 3, 0, 0, 1, 0, 0]
Support contains 15 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6610 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 14 ms
Free SCC test removed 884 places
Drop transitions removed 6610 transitions
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 6814 transitions.
Applied a total of 1 rules in 38 ms. Remains 16 /900 variables (removed 884) and now considering 30/6844 (removed 6814) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/900 places, 30/6844 transitions.
// Phase 1: matrix 30 rows 16 cols
[2021-05-09 09:11:12] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 15) seen :1500
FORMULA Diffusion2D-PT-D30N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620551473816

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-D30N100"
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 Diffusion2D-PT-D30N100, 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 r083-tall-162048875000155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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