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-162038143900455.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-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620548343553

Running Version 0
[2021-05-09 08:19:05] [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:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:19:05] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 08:19:05] [INFO ] Transformed 650 places.
[2021-05-09 08:19:05] [INFO ] Transformed 580 transitions.
[2021-05-09 08:19:05] [INFO ] Found NUPN structural information;
[2021-05-09 08:19:05] [INFO ] Parsed PT model containing 650 places and 580 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 17 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 576 rows 646 cols
[2021-05-09 08:19:05] [INFO ] Computed 108 place invariants in 40 ms
[2021-05-09 08:19:05] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2021-05-09 08:19:05] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 17 ms returned sat
[2021-05-09 08:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:06] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-09 08:19:06] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 5 ms to minimize.
[2021-05-09 08:19:06] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 2 ms to minimize.
[2021-05-09 08:19:06] [INFO ] Deduced a trap composed of 154 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:19:06] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2021-05-09 08:19:07] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:19:07] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:19:07] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:19:07] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:19:07] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:19:07] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:19:08] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 0 ms to minimize.
[2021-05-09 08:19:08] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 1 ms to minimize.
[2021-05-09 08:19:08] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:19:08] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 0 ms to minimize.
[2021-05-09 08:19:09] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 1 ms to minimize.
[2021-05-09 08:19:09] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:19:09] [INFO ] Deduced a trap composed of 127 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:19:09] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 0 ms to minimize.
[2021-05-09 08:19:10] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 1 ms to minimize.
[2021-05-09 08:19:10] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:19:10] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 1 ms to minimize.
[2021-05-09 08:19:10] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:19:10] [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
[2021-05-09 08:19:10] [INFO ] [Real]Absence check using 62 positive place invariants in 33 ms returned sat
[2021-05-09 08:19:10] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2021-05-09 08:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:11] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-09 08:19:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2021-05-09 08:19:11] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 5 ms returned unsat
[2021-05-09 08:19:11] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:19:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:11] [INFO ] [Real]Absence check using state equation in 155 ms returned unsat
[2021-05-09 08:19:11] [INFO ] [Real]Absence check using 62 positive place invariants in 43 ms returned sat
[2021-05-09 08:19:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2021-05-09 08:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:12] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2021-05-09 08:19:12] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2021-05-09 08:19:12] [INFO ] Deduced a trap composed of 19 places in 454 ms of which 1 ms to minimize.
[2021-05-09 08:19:13] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:19:13] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:19:13] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 0 ms to minimize.
[2021-05-09 08:19:13] [INFO ] Deduced a trap composed of 126 places in 195 ms of which 1 ms to minimize.
[2021-05-09 08:19:14] [INFO ] Deduced a trap composed of 26 places in 976 ms of which 1 ms to minimize.
[2021-05-09 08:19:14] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:19:15] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:19:15] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:19:15] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:19:15] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2021-05-09 08:19:15] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:19:16] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:19:16] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:19:16] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:19:16] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 1 ms to minimize.
[2021-05-09 08:19:16] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:19: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 3
[2021-05-09 08:19:17] [INFO ] [Real]Absence check using 62 positive place invariants in 43 ms returned sat
[2021-05-09 08:19:17] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:17] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-09 08:19:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:17] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2021-05-09 08:19:17] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:17] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2021-05-09 08:19:17] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2021-05-09 08:19:18] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2021-05-09 08:19:18] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:19:18] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2021-05-09 08:19:19] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2021-05-09 08:19:19] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 0 ms to minimize.
[2021-05-09 08:19:19] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2021-05-09 08:19:19] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:19:19] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2021-05-09 08:19:20] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2021-05-09 08:19:20] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 2 ms to minimize.
[2021-05-09 08:19:20] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 2 ms to minimize.
[2021-05-09 08:19:20] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:19:20] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:19:21] [INFO ] Deduced a trap composed of 124 places in 225 ms of which 1 ms to minimize.
[2021-05-09 08:19:21] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 1 ms to minimize.
[2021-05-09 08:19:21] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 14 ms to minimize.
[2021-05-09 08:19:21] [INFO ] Deduced a trap composed of 124 places in 206 ms of which 1 ms to minimize.
[2021-05-09 08:19:22] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:19:22] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:19:22] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:19:22] [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:19:22] [INFO ] [Real]Absence check using 62 positive place invariants in 47 ms returned sat
[2021-05-09 08:19:22] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:22] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2021-05-09 08:19:23] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:19:23] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:19:23] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 14 ms to minimize.
[2021-05-09 08:19:23] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:19:23] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:19:23] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 14 ms to minimize.
[2021-05-09 08:19:24] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 13 ms to minimize.
[2021-05-09 08:19:24] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:19:24] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:19:24] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:19:24] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:19:24] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2021-05-09 08:19:25] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:19:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:19:27] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:19:27] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:19:27] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:19:27] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:19:27] [INFO ] Deduced a trap composed of 15 places in 337 ms of which 1 ms to minimize.
[2021-05-09 08:19:27] [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:19:27] [INFO ] [Real]Absence check using 62 positive place invariants in 30 ms returned sat
[2021-05-09 08:19:28] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 16 ms returned sat
[2021-05-09 08:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:28] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-09 08:19:28] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:19:28] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:19:28] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:19:29] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:19:29] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:19:29] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:19:29] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:19:29] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:19:29] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:19:30] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 1 ms to minimize.
[2021-05-09 08:19:30] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:19:30] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:19:30] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:19:30] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:19:31] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3374 ms
[2021-05-09 08:19:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:31] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2021-05-09 08:19:31] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2021-05-09 08:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:32] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2021-05-09 08:19:32] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:19:32] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:19:32] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:19:33] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:19:33] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:19:33] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:19:33] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:19:33] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:19:33] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 0 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:19:34] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:19:35] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3077 ms
[2021-05-09 08:19:35] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 37 ms.
00)
^^
(error "Incorrect format for a number - no leading zeros allowed: 00")
[2021-05-09 08:19:37] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 0 ms to minimize.
[2021-05-09 08:19:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-09 08:19:37] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2021-05-09 08:19:37] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:37] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-09 08:19:37] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2021-05-09 08:19:37] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 1 ms to minimize.
[2021-05-09 08:19:38] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 2 ms to minimize.
[2021-05-09 08:19:38] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 0 ms to minimize.
[2021-05-09 08:19:38] [INFO ] Deduced a trap composed of 123 places in 298 ms of which 1 ms to minimize.
[2021-05-09 08:19:38] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:19:39] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 1 ms to minimize.
[2021-05-09 08:19:39] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:19:39] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 0 ms to minimize.
[2021-05-09 08:19:39] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:19:40] [INFO ] Deduced a trap composed of 145 places in 246 ms of which 1 ms to minimize.
[2021-05-09 08:19:40] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 1 ms to minimize.
[2021-05-09 08:19:40] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:19:40] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:19:41] [INFO ] Deduced a trap composed of 160 places in 251 ms of which 1 ms to minimize.
[2021-05-09 08:19:41] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:19:41] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2021-05-09 08:19:41] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 0 ms to minimize.
[2021-05-09 08:19:41] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2021-05-09 08:19:42] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 0 ms to minimize.
[2021-05-09 08:19:42] [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:19:42] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2021-05-09 08:19:42] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:42] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2021-05-09 08:19:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:43] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:19:43] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:43] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2021-05-09 08:19:43] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2021-05-09 08:19:44] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2021-05-09 08:19:44] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 3 ms to minimize.
[2021-05-09 08:19:44] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 1 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 1 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:19:45] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:19:46] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:19:48] [INFO ] Deduced a trap composed of 47 places in 1169 ms of which 1 ms to minimize.
[2021-05-09 08:19:48] [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 8
[2021-05-09 08:19:48] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2021-05-09 08:19:48] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2021-05-09 08:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:48] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2021-05-09 08:19:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:19:49] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2021-05-09 08:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:49] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2021-05-09 08:19:54] [INFO ] Deduced a trap composed of 22 places in 5259 ms of which 1 ms to minimize.
[2021-05-09 08:19: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 9
[2021-05-09 08:19:54] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:19:54] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 15 ms returned sat
[2021-05-09 08:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:55] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2021-05-09 08:19:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:55] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:19:55] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:55] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2021-05-09 08:19:56] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 1 ms to minimize.
[2021-05-09 08:19:56] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:19:56] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:19:56] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2021-05-09 08:19:56] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:19:57] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:19:57] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 1 ms to minimize.
[2021-05-09 08:19:57] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 1 ms to minimize.
[2021-05-09 08:19:57] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2021-05-09 08:19:57] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:19:58] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:19:58] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 1 ms to minimize.
[2021-05-09 08:19:58] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:19:58] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:19:59] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:19:59] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:19:59] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:19:59] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:19:59] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:20:00] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 1 ms to minimize.
[2021-05-09 08:20:00] [INFO ] Deduced a trap composed of 140 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:20:00] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 0 ms to minimize.
[2021-05-09 08:20: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 10
[2021-05-09 08:20:00] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:20:00] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:00] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 08:20:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:01] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:20:01] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2021-05-09 08:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:01] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:20:01] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:20:02] [INFO ] Deduced a trap composed of 148 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 158 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:20:03] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 149 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:20:04] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 145 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 150 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:20:05] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:20:05] [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 11
[2021-05-09 08:20:06] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:20:06] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:06] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-09 08:20:06] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:20:06] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:20:06] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:20:07] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:20:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2150 ms
[2021-05-09 08:20:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:20:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:20:08] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:20:08] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:20:09] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:20:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1830 ms
[2021-05-09 08:20:10] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 31 ms.
[2021-05-09 08:20:12] [INFO ] Added : 340 causal constraints over 68 iterations in 1985 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 31800 steps, including 182 resets, run finished after 91 ms. (steps per millisecond=349 ) properties (out of 11) seen :4 could not realise parikh vector
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 38 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 642 transition count 488
Reduce places removed 87 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 92 rules applied. Total rules applied 180 place count 555 transition count 483
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 185 place count 550 transition count 483
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 185 place count 550 transition count 355
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 457 place count 406 transition count 355
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 533 place count 330 transition count 279
Iterating global reduction 3 with 76 rules applied. Total rules applied 609 place count 330 transition count 279
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 609 place count 330 transition count 273
Deduced a syphon composed of 6 places in 1 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 623 place count 322 transition count 273
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 811 place count 228 transition count 179
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 812 place count 228 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 813 place count 227 transition count 178
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 816 place count 227 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 817 place count 226 transition count 177
Applied a total of 817 rules in 128 ms. Remains 226 /646 variables (removed 420) and now considering 177/576 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 226/646 places, 177/576 transitions.
[2021-05-09 08:20:13] [INFO ] Flatten gal took : 48 ms
[2021-05-09 08:20:13] [INFO ] Flatten gal took : 19 ms
[2021-05-09 08:20:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8052866738506702883.gal : 10 ms
[2021-05-09 08:20:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14142230378949559935.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/ReachabilityCardinality8052866738506702883.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14142230378949559935.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/ReachabilityCardinality8052866738506702883.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14142230378949559935.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14142230378949559935.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 23
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :23 after 32
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :32 after 192
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :192 after 320
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :320 after 572
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :572 after 988
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :988 after 10456
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-13 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-12 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-11 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :87760 after 316168
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-08 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-07 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,499792,0.813429,23880,2,13034,23,61411,6,0,1078,39305,0
Total reachable state count : 499792

Verifying 7 reachability properties.
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-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-ReachabilityFireability-00,2,0.817192,23880,2,231,23,61411,7,0,1081,39305,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-06 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-ReachabilityFireability-06,6,0.819389,23880,2,252,23,61411,8,0,1093,39305,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-17-ReachabilityFireability-07,1,0.821413,23880,2,227,23,61411,9,0,1102,39305,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-08 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-ReachabilityFireability-08,216,0.847226,23880,2,415,23,61411,10,0,1119,39305,0
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-11 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-ReachabilityFireability-11,25920,1.21029,23880,2,1311,23,61411,11,0,1138,39305,0
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-12 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-ReachabilityFireability-12,1584,2.10435,23880,2,674,23,61411,12,0,1168,39305,0
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-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-ReachabilityFireability-13,2484,2.13885,23880,2,1149,23,61411,13,0,1182,39305,0
All properties solved without resorting to model-checking.

BK_STOP 1620548416131

--------------------
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-17"
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-17, 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-162038143900455"
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 [ "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 ;