Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900471.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 189K May 5 16:51 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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620548604823

Running Version 0
[2021-05-09 08:23:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:23:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:23:26] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-09 08:23:26] [INFO ] Transformed 772 places.
[2021-05-09 08:23:26] [INFO ] Transformed 685 transitions.
[2021-05-09 08:23:26] [INFO ] Found NUPN structural information;
[2021-05-09 08:23:26] [INFO ] Parsed PT model containing 772 places and 685 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 670 rows 757 cols
[2021-05-09 08:23:26] [INFO ] Computed 125 place invariants in 44 ms
[2021-05-09 08:23:27] [INFO ] [Real]Absence check using 78 positive place invariants in 30 ms returned sat
[2021-05-09 08:23:27] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 5 ms returned unsat
[2021-05-09 08:23:27] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2021-05-09 08:23:27] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2021-05-09 08:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:27] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 11 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 1 ms to minimize.
[2021-05-09 08:23:29] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 153 places in 211 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 1 ms to minimize.
[2021-05-09 08:23:30] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 0 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2021-05-09 08:23: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 1
[2021-05-09 08:23:32] [INFO ] [Real]Absence check using 78 positive place invariants in 35 ms returned sat
[2021-05-09 08:23:32] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2021-05-09 08:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:32] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-09 08:23:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:33] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2021-05-09 08:23:33] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2021-05-09 08:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:33] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 13 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 172 places in 118 ms of which 3 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 184 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 186 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 178 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 167 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 171 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 182 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:23: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 2
[2021-05-09 08:23:38] [INFO ] [Real]Absence check using 78 positive place invariants in 27 ms returned sat
[2021-05-09 08:23:38] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:38] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2021-05-09 08:23:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:38] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2021-05-09 08:23:38] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:38] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 13 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 0 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 2 ms to minimize.
[2021-05-09 08:23:41] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 13 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 1 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:23:42] [INFO ] Deduced a trap composed of 182 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 189 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 184 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 188 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:23:43] [INFO ] Deduced a trap composed of 172 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:23:43] [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
[2021-05-09 08:23:43] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:43] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:44] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-09 08:23:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:44] [INFO ] [Nat]Absence check using 78 positive place invariants in 48 ms returned sat
[2021-05-09 08:23:44] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 19 ms returned sat
[2021-05-09 08:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:44] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:23:44] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 0 ms to minimize.
[2021-05-09 08:23:45] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:23:46] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:23:47] [INFO ] Deduced a trap composed of 170 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:23:48] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4048 ms
[2021-05-09 08:23:48] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 35 ms.
[2021-05-09 08:23:49] [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
[2021-05-09 08:23:49] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2021-05-09 08:23:49] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 08:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:49] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:23:49] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:23:50] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:23:51] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 186 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 176 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:23:52] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:23:53] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:53] [INFO ] Deduced a trap composed of 177 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:23:53] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:23:53] [INFO ] Deduced a trap composed of 173 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:23:53] [INFO ] Deduced a trap composed of 172 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:23:53] [INFO ] Deduced a trap composed of 183 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:23:54] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:23:54] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:23:54] [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 5
[2021-05-09 08:23:54] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:54] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-09 08:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:54] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-09 08:23:54] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:23:54] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:23:54] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 562 ms
[2021-05-09 08:23:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:55] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2021-05-09 08:23:55] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:55] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 11 ms to minimize.
[2021-05-09 08:23:55] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:23:56] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:23:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2021-05-09 08:23:56] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 45 ms.
[2021-05-09 08:24:00] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 1 ms to minimize.
[2021-05-09 08:24:00] [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
[2021-05-09 08:24:00] [INFO ] [Real]Absence check using 78 positive place invariants in 39 ms returned sat
[2021-05-09 08:24:00] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 23 ms returned sat
[2021-05-09 08:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:01] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2021-05-09 08:24:01] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2021-05-09 08:24:01] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:24:01] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:24:02] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:24:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1837 ms
[2021-05-09 08:24:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:03] [INFO ] [Nat]Absence check using 78 positive place invariants in 39 ms returned sat
[2021-05-09 08:24:03] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2021-05-09 08:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:03] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2021-05-09 08:24:03] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:24:04] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:24:05] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:24:06] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:24:07] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3629 ms
[2021-05-09 08:24:07] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 49 ms.
[2021-05-09 08:24:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-09 08:24:08] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2021-05-09 08:24:08] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:08] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2021-05-09 08:24:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:08] [INFO ] [Nat]Absence check using 78 positive place invariants in 25 ms returned unsat
[2021-05-09 08:24:08] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2021-05-09 08:24:08] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2021-05-09 08:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:24:09] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-09 08:24:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:24:09] [INFO ] [Nat]Absence check using 78 positive place invariants in 22 ms returned unsat
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 53 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 748 transition count 560
Reduce places removed 109 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 115 rules applied. Total rules applied 225 place count 639 transition count 554
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 231 place count 633 transition count 554
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 231 place count 633 transition count 411
Deduced a syphon composed of 143 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 537 place count 470 transition count 411
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 623 place count 384 transition count 325
Iterating global reduction 3 with 86 rules applied. Total rules applied 709 place count 384 transition count 325
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 709 place count 384 transition count 319
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 723 place count 376 transition count 319
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 933 place count 270 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 934 place count 270 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 936 place count 269 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 941 place count 269 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 942 place count 268 transition count 216
Applied a total of 942 rules in 204 ms. Remains 268 /757 variables (removed 489) and now considering 216/670 (removed 454) transitions.
Finished structural reductions, in 1 iterations. Remains : 268/757 places, 216/670 transitions.
[2021-05-09 08:24:10] [INFO ] Flatten gal took : 115 ms
[2021-05-09 08:24:10] [INFO ] Flatten gal took : 22 ms
[2021-05-09 08:24:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4078978061514068958.gal : 30 ms
[2021-05-09 08:24:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18007181896098733497.prop : 0 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/ReachabilityCardinality4078978061514068958.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18007181896098733497.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/ReachabilityCardinality4078978061514068958.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18007181896098733497.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18007181896098733497.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 44
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :44 after 69
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :69 after 147
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :147 after 1202
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1202 after 34660
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-04 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :34660 after 93073
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-10 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :93073 after 140990
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :140990 after 279890
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :279890 after 393026
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :393026 after 649434
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :649434 after 2.50563e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.50563e+06 after 1.04698e+07
Detected timeout of ITS tools.
[2021-05-09 08:24:25] [INFO ] Flatten gal took : 21 ms
[2021-05-09 08:24:25] [INFO ] Applying decomposition
[2021-05-09 08:24:25] [INFO ] Flatten gal took : 17 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/graph9543414293697767694.txt, -o, /tmp/graph9543414293697767694.bin, -w, /tmp/graph9543414293697767694.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/graph9543414293697767694.bin, -l, -1, -v, -w, /tmp/graph9543414293697767694.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:24:25] [INFO ] Decomposing Gal with order
[2021-05-09 08:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:24:25] [INFO ] Removed a total of 139 redundant transitions.
[2021-05-09 08:24:25] [INFO ] Flatten gal took : 65 ms
[2021-05-09 08:24:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 19 ms.
[2021-05-09 08:24:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9055522600326235108.gal : 17 ms
[2021-05-09 08:24:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5970841867205949353.prop : 5 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/ReachabilityCardinality9055522600326235108.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5970841867205949353.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/ReachabilityCardinality9055522600326235108.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5970841867205949353.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5970841867205949353.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 16
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :16 after 16
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :448 after 619324
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :619324 after 1.52264e+06
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-13 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-09 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-07 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-05 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 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 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.64755e+10,0.573254,24248,1060,473,39259,4243,863,73842,207,10856,0
Total reachable state count : 16475471008

Verifying 4 reachability properties.
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-05 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-ReachabilityFireability-05,1.88006e+07,0.578942,24512,159,109,39259,4243,923,73842,225,10856,0
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-07 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-ReachabilityFireability-07,554880,0.583652,24512,138,88,39259,4243,954,73842,228,10856,0
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-09 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-ReachabilityFireability-09,8.84736e+06,0.585734,24512,134,89,39259,4243,977,73842,234,10856,0
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-13 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-ReachabilityFireability-13,62208,0.592952,24512,122,84,39259,4243,1053,73842,246,10856,0
All properties solved without resorting to model-checking.

BK_STOP 1620548666258

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-19, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900471"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;