Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 29 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 23:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 23:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 23:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 23:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 29 23:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655082944095

Running Version 0
[2022-06-13 01:15:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:15:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:15:46] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2022-06-13 01:15:46] [INFO ] Transformed 274 places.
[2022-06-13 01:15:46] [INFO ] Transformed 237 transitions.
[2022-06-13 01:15:46] [INFO ] Found NUPN structural information;
[2022-06-13 01:15:46] [INFO ] Parsed PT model containing 274 places and 237 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 114 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 15) seen :5
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 236 rows 273 cols
[2022-06-13 01:15:46] [INFO ] Computed 43 place invariants in 23 ms
[2022-06-13 01:15:46] [INFO ] [Real]Absence check using 31 positive place invariants in 57 ms returned sat
[2022-06-13 01:15:46] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-06-13 01:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-13 01:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-06-13 01:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-06-13 01:15:47] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 9 ms returned sat
[2022-06-13 01:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:48] [INFO ] [Real]Absence check using state equation in 115 ms returned unsat
[2022-06-13 01:15:48] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-06-13 01:15:48] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:48] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-06-13 01:15:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-06-13 01:15:48] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:48] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 4 ms to minimize.
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:15:48] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:49] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:15:50] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 2 ms to minimize.
[2022-06-13 01:15:51] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 3020 ms
[2022-06-13 01:15:51] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 15 ms.
[2022-06-13 01:15:52] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:15:52] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:52] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:15:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2022-06-13 01:15:52] [INFO ] Added : 162 causal constraints over 33 iterations in 1011 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-13 01:15:52] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-06-13 01:15:52] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:52] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-06-13 01:15:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:52] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-06-13 01:15:52] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:52] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-13 01:15:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-06-13 01:15:52] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:52] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-06-13 01:15:52] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 3 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:15:53] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2022-06-13 01:15:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2022-06-13 01:15:54] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2022-06-13 01:15:54] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1230 ms
[2022-06-13 01:15:54] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 14 ms.
[2022-06-13 01:15:54] [INFO ] Added : 86 causal constraints over 18 iterations in 330 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-13 01:15:54] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-06-13 01:15:54] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:54] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-06-13 01:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:54] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-06-13 01:15:54] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:54] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-13 01:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-06-13 01:15:54] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:55] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:15:55] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 965 ms
[2022-06-13 01:15:56] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 14 ms.
[2022-06-13 01:15:56] [INFO ] Added : 113 causal constraints over 23 iterations in 492 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:15:56] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-06-13 01:15:56] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:56] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2022-06-13 01:15:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-06-13 01:15:56] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2022-06-13 01:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:57] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2022-06-13 01:15:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 670 ms
[2022-06-13 01:15:57] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 14 ms.
[2022-06-13 01:15:58] [INFO ] Added : 112 causal constraints over 23 iterations in 457 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 11500 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=396 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8000 steps, including 99 resets, run finished after 19 ms. (steps per millisecond=421 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12200 steps, including 108 resets, run finished after 29 ms. (steps per millisecond=420 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=115 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655082959416

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BusinessProcesses-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936100128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;