Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 23:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 30 00:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083161962

Running Version 0
[2022-06-13 01:19:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:19:24] [INFO ] Load time of PNML (sax parser for PT used): 370 ms
[2022-06-13 01:19:24] [INFO ] Transformed 567 places.
[2022-06-13 01:19:24] [INFO ] Transformed 508 transitions.
[2022-06-13 01:19:24] [INFO ] Found NUPN structural information;
[2022-06-13 01:19:24] [INFO ] Parsed PT model containing 567 places and 508 transitions in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 501 rows 560 cols
[2022-06-13 01:19:24] [INFO ] Computed 95 place invariants in 37 ms
[2022-06-13 01:19:24] [INFO ] [Real]Absence check using 53 positive place invariants in 31 ms returned sat
[2022-06-13 01:19:24] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2022-06-13 01:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:25] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-06-13 01:19:25] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 4 ms to minimize.
[2022-06-13 01:19:25] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2022-06-13 01:19:25] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2022-06-13 01:19:25] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:19:26] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2022-06-13 01:19:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2711 ms
[2022-06-13 01:19:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 27 ms returned sat
[2022-06-13 01:19:28] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-06-13 01:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:28] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-06-13 01:19:28] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:28] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:28] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:28] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:28] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:19:29] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 4 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 135 places in 87 ms of which 1 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:19:30] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 2 ms to minimize.
[2022-06-13 01:19:31] [INFO ] Deduced a trap composed of 117 places in 95 ms of which 1 ms to minimize.
[2022-06-13 01:19:31] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2022-06-13 01:19:31] [INFO ] Deduced a trap composed of 119 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:19:31] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 1 ms to minimize.
[2022-06-13 01:19:31] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3170 ms
[2022-06-13 01:19:31] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 40 ms.
[2022-06-13 01:19:33] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-06-13 01:19:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 01:19:33] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned sat
[2022-06-13 01:19:33] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2022-06-13 01:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:33] [INFO ] [Real]Absence check using state equation in 142 ms returned unsat
[2022-06-13 01:19:33] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2022-06-13 01:19:33] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2022-06-13 01:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:33] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2022-06-13 01:19:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:33] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned unsat
[2022-06-13 01:19:34] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2022-06-13 01:19:34] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-06-13 01:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:34] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-06-13 01:19:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:34] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-06-13 01:19:34] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2022-06-13 01:19:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:34] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2022-06-13 01:19:34] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:19:34] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:19:34] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:19:35] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 18 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:36] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 2 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:19:37] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 0 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 1 ms to minimize.
[2022-06-13 01:19:38] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 1 ms to minimize.
[2022-06-13 01:19:39] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:19:39] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:19:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-13 01:19:39] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned unsat
[2022-06-13 01:19:39] [INFO ] [Real]Absence check using 53 positive place invariants in 11 ms returned unsat
[2022-06-13 01:19:39] [INFO ] [Real]Absence check using 53 positive place invariants in 27 ms returned sat
[2022-06-13 01:19:39] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2022-06-13 01:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:39] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-13 01:19:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:39] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2022-06-13 01:19:39] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2022-06-13 01:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:40] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:19:40] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 131 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2022-06-13 01:19:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1965 ms
[2022-06-13 01:19:42] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 25 ms.
[2022-06-13 01:19:44] [INFO ] Added : 290 causal constraints over 58 iterations in 2146 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-06-13 01:19:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:44] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:45] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 148 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 147 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 131 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 116 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 128 places in 96 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 122 places in 97 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 128 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 132 places in 90 ms of which 0 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:19: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 7
[2022-06-13 01:19:49] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned sat
[2022-06-13 01:19:49] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2022-06-13 01:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:49] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:19:50] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1031 ms
[2022-06-13 01:19:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:51] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2022-06-13 01:19:51] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 15 ms returned sat
[2022-06-13 01:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:51] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 995 ms
[2022-06-13 01:19:52] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 30 ms.
[2022-06-13 01:19:53] [INFO ] Added : 220 causal constraints over 44 iterations in 1483 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:19:53] [INFO ] [Real]Absence check using 53 positive place invariants in 24 ms returned sat
[2022-06-13 01:19:53] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2022-06-13 01:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:54] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2022-06-13 01:19:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:54] [INFO ] [Nat]Absence check using 53 positive place invariants in 23 ms returned sat
[2022-06-13 01:19:54] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2022-06-13 01:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:55] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:19:56] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 133 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 132 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:19:57] [INFO ] Deduced a trap composed of 137 places in 102 ms of which 1 ms to minimize.
[2022-06-13 01:19:58] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 1 ms to minimize.
[2022-06-13 01:19:58] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:19:58] [INFO ] Deduced a trap composed of 128 places in 98 ms of which 0 ms to minimize.
[2022-06-13 01:19:58] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3066 ms
[2022-06-13 01:19:58] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 23 ms.
[2022-06-13 01:19:59] [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
[2022-06-13 01:19:59] [INFO ] [Real]Absence check using 53 positive place invariants in 25 ms returned sat
[2022-06-13 01:19:59] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2022-06-13 01:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:00] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2022-06-13 01:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:00] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2022-06-13 01:20:00] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 21 ms returned sat
[2022-06-13 01:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:01] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 327 ms
[2022-06-13 01:20:01] [INFO ] [Real]Absence check using 53 positive place invariants in 26 ms returned sat
[2022-06-13 01:20:01] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2022-06-13 01:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:02] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2022-06-13 01:20:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:02] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2022-06-13 01:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:03] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 31700 steps, including 271 resets, run finished after 102 ms. (steps per millisecond=310 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19400 steps, including 178 resets, run finished after 56 ms. (steps per millisecond=346 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 112 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 555 transition count 459
Reduce places removed 41 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 56 rules applied. Total rules applied 98 place count 514 transition count 444
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 113 place count 499 transition count 444
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 113 place count 499 transition count 355
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 300 place count 401 transition count 355
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 351 place count 350 transition count 304
Iterating global reduction 3 with 51 rules applied. Total rules applied 402 place count 350 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 402 place count 350 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 404 place count 349 transition count 303
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 109 rules applied. Total rules applied 513 place count 293 transition count 250
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 514 place count 293 transition count 250
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 519 place count 293 transition count 250
Applied a total of 519 rules in 148 ms. Remains 293 /560 variables (removed 267) and now considering 250/501 (removed 251) transitions.
Finished structural reductions, in 1 iterations. Remains : 293/560 places, 250/501 transitions.
[2022-06-13 01:20:07] [INFO ] Flatten gal took : 78 ms
[2022-06-13 01:20:07] [INFO ] Flatten gal took : 39 ms
[2022-06-13 01:20:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8865270169391163420.gal : 39 ms
[2022-06-13 01:20:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14600703303111303576.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8865270169391163420.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14600703303111303576.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/ReachabilityCardinality8865270169391163420.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14600703303111303576.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14600703303111303576.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 34
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :34 after 41
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :41 after 93
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :93 after 317
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :317 after 2657
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2657 after 27181
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :40681 after 215446
Detected timeout of ITS tools.
[2022-06-13 01:20:23] [INFO ] Flatten gal took : 26 ms
[2022-06-13 01:20:23] [INFO ] Applying decomposition
[2022-06-13 01:20:23] [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/graph17358630641435953648.txt, -o, /tmp/graph17358630641435953648.bin, -w, /tmp/graph17358630641435953648.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/graph17358630641435953648.bin, -l, -1, -v, -w, /tmp/graph17358630641435953648.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:20:23] [INFO ] Decomposing Gal with order
[2022-06-13 01:20:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:20:23] [INFO ] Removed a total of 181 redundant transitions.
[2022-06-13 01:20:23] [INFO ] Flatten gal took : 134 ms
[2022-06-13 01:20:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2022-06-13 01:20:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1843516509000832371.gal : 9 ms
[2022-06-13 01:20:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality438192742931732948.prop : 585 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/ReachabilityCardinality1843516509000832371.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality438192742931732948.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/ReachabilityCardinality1843516509000832371.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality438192742931732948.prop --nowitness
Loading property file /tmp/ReachabilityCardinality438192742931732948.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :4 after 22
Invariant property BusinessProcesses-PT-11-ReachabilityFireability-15 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-13 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :5.82258e+08 after 1.22544e+10
Invariant property BusinessProcesses-PT-11-ReachabilityFireability-03 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.22544e+10 after 1.32399e+10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.32399e+10 after 1.32532e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.32532e+10 after 2.65186e+10
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,2.37336e+11,0.731544,20980,2130,432,29828,3525,989,51813,179,31582,0
Total reachable state count : 237335835101

Verifying 6 reachability properties.
Invariant property BusinessProcesses-PT-11-ReachabilityFireability-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-11-ReachabilityFireability-03,8.84736e+06,0.734504,20980,153,52,29828,3525,993,51813,183,31582,0
Invariant property BusinessProcesses-PT-11-ReachabilityFireability-06 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-11-ReachabilityFireability-06,5.55467e+08,0.738315,20980,223,107,29828,3525,996,51813,184,31582,683
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-09 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : BusinessProcesses-PT-11-ReachabilityFireability-09

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-11-ReachabilityFireability-09,0,0.746924,20980,1,0,29828,3525,1036,51813,190,31582,3884
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-12 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-11-ReachabilityFireability-12,4608,0.748426,20980,142,44,29828,3525,1057,51813,190,31582,4096
Reachability property BusinessProcesses-PT-11-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-11-ReachabilityFireability-13,3.76013e+07,0.756166,20980,176,92,29828,3525,1278,51813,201,31582,6440
Invariant property BusinessProcesses-PT-11-ReachabilityFireability-15 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-11-ReachabilityFireability-15,8.86245e+07,0.776648,20980,335,64,29828,3525,1451,51813,206,31582,13717
All properties solved without resorting to model-checking.

BK_STOP 1655083229958

--------------------
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-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BusinessProcesses-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936100153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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