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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.2K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:58 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.3K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 161K 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-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083374750

Running Version 0
[2022-06-13 01:22:56] [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:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:22:56] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-06-13 01:22:56] [INFO ] Transformed 650 places.
[2022-06-13 01:22:56] [INFO ] Transformed 580 transitions.
[2022-06-13 01:22:56] [INFO ] Found NUPN structural information;
[2022-06-13 01:22:56] [INFO ] Parsed PT model containing 650 places and 580 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 576 rows 646 cols
[2022-06-13 01:22:57] [INFO ] Computed 108 place invariants in 49 ms
[2022-06-13 01:22:57] [INFO ] [Real]Absence check using 62 positive place invariants in 32 ms returned sat
[2022-06-13 01:22:57] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2022-06-13 01:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:57] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 5 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 1 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:02] [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:23:02] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2022-06-13 01:23:02] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:02] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 145 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 5 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 151 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 2 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 151 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 160 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 139 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 147 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:23: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 1
[2022-06-13 01:23:07] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2022-06-13 01:23:07] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:07] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 9 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:23:08] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3939 ms
[2022-06-13 01:23:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2022-06-13 01:23:12] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:12] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [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:23:16] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2022-06-13 01:23:16] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 16 ms returned sat
[2022-06-13 01:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:16] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 147 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [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:23:21] [INFO ] [Real]Absence check using 62 positive place invariants in 30 ms returned sat
[2022-06-13 01:23:21] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:21] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-06-13 01:23:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 15 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-06-13 01:23:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 7 ms returned unsat
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-06-13 01:23:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2022-06-13 01:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-13 01:23:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2022-06-13 01:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:24] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2022-06-13 01:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 34 ms returned sat
[2022-06-13 01:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:25] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 4 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 0 ms to minimize.
[2022-06-13 01:23:27] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:23:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:23:27] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:23:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1738 ms
[2022-06-13 01:23:27] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 39 ms.
[2022-06-13 01:23:29] [INFO ] Added : 245 causal constraints over 49 iterations in 2256 ms. Result :unknown
[2022-06-13 01:23:29] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-06-13 01:23:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:29] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 149 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:23:31] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:23:31] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:23:31] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:23:31] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:23:31] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:23:31] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:23:32] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:23:32] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:23:32] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:32] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:23:32] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:23:32] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [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 10
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 44600 steps, including 321 resets, run finished after 146 ms. (steps per millisecond=305 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 52 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 304 edges and 646 vertex of which 4 / 646 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1308 edges and 643 vertex of which 640 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 640 transition count 460
Reduce places removed 111 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 120 rules applied. Total rules applied 233 place count 529 transition count 451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 242 place count 520 transition count 451
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 242 place count 520 transition count 367
Deduced a syphon composed of 84 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 420 place count 426 transition count 367
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 488 place count 358 transition count 299
Iterating global reduction 3 with 68 rules applied. Total rules applied 556 place count 358 transition count 299
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 556 place count 358 transition count 295
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 565 place count 353 transition count 295
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 754 place count 258 transition count 201
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 757 place count 258 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 760 place count 255 transition count 198
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 764 place count 255 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 254 transition count 197
Applied a total of 765 rules in 163 ms. Remains 254 /646 variables (removed 392) and now considering 197/576 (removed 379) transitions.
Finished structural reductions, in 1 iterations. Remains : 254/646 places, 197/576 transitions.
[2022-06-13 01:23:35] [INFO ] Flatten gal took : 57 ms
[2022-06-13 01:23:35] [INFO ] Flatten gal took : 23 ms
[2022-06-13 01:23:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4079879930168134512.gal : 12 ms
[2022-06-13 01:23:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3166938852079770617.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/ReachabilityCardinality4079879930168134512.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3166938852079770617.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/ReachabilityCardinality4079879930168134512.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3166938852079770617.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3166938852079770617.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 12
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :12 after 47
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :47 after 614
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :614 after 1238
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1238 after 9356
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :851136 after 1.06818e+06
Detected timeout of ITS tools.
[2022-06-13 01:23:50] [INFO ] Flatten gal took : 18 ms
[2022-06-13 01:23:50] [INFO ] Applying decomposition
[2022-06-13 01:23:50] [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/graph3511704910935972512.txt, -o, /tmp/graph3511704910935972512.bin, -w, /tmp/graph3511704910935972512.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/graph3511704910935972512.bin, -l, -1, -v, -w, /tmp/graph3511704910935972512.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:23:50] [INFO ] Decomposing Gal with order
[2022-06-13 01:23:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:23:50] [INFO ] Removed a total of 103 redundant transitions.
[2022-06-13 01:23:50] [INFO ] Flatten gal took : 52 ms
[2022-06-13 01:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 14 ms.
[2022-06-13 01:23:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8846180335796715165.gal : 10 ms
[2022-06-13 01:23:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7766997861532184869.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/ReachabilityCardinality8846180335796715165.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7766997861532184869.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/ReachabilityCardinality8846180335796715165.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7766997861532184869.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7766997861532184869.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 48
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :48 after 182898
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-13 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-01 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :182898 after 1.10075e+08
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-04 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-02 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.10075e+08 after 1.25305e+08
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-14 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.25305e+08 after 1.28346e+08
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-00 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 TRUE 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 33 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,1.3165e+08,0.203559,10100,1007,584,10864,3103,789,15959,201,7035,0
Total reachable state count : 131649930

Verifying 6 reachability properties.
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-00 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-17-ReachabilityCardinality-00,207360,0.204484,10364,132,86,10864,3103,791,15959,204,7035,0
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-01 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-17-ReachabilityCardinality-01,17280,0.205204,10364,119,75,10864,3103,800,15959,206,7035,0
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-02 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-17-ReachabilityCardinality-02,51840,0.205752,10364,119,84,10864,3103,825,15959,212,7035,0
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-04 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-17-ReachabilityCardinality-04,11520,0.206891,10364,119,69,10864,3103,910,15959,219,7035,0
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-13 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-17-ReachabilityCardinality-13,1.96469e+06,0.2506,10364,469,221,10864,3103,1038,15959,228,7035,0
Reachability property BusinessProcesses-PT-17-ReachabilityCardinality-14 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-17-ReachabilityCardinality-14,138240,0.251017,10364,132,71,10864,3103,1041,15959,230,7035,0
All properties solved without resorting to model-checking.

BK_STOP 1655083433201

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

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