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.r319-tall-167873970000108.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 QuasiCertifProtocol-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873970000108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 55K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678881930436

Running Version 202205111006
[2023-03-15 12:05:31] [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-15 12:05:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:05:31] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-15 12:05:31] [INFO ] Transformed 86 places.
[2023-03-15 12:05:31] [INFO ] Transformed 56 transitions.
[2023-03-15 12:05:31] [INFO ] Parsed PT model containing 86 places and 56 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 56 rows 86 cols
[2023-03-15 12:05:31] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 1644 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :19
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :17
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 550 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10001 steps, including 357 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 572 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :20
Incomplete Best-First random walk after 10001 steps, including 556 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10000 steps, including 539 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 565 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :17
Incomplete Best-First random walk after 10000 steps, including 559 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10001 steps, including 526 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 569 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :18
Incomplete Best-First random walk after 10001 steps, including 562 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10000 steps, including 561 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :19
// Phase 1: matrix 56 rows 86 cols
[2023-03-15 12:05:32] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-15 12:05:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-15 12:05:32] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-15 12:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-15 12:05:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:32] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-15 12:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 12:05:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 12:05:33] [INFO ] Added : 17 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 12:05:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 12:05:33] [INFO ] Added : 29 causal constraints over 6 iterations in 49 ms. Result :sat
Minimization took 19 ms.
[2023-03-15 12:05:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 12:05:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 12:05:33] [INFO ] Added : 29 causal constraints over 6 iterations in 42 ms. Result :sat
Minimization took 19 ms.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 12:05:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 12:05:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 12:05:33] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 14 ms.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 12:05:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 12:05:33] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 12:05:33] [INFO ] Added : 26 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 12:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 12:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 12:05:34] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:05:34] [INFO ] Added : 25 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2023-03-15 12:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:34] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 3, 9, 3, 3, 3, 3, 1, 1, 3, 1, 1, 1, 3, 1] Max seen :[0, 3, 0, 3, 3, 3, 3, 0, 1, 0, 1, 1, 1, 0, 1]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 75 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.112 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 69 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 63 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 63 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 65 place count 48 transition count 17
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 48 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 47 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 47 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 45 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 82 place count 36 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 35 transition count 11
Ensure Unique test removed 3 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 86 place count 32 transition count 11
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 89 place count 29 transition count 8
Ensure Unique test removed 9 places
Iterating post reduction 5 with 9 rules applied. Total rules applied 98 place count 20 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 99 place count 19 transition count 7
Ensure Unique test removed 3 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 102 place count 16 transition count 7
Applied a total of 102 rules in 141 ms. Remains 16 /86 variables (removed 70) and now considering 7/56 (removed 49) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/86 places, 7/56 transitions.
// Phase 1: matrix 7 rows 16 cols
[2023-03-15 12:05:34] [INFO ] Computed 9 place invariants in 1 ms
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 181825 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 66666 resets, run finished after 276 ms. (steps per millisecond=3623 ) properties (out of 1) seen :1
// Phase 1: matrix 7 rows 16 cols
[2023-03-15 12:05:35] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-15 12:05:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:35] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 12:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:35] [INFO ] [Real]Absence check using state equation in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3706 ms.

BK_STOP 1678881935310

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="QuasiCertifProtocol-PT-02"
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 QuasiCertifProtocol-PT-02, 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 r319-tall-167873970000108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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