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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:04 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 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:06 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 146K 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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083201175

Running Version 0
[2022-06-13 01:20:03] [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:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:20:03] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-06-13 01:20:03] [INFO ] Transformed 586 places.
[2022-06-13 01:20:03] [INFO ] Transformed 525 transitions.
[2022-06-13 01:20:03] [INFO ] Found NUPN structural information;
[2022-06-13 01:20:03] [INFO ] Parsed PT model containing 586 places and 525 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 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 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 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 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
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 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 521 rows 582 cols
[2022-06-13 01:20:03] [INFO ] Computed 98 place invariants in 44 ms
[2022-06-13 01:20:04] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2022-06-13 01:20:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2022-06-13 01:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:04] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 4 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3584 ms
[2022-06-13 01:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 33 ms returned sat
[2022-06-13 01:20:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:08] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 5 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2548 ms
[2022-06-13 01:20:11] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 31 ms.
[2022-06-13 01:20:13] [INFO ] Added : 274 causal constraints over 56 iterations in 2163 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:20:13] [INFO ] [Real]Absence check using 55 positive place invariants in 27 ms returned sat
[2022-06-13 01:20:13] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 8 ms returned unsat
[2022-06-13 01:20:13] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2022-06-13 01:20:13] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-13 01:20:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:14] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned unsat
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-06-13 01:20:14] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:20:14] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:20:14] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:20:15] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:20:16] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:20:17] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:20:17] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:20:17] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2784 ms
[2022-06-13 01:20:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:17] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2022-06-13 01:20:17] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:17] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2022-06-13 01:20:17] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:20:17] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:20:18] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:20:19] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1999 ms
[2022-06-13 01:20:19] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 29 ms.
[2022-06-13 01:20:21] [INFO ] Added : 296 causal constraints over 60 iterations in 2311 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-13 01:20:22] [INFO ] [Real]Absence check using 55 positive place invariants in 39 ms returned sat
[2022-06-13 01:20:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2022-06-13 01:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:23] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2022-06-13 01:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 29 ms returned sat
[2022-06-13 01:20:23] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2022-06-13 01:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:24] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2022-06-13 01:20:24] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:24] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:24] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:20:24] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:20:24] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:20:24] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:20:25] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:26] [INFO ] Deduced a trap composed of 145 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:20:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:20:26] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:20:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2164 ms
[2022-06-13 01:20:26] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 30 ms.
[2022-06-13 01:20:28] [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: Broken pipe ... while checking expression at index 4
[2022-06-13 01:20:28] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned unsat
[2022-06-13 01:20:28] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2022-06-13 01:20:28] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 24 ms returned sat
[2022-06-13 01:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:29] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2022-06-13 01:20:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:29] [INFO ] [Nat]Absence check using 55 positive place invariants in 29 ms returned sat
[2022-06-13 01:20:29] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 25 ms returned sat
[2022-06-13 01:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:30] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2022-06-13 01:20:30] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:20:31] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-06-13 01:20:32] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2022-06-13 01:20:32] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:20:32] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:20:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1825 ms
[2022-06-13 01:20:32] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 31 ms.
[2022-06-13 01:20:33] [INFO ] Added : 97 causal constraints over 21 iterations in 1134 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-13 01:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2022-06-13 01:20:33] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2022-06-13 01:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:34] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2022-06-13 01:20:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:34] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2022-06-13 01:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:35] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2022-06-13 01:20:35] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:20:35] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:20:35] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:20:35] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:20:36] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:20:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2555 ms
[2022-06-13 01:20:37] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 32 ms.
[2022-06-13 01:20:39] [INFO ] Added : 220 causal constraints over 44 iterations in 1743 ms. Result :unknown
[2022-06-13 01:20:39] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:39] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2022-06-13 01:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:40] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2022-06-13 01:20:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:40] [INFO ] [Nat]Absence check using 55 positive place invariants in 26 ms returned sat
[2022-06-13 01:20:40] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2022-06-13 01:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:40] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2022-06-13 01:20:40] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:41] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:20:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2136 ms
[2022-06-13 01:20:42] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 31 ms.
[2022-06-13 01:20:45] [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
[2022-06-13 01:20:45] [INFO ] [Real]Absence check using 55 positive place invariants in 27 ms returned sat
[2022-06-13 01:20:45] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2022-06-13 01:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:46] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2022-06-13 01:20:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 27 ms returned sat
[2022-06-13 01:20:46] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2022-06-13 01:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:47] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1255 ms
[2022-06-13 01:20:48] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 24 ms.
[2022-06-13 01:20:51] [INFO ] Added : 266 causal constraints over 54 iterations in 2675 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-13 01:20:51] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:51] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-06-13 01:20:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:52] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1685 ms
[2022-06-13 01:20:53] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 32 ms.
[2022-06-13 01:20:55] [INFO ] Added : 268 causal constraints over 54 iterations in 2062 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-13 01:20:55] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-06-13 01:20:55] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:20:56] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:20:57] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:20:58] [INFO ] Deduced a trap composed of 149 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 149 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 0 ms to minimize.
[2022-06-13 01:20:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3821 ms
[2022-06-13 01:21:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-06-13 01:21:00] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:00] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:21:00] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:21:01] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:21:02] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:21:03] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3278 ms
[2022-06-13 01:21:03] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 34 ms.
[2022-06-13 01:21: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
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 29900 steps, including 230 resets, run finished after 96 ms. (steps per millisecond=311 ) properties (out of 9) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10100 steps, including 99 resets, run finished after 24 ms. (steps per millisecond=420 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26800 steps, including 234 resets, run finished after 83 ms. (steps per millisecond=322 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 24300 steps, including 191 resets, run finished after 76 ms. (steps per millisecond=319 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26100 steps, including 233 resets, run finished after 60 ms. (steps per millisecond=435 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 122 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 578 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 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 578 transition count 479
Reduce places removed 41 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 58 rules applied. Total rules applied 100 place count 537 transition count 462
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 117 place count 520 transition count 462
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 117 place count 520 transition count 374
Deduced a syphon composed of 88 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 300 place count 425 transition count 374
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 354 place count 371 transition count 320
Iterating global reduction 3 with 54 rules applied. Total rules applied 408 place count 371 transition count 320
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 518 place count 316 transition count 265
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 519 place count 316 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 520 place count 315 transition count 264
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 525 place count 315 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 526 place count 314 transition count 263
Applied a total of 526 rules in 163 ms. Remains 314 /582 variables (removed 268) and now considering 263/521 (removed 258) transitions.
Finished structural reductions, in 1 iterations. Remains : 314/582 places, 263/521 transitions.
[2022-06-13 01:21:05] [INFO ] Flatten gal took : 88 ms
[2022-06-13 01:21:05] [INFO ] Flatten gal took : 27 ms
[2022-06-13 01:21:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1018897773990274337.gal : 14 ms
[2022-06-13 01:21:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2198633486537115272.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/ReachabilityCardinality1018897773990274337.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2198633486537115272.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/ReachabilityCardinality1018897773990274337.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2198633486537115272.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2198633486537115272.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 18
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :18 after 24
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :24 after 51
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :51 after 63
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :63 after 89
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :89 after 261
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1559 after 34075
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :34075 after 216626
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :216626 after 1.56255e+08
Detected timeout of ITS tools.
[2022-06-13 01:21:20] [INFO ] Flatten gal took : 23 ms
[2022-06-13 01:21:20] [INFO ] Applying decomposition
[2022-06-13 01:21:20] [INFO ] Flatten gal took : 19 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/graph7448545185399474146.txt, -o, /tmp/graph7448545185399474146.bin, -w, /tmp/graph7448545185399474146.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/graph7448545185399474146.bin, -l, -1, -v, -w, /tmp/graph7448545185399474146.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:21:21] [INFO ] Decomposing Gal with order
[2022-06-13 01:21:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:21:21] [INFO ] Removed a total of 235 redundant transitions.
[2022-06-13 01:21:21] [INFO ] Flatten gal took : 96 ms
[2022-06-13 01:21:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 33 ms.
[2022-06-13 01:21:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9487056176742553699.gal : 32 ms
[2022-06-13 01:21:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11026465290826322186.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/ReachabilityCardinality9487056176742553699.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11026465290826322186.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/ReachabilityCardinality9487056176742553699.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11026465290826322186.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11026465290826322186.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :132 after 280
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-11 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-05 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-01 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3.59892e+08 after 8.95342e+09
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-15 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-10 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-09 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.25513e+10,0.443334,12704,2031,117,18224,619,979,21843,100,1203,0
Total reachable state count : 12551344923

Verifying 7 reachability properties.
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityFireability-01,1.53032e+07,0.444998,12704,167,38,18224,619,982,21843,103,1203,0
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityFireability-05,186624,0.464115,12968,151,33,18224,619,1161,21843,119,1203,0
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-09 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-12-ReachabilityFireability-09,3.06063e+07,0.466128,12968,166,40,18224,619,1272,21843,120,1203,0
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-10 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-12-ReachabilityFireability-10,419904,0.509578,12968,168,34,18224,619,1402,21843,124,1203,0
Invariant property BusinessProcesses-PT-12-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-12-ReachabilityFireability-11,1.67962e+06,0.558668,12968,151,33,18224,619,1552,21843,126,1203,0
Reachability property BusinessProcesses-PT-12-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-12-ReachabilityFireability-12,1.49299e+06,0.563463,12968,149,35,18224,619,1567,21843,126,1203,0
Reachability property BusinessProcesses-PT-12-ReachabilityFireability-15 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-12-ReachabilityFireability-15,4.35456e+07,0.563871,12968,172,38,18224,619,1568,21843,126,1203,0
All properties solved without resorting to model-checking.

BK_STOP 1655083283149

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

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