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-165251936100134.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-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:56 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 22K 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 11K Apr 29 23:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 29 23:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 29 23:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 29 23:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 85K 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655082988160

Running Version 0
[2022-06-13 01:16:30] [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:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:16:30] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2022-06-13 01:16:30] [INFO ] Transformed 368 places.
[2022-06-13 01:16:30] [INFO ] Transformed 319 transitions.
[2022-06-13 01:16:30] [INFO ] Found NUPN structural information;
[2022-06-13 01:16:30] [INFO ] Parsed PT model containing 368 places and 319 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 93 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 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 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 318 rows 367 cols
[2022-06-13 01:16:30] [INFO ] Computed 57 place invariants in 30 ms
[2022-06-13 01:16:30] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned sat
[2022-06-13 01:16:30] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 16 ms returned sat
[2022-06-13 01:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:30] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-06-13 01:16:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:31] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2022-06-13 01:16:31] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 11 ms returned sat
[2022-06-13 01:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:31] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2022-06-13 01:16:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:31] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2022-06-13 01:16:31] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2022-06-13 01:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:31] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-06-13 01:16:32] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 4 ms to minimize.
[2022-06-13 01:16:32] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2022-06-13 01:16:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 265 ms
[2022-06-13 01:16:32] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2022-06-13 01:16:32] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2022-06-13 01:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:32] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-13 01:16:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-06-13 01:16:32] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2022-06-13 01:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:32] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-06-13 01:16:32] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2022-06-13 01:16:32] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:16:33] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 2 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 0 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:16:34] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:16:35] [INFO ] Deduced a trap composed of 103 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:16:35] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:16:35] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:16:35] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2440 ms
[2022-06-13 01:16:35] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 75 ms.
[2022-06-13 01:16:36] [INFO ] Added : 148 causal constraints over 30 iterations in 879 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-13 01:16:36] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2022-06-13 01:16:36] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2022-06-13 01:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:36] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-06-13 01:16:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:36] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2022-06-13 01:16:36] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2022-06-13 01:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:36] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-13 01:16:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-06-13 01:16:37] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2022-06-13 01:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:37] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:16:37] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2022-06-13 01:16:38] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1401 ms
[2022-06-13 01:16:38] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 20 ms.
[2022-06-13 01:16:39] [INFO ] Added : 206 causal constraints over 42 iterations in 1148 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:16:39] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2022-06-13 01:16:39] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2022-06-13 01:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:40] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-06-13 01:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:16:40] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2022-06-13 01:16:40] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2022-06-13 01:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:16:40] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-06-13 01:16:40] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 15900 steps, including 155 resets, run finished after 39 ms. (steps per millisecond=407 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16200 steps, including 105 resets, run finished after 50 ms. (steps per millisecond=324 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 21 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 209 edges and 367 vertex of which 5 / 367 are part of one of the 1 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 704 edges and 363 vertex of which 362 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 362 transition count 234
Reduce places removed 77 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 81 rules applied. Total rules applied 161 place count 285 transition count 230
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 165 place count 281 transition count 230
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 165 place count 281 transition count 182
Deduced a syphon composed of 48 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 273 place count 221 transition count 182
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 328 place count 166 transition count 127
Iterating global reduction 3 with 55 rules applied. Total rules applied 383 place count 166 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 383 place count 166 transition count 121
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 398 place count 157 transition count 121
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 492 place count 110 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 109 transition count 73
Applied a total of 493 rules in 94 ms. Remains 109 /367 variables (removed 258) and now considering 73/318 (removed 245) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/367 places, 73/318 transitions.
[2022-06-13 01:16:41] [INFO ] Flatten gal took : 60 ms
[2022-06-13 01:16:41] [INFO ] Flatten gal took : 12 ms
[2022-06-13 01:16:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2510729806020388255.gal : 9 ms
[2022-06-13 01:16:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6035768826086828066.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2510729806020388255.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6035768826086828066.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2510729806020388255.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6035768826086828066.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6035768826086828066.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 45
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :45 after 130
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :130 after 736
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :736 after 2204
Reachability property BusinessProcesses-PT-05-ReachabilityCardinality-07 is true.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,61696,0.106684,5768,2,1513,14,8544,6,0,505,5048,0
Total reachable state count : 61696

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-05-ReachabilityCardinality-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-05-ReachabilityCardinality-07,12,0.138427,5768,2,149,14,8544,7,0,564,5048,0
All properties solved without resorting to model-checking.

BK_STOP 1655083002396

--------------------
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-05"
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-05, 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-165251936100134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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