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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 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.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083247993

Running Version 0
[2022-06-13 01:20:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:20:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:20:50] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2022-06-13 01:20:50] [INFO ] Transformed 593 places.
[2022-06-13 01:20:50] [INFO ] Transformed 536 transitions.
[2022-06-13 01:20:50] [INFO ] Found NUPN structural information;
[2022-06-13 01:20:50] [INFO ] Parsed PT model containing 593 places and 536 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :2
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 528 rows 585 cols
[2022-06-13 01:20:50] [INFO ] Computed 95 place invariants in 32 ms
[2022-06-13 01:20:50] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned unsat
[2022-06-13 01:20:51] [INFO ] [Real]Absence check using 57 positive place invariants in 38 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:51] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2022-06-13 01:20:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:52] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 4 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:20:54] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:20:54] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:20:54] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:20:54] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:20:54] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2352 ms
[2022-06-13 01:20:54] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 41 ms.
[2022-06-13 01:20:56] [INFO ] Added : 215 causal constraints over 44 iterations in 1754 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-06-13 01:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 124 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-13 01:21:01] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:01] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:01] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 709 ms
[2022-06-13 01:21:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:02] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:02] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:02] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 670 ms
[2022-06-13 01:21:03] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 30 ms.
[2022-06-13 01:21:04] [INFO ] Added : 222 causal constraints over 46 iterations in 1680 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:21:05] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-06-13 01:21:05] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-06-13 01:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:05] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2022-06-13 01:21:05] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:21:05] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:21:05] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2022-06-13 01:21:05] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:21:06] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:21:07] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:21:08] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3496 ms
[2022-06-13 01:21:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:08] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-06-13 01:21:08] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:09] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2022-06-13 01:21:09] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:21:09] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:21:09] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:21:09] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:21:09] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:21:10] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:21:11] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:21:11] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:21:11] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:21:11] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:21:11] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:21:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2641 ms
[2022-06-13 01:21:11] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 31 ms.
[2022-06-13 01:21:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-13 01:21:13] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-06-13 01:21:13] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2022-06-13 01:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:14] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-06-13 01:21:14] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:21:14] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:14] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:21:14] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:21:14] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:21:14] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2022-06-13 01:21:15] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1715 ms
[2022-06-13 01:21:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-06-13 01:21:16] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:16] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2022-06-13 01:21:16] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:21:16] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:21:16] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2022-06-13 01:21:16] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:21:16] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 127 places in 97 ms of which 0 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 138 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2522 ms
[2022-06-13 01:21:18] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 32 ms.
[2022-06-13 01:21:20] [INFO ] Added : 211 causal constraints over 43 iterations in 1595 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-13 01:21:20] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-06-13 01:21:20] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-06-13 01:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:20] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-06-13 01:21:20] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:21:20] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 720 ms
[2022-06-13 01:21:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:21] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:21] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:21] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:21:21] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:21:22] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:21:22] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2022-06-13 01:21:22] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-06-13 01:21:22] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:21:22] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:21:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 742 ms
[2022-06-13 01:21:22] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 37 ms.
[2022-06-13 01:21:24] [INFO ] Added : 219 causal constraints over 44 iterations in 1587 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2022-06-13 01:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-06-13 01:21:24] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:21:24] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:21:24] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 13 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:21:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-13 01:21:29] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned unsat
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 23600 steps, including 129 resets, run finished after 74 ms. (steps per millisecond=318 ) properties (out of 7) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 23400 steps, including 114 resets, run finished after 69 ms. (steps per millisecond=339 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 20000 steps, including 128 resets, run finished after 55 ms. (steps per millisecond=363 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 20000 steps, including 108 resets, run finished after 55 ms. (steps per millisecond=363 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 335 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 573 transition count 387
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 266 place count 441 transition count 387
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 266 place count 441 transition count 301
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 454 place count 339 transition count 301
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 531 place count 262 transition count 224
Iterating global reduction 2 with 77 rules applied. Total rules applied 608 place count 262 transition count 224
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 608 place count 262 transition count 216
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 626 place count 252 transition count 216
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 806 place count 161 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 808 place count 160 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 810 place count 160 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 812 place count 158 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 813 place count 158 transition count 129
Applied a total of 813 rules in 153 ms. Remains 158 /585 variables (removed 427) and now considering 129/528 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/585 places, 129/528 transitions.
[2022-06-13 01:21:30] [INFO ] Flatten gal took : 90 ms
[2022-06-13 01:21:30] [INFO ] Flatten gal took : 24 ms
[2022-06-13 01:21:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3020708198948333192.gal : 39 ms
[2022-06-13 01:21:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12352160033888016189.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/ReachabilityCardinality3020708198948333192.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12352160033888016189.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/ReachabilityCardinality3020708198948333192.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12352160033888016189.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12352160033888016189.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :33 after 145
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :145 after 197
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :197 after 273
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-05 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :273 after 845
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :845 after 1029
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1029 after 2905
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2905 after 4469
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,5085,0.306684,14488,2,5447,16,34498,7,0,762,24443,0
Total reachable state count : 5085

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-02 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-13-ReachabilityFireability-02,12,0.307496,14488,2,228,16,34498,7,0,764,24443,0
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-05 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-13-ReachabilityFireability-05,48,0.308,14488,2,334,16,34498,8,0,766,24443,0
All properties solved without resorting to model-checking.

BK_STOP 1655083291396

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-13"
export BK_EXAMINATION="ReachabilityFireability"
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-13, examination is ReachabilityFireability"
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-165251936100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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