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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
581.396 80403.00 103017.00 427.50 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-167819445100027.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-D30N150, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445100027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 04:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 04:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 04:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 04:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 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 3.0M 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-D30N150-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N150-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678465068654

Running Version 202205111006
[2023-03-10 16:17:51] [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:17:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:17:52] [INFO ] Load time of PNML (sax parser for PT used): 789 ms
[2023-03-10 16:17:52] [INFO ] Transformed 900 places.
[2023-03-10 16:17:52] [INFO ] Transformed 6844 transitions.
[2023-03-10 16:17:52] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 1244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-10 16:17:52] [INFO ] Computed 1 place invariants in 88 ms
Incomplete random walk after 10132 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1013 ) 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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :1
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 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :2
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 :2
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 :1
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 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) 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 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) 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 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) 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 16) 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 16) seen :3
// Phase 1: matrix 6844 rows 900 cols
[2023-03-10 16:17:53] [INFO ] Computed 1 place invariants in 38 ms
[2023-03-10 16:17:53] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-10 16:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:55] [INFO ] [Real]Absence check using state equation in 2146 ms returned sat
[2023-03-10 16:17:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:17:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-10 16:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:17:58] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2023-03-10 16:17:59] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 775 ms.
[2023-03-10 16:17:59] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:01] [INFO ] [Real]Absence check using state equation in 1639 ms returned sat
[2023-03-10 16:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:03] [INFO ] [Nat]Absence check using state equation in 1715 ms returned sat
[2023-03-10 16:18:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 872 ms.
[2023-03-10 16:18:04] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:06] [INFO ] [Real]Absence check using state equation in 1922 ms returned sat
[2023-03-10 16:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-10 16:18:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:09] [INFO ] [Nat]Absence check using state equation in 2144 ms returned sat
[2023-03-10 16:18:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 895 ms.
[2023-03-10 16:18:10] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:12] [INFO ] [Real]Absence check using state equation in 1587 ms returned sat
[2023-03-10 16:18:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:14] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2023-03-10 16:18:15] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 654 ms.
[2023-03-10 16:18:15] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-10 16:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:17] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2023-03-10 16:18:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 733 ms.
[2023-03-10 16:18:18] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:20] [INFO ] [Real]Absence check using state equation in 1449 ms returned sat
[2023-03-10 16:18:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:21] [INFO ] [Nat]Absence check using state equation in 1635 ms returned sat
[2023-03-10 16:18:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 663 ms.
[2023-03-10 16:18:23] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2023-03-10 16:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:24] [INFO ] [Real]Absence check using state equation in 1552 ms returned sat
[2023-03-10 16:18:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-10 16:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:26] [INFO ] [Nat]Absence check using state equation in 1892 ms returned sat
[2023-03-10 16:18:27] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 679 ms.
[2023-03-10 16:18:28] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:30] [INFO ] [Real]Absence check using state equation in 2142 ms returned sat
[2023-03-10 16:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-10 16:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:32] [INFO ] [Nat]Absence check using state equation in 2098 ms returned sat
[2023-03-10 16:18:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 613 ms.
[2023-03-10 16:18:33] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-10 16:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:35] [INFO ] [Real]Absence check using state equation in 1693 ms returned sat
[2023-03-10 16:18:36] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 560 ms.
[2023-03-10 16:18:36] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:38] [INFO ] [Real]Absence check using state equation in 2144 ms returned sat
[2023-03-10 16:18:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:40] [INFO ] [Nat]Absence check using state equation in 2013 ms returned sat
[2023-03-10 16:18:41] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 595 ms.
[2023-03-10 16:18:41] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:43] [INFO ] [Real]Absence check using state equation in 1949 ms returned sat
[2023-03-10 16:18:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:46] [INFO ] [Nat]Absence check using state equation in 1827 ms returned sat
[2023-03-10 16:18:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 596 ms.
[2023-03-10 16:18:47] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-10 16:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:48] [INFO ] [Real]Absence check using state equation in 1804 ms returned sat
[2023-03-10 16:18:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:50] [INFO ] [Nat]Absence check using state equation in 1495 ms returned sat
[2023-03-10 16:18:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 487 ms.
[2023-03-10 16:18:51] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-10 16:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:53] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2023-03-10 16:18:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:55] [INFO ] [Nat]Absence check using state equation in 1730 ms returned sat
[2023-03-10 16:18:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 671 ms.
[2023-03-10 16:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:18:58] [INFO ] [Real]Absence check using state equation in 1952 ms returned sat
[2023-03-10 16:18:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:18:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-10 16:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:19:00] [INFO ] [Nat]Absence check using state equation in 1952 ms returned sat
[2023-03-10 16:19:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 550 ms.
[2023-03-10 16:19:01] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-10 16:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:19:03] [INFO ] [Real]Absence check using state equation in 1750 ms returned sat
[2023-03-10 16:19:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:19:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:19:05] [INFO ] [Nat]Absence check using state equation in 1712 ms returned sat
[2023-03-10 16:19:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 662 ms.
[2023-03-10 16:19:06] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-10 16:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:19:07] [INFO ] [Real]Absence check using state equation in 1709 ms returned sat
[2023-03-10 16:19:08] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 521 ms.
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, 2, 0, 0, 0, 0, 0, 0, 3]
Support contains 16 out of 900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6606 edges and 900 vertex of which 884 / 900 are part of one of the 1 SCC in 21 ms
Free SCC test removed 883 places
Drop transitions removed 6606 transitions
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 6812 transitions.
Applied a total of 1 rules in 53 ms. Remains 17 /900 variables (removed 883) and now considering 32/6844 (removed 6812) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/900 places, 32/6844 transitions.
// Phase 1: matrix 32 rows 17 cols
[2023-03-10 16:19:08] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=5235 ) properties (out of 16) seen :2400
FORMULA Diffusion2D-PT-D30N150-UpperBounds-15 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-14 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-13 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-12 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-11 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-10 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-09 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-08 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-07 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-06 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-05 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-04 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-03 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-02 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-01 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-UpperBounds-00 150 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 77761 ms.

BK_STOP 1678465149057

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-D30N150"
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-D30N150, 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-167819445100027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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