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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 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.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 30 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 30 00:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 00:00 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 189K 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-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083438855

Running Version 0
[2022-06-13 01:24:00] [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:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:24:01] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-06-13 01:24:01] [INFO ] Transformed 772 places.
[2022-06-13 01:24:01] [INFO ] Transformed 685 transitions.
[2022-06-13 01:24:01] [INFO ] Found NUPN structural information;
[2022-06-13 01:24:01] [INFO ] Parsed PT model containing 772 places and 685 transitions in 135 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 15 places in 21 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 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 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 670 rows 757 cols
[2022-06-13 01:24:01] [INFO ] Computed 125 place invariants in 46 ms
[2022-06-13 01:24:01] [INFO ] [Real]Absence check using 78 positive place invariants in 38 ms returned sat
[2022-06-13 01:24:01] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2022-06-13 01:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:02] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-06-13 01:24:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:02] [INFO ] [Nat]Absence check using 78 positive place invariants in 33 ms returned sat
[2022-06-13 01:24:02] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:02] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 5 ms to minimize.
[2022-06-13 01:24:03] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 2 ms to minimize.
[2022-06-13 01:24:03] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 1 ms to minimize.
[2022-06-13 01:24:03] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:24:04] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2022-06-13 01:24:04] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2022-06-13 01:24:04] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:24:04] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:05] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:24:05] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2022-06-13 01:24:05] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:24:05] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:05] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2022-06-13 01:24:06] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:24:06] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2022-06-13 01:24:06] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:24:06] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:06] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:24:07] [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 0
[2022-06-13 01:24:07] [INFO ] [Real]Absence check using 78 positive place invariants in 37 ms returned sat
[2022-06-13 01:24:07] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2022-06-13 01:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:07] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2022-06-13 01:24:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:08] [INFO ] [Nat]Absence check using 78 positive place invariants in 38 ms returned sat
[2022-06-13 01:24:08] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2022-06-13 01:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:08] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 1 ms to minimize.
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 154 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 169 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:24:10] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:10] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:10] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:24:10] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:10] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:11] [INFO ] Deduced a trap composed of 170 places in 184 ms of which 0 ms to minimize.
[2022-06-13 01:24:11] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:24:11] [INFO ] Deduced a trap composed of 174 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:24:11] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:24:11] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 1 ms to minimize.
[2022-06-13 01:24:12] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:12] [INFO ] Deduced a trap composed of 175 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:24:12] [INFO ] Deduced a trap composed of 179 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:24:12] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:24:12] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:24:12] [INFO ] Deduced a trap composed of 197 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:24:12] [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 1
[2022-06-13 01:24:13] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:13] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2022-06-13 01:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:13] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-06-13 01:24:13] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2022-06-13 01:24:13] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2192 ms
[2022-06-13 01:24:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:15] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:15] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:16] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 5 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 0 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 0 ms to minimize.
[2022-06-13 01:24:18] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:18] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:24:18] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:18] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:18] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:19] [INFO ] Deduced a trap composed of 191 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:19] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2022-06-13 01:24:19] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 1 ms to minimize.
[2022-06-13 01:24:19] [INFO ] Deduced a trap composed of 172 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:24:19] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 0 ms to minimize.
[2022-06-13 01:24:19] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 2 ms to minimize.
[2022-06-13 01:24:20] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 0 ms to minimize.
[2022-06-13 01:24:20] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:20] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:24:20] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:24:20] [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:24:20] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned sat
[2022-06-13 01:24:20] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2022-06-13 01:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:21] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2022-06-13 01:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:21] [INFO ] [Nat]Absence check using 78 positive place invariants in 33 ms returned sat
[2022-06-13 01:24:21] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2022-06-13 01:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:21] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-06-13 01:24:21] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2657 ms
[2022-06-13 01:24:24] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 44 ms.
[2022-06-13 01:24:26] [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 3
[2022-06-13 01:24:26] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:26] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2022-06-13 01:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:26] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-06-13 01:24:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:27] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-06-13 01:24:27] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-06-13 01:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:27] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 152 places in 159 ms of which 1 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 0 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 0 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 0 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 142 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 148 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:24:32] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:24:32] [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:24:32] [INFO ] [Real]Absence check using 78 positive place invariants in 31 ms returned sat
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-06-13 01:24:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 23 ms returned sat
[2022-06-13 01:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 10 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:35] [INFO ] Deduced a trap composed of 195 places in 168 ms of which 0 ms to minimize.
[2022-06-13 01:24:35] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:35] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2022-06-13 01:24:35] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:35] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 198 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 175 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 186 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 204 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 169 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 163 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:37] [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 6
[2022-06-13 01:24:37] [INFO ] [Real]Absence check using 78 positive place invariants in 38 ms returned sat
[2022-06-13 01:24:37] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2022-06-13 01:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:38] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2022-06-13 01:24:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:39] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2022-06-13 01:24:39] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2022-06-13 01:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:39] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 3 ms to minimize.
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 0 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 0 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 911 ms
[2022-06-13 01:24:40] [INFO ] [Real]Absence check using 78 positive place invariants in 48 ms returned sat
[2022-06-13 01:24:40] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 40 ms returned sat
[2022-06-13 01:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:42] [INFO ] [Real]Absence check using state equation in 2287 ms returned sat
[2022-06-13 01:24:42] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Support contains 19 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 409 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 742 transition count 501
Reduce places removed 160 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 163 rules applied. Total rules applied 325 place count 582 transition count 498
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 328 place count 579 transition count 498
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 328 place count 579 transition count 391
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 563 place count 451 transition count 391
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 653 place count 361 transition count 301
Iterating global reduction 3 with 90 rules applied. Total rules applied 743 place count 361 transition count 301
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 743 place count 361 transition count 292
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 764 place count 349 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 765 place count 348 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 766 place count 348 transition count 291
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1006 place count 227 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1008 place count 226 transition count 175
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1010 place count 226 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1012 place count 224 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 224 transition count 173
Applied a total of 1013 rules in 192 ms. Remains 224 /757 variables (removed 533) and now considering 173/670 (removed 497) transitions.
Finished structural reductions, in 1 iterations. Remains : 224/757 places, 173/670 transitions.
[2022-06-13 01:24:43] [INFO ] Flatten gal took : 63 ms
[2022-06-13 01:24:43] [INFO ] Flatten gal took : 25 ms
[2022-06-13 01:24:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9994026393280664367.gal : 13 ms
[2022-06-13 01:24:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12227159625987467174.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/ReachabilityCardinality9994026393280664367.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12227159625987467174.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/ReachabilityCardinality9994026393280664367.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12227159625987467174.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12227159625987467174.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 48
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :48 after 69
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :69 after 229
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :229 after 1269
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1269 after 3560
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-11 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3560 after 6404
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :6404 after 9272
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :9272 after 31314
Detected timeout of ITS tools.
[2022-06-13 01:24:58] [INFO ] Flatten gal took : 29 ms
[2022-06-13 01:24:58] [INFO ] Applying decomposition
[2022-06-13 01:24:58] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15839279285315403940.txt, -o, /tmp/graph15839279285315403940.bin, -w, /tmp/graph15839279285315403940.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15839279285315403940.bin, -l, -1, -v, -w, /tmp/graph15839279285315403940.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:24:58] [INFO ] Decomposing Gal with order
[2022-06-13 01:24:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:24:58] [INFO ] Removed a total of 185 redundant transitions.
[2022-06-13 01:24:58] [INFO ] Flatten gal took : 57 ms
[2022-06-13 01:24:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 41 ms.
[2022-06-13 01:24:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8911077848086127566.gal : 11 ms
[2022-06-13 01:24:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality818630411907312388.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/ReachabilityCardinality8911077848086127566.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality818630411907312388.prop, --nowitness], 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/ReachabilityCardinality8911077848086127566.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality818630411907312388.prop --nowitness
Loading property file /tmp/ReachabilityCardinality818630411907312388.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 2377
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-08 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-06 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-05 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-04 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2377 after 1.85618e+07
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-03 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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\_mod\_flat,7.09824e+07,0.332512,15628,681,254,26130,1077,695,27562,187,1813,0
Total reachable state count : 70982401

Verifying 5 reachability properties.
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-03 does not hold.

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-19-ReachabilityCardinality-03,331776,0.333723,15892,97,54,26130,1077,699,27562,191,1813,0
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-04 does not hold.

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-19-ReachabilityCardinality-04,331776,0.334174,15892,99,64,26130,1077,717,27562,195,1813,0
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-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-19-ReachabilityCardinality-05,110592,0.334431,15892,98,64,26130,1077,727,27562,199,1813,0
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-06 does not hold.

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-19-ReachabilityCardinality-06,110592,0.336377,15892,102,64,26130,1077,753,27562,202,1813,0
Invariant property BusinessProcesses-PT-19-ReachabilityCardinality-08 does not hold.

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-19-ReachabilityCardinality-08,13824,0.337426,15892,103,56,26130,1077,784,27562,204,1813,0
All properties solved without resorting to model-checking.

BK_STOP 1655083500049

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

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