Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 63K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620936108878

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:01:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:01:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:01:51] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2021-05-13 20:01:51] [INFO ] Transformed 274 places.
[2021-05-13 20:01:51] [INFO ] Transformed 237 transitions.
[2021-05-13 20:01:51] [INFO ] Found NUPN structural information;
[2021-05-13 20:01:51] [INFO ] Parsed PT model containing 274 places and 237 transitions in 191 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 123 resets, run finished after 121 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 273 cols
[2021-05-13 20:01:52] [INFO ] Computed 43 place invariants in 17 ms
[2021-05-13 20:01:52] [INFO ] [Real]Absence check using 31 positive place invariants in 103 ms returned unsat
[2021-05-13 20:01:52] [INFO ] [Real]Absence check using 31 positive place invariants in 51 ms returned sat
[2021-05-13 20:01:52] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-13 20:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:53] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2021-05-13 20:01:53] [INFO ] Deduced a trap composed of 8 places in 340 ms
[2021-05-13 20:01:54] [INFO ] Deduced a trap composed of 11 places in 341 ms
[2021-05-13 20:01:54] [INFO ] Deduced a trap composed of 24 places in 286 ms
[2021-05-13 20:01:54] [INFO ] Deduced a trap composed of 15 places in 140 ms
[2021-05-13 20:01:54] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2021-05-13 20:01:54] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2021-05-13 20:01:54] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2021-05-13 20:01:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1574 ms
[2021-05-13 20:01:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 69 ms returned sat
[2021-05-13 20:01:55] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 20:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:55] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-13 20:01:55] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2021-05-13 20:01:55] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2021-05-13 20:01:55] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2021-05-13 20:01:55] [INFO ] Deduced a trap composed of 15 places in 129 ms
[2021-05-13 20:01:56] [INFO ] Deduced a trap composed of 20 places in 211 ms
[2021-05-13 20:01:56] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2021-05-13 20:01:56] [INFO ] Deduced a trap composed of 15 places in 95 ms
[2021-05-13 20:01:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1105 ms
[2021-05-13 20:01:56] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 30 ms.
[2021-05-13 20:01:57] [INFO ] Added : 151 causal constraints over 31 iterations in 872 ms. Result :sat
[2021-05-13 20:01:57] [INFO ] Deduced a trap composed of 70 places in 107 ms
[2021-05-13 20:01:59] [INFO ] Deduced a trap composed of 76 places in 1566 ms
[2021-05-13 20:01:59] [INFO ] Deduced a trap composed of 71 places in 186 ms
[2021-05-13 20:01:59] [INFO ] Deduced a trap composed of 73 places in 174 ms
[2021-05-13 20:01:59] [INFO ] Deduced a trap composed of 71 places in 164 ms
[2021-05-13 20:01:59] [INFO ] Deduced a trap composed of 73 places in 107 ms
[2021-05-13 20:01:59] [INFO ] Deduced a trap composed of 72 places in 123 ms
[2021-05-13 20:01:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:02:00] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2021-05-13 20:02:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s88 s89 s90 s98 s101 s139 s268 s269) 0)") while checking expression at index 1
[2021-05-13 20:02:00] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-13 20:02:00] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2021-05-13 20:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:00] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2021-05-13 20:02:00] [INFO ] Deduced a trap composed of 40 places in 224 ms
[2021-05-13 20:02:01] [INFO ] Deduced a trap composed of 11 places in 112 ms
[2021-05-13 20:02:01] [INFO ] Deduced a trap composed of 20 places in 200 ms
[2021-05-13 20:02:01] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2021-05-13 20:02:01] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2021-05-13 20:02:01] [INFO ] Deduced a trap composed of 14 places in 120 ms
[2021-05-13 20:02:01] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2021-05-13 20:02:02] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2021-05-13 20:02:02] [INFO ] Deduced a trap composed of 30 places in 135 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 12 places in 1081 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 15 places in 128 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 51 places in 81 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 41 places in 55 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 14 places in 46 ms
[2021-05-13 20:02:03] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2021-05-13 20:02:03] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3216 ms
[2021-05-13 20:02:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 47 ms returned sat
[2021-05-13 20:02:04] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:02:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:04] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 40 places in 98 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 25 places in 60 ms
[2021-05-13 20:02:04] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 37 places in 69 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 13 places in 56 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 39 places in 54 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 31 places in 53 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 21 places in 52 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 37 places in 40 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 28 places in 43 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 36 places in 43 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 45 places in 51 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 40 places in 43 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 46 places in 41 ms
[2021-05-13 20:02:05] [INFO ] Deduced a trap composed of 44 places in 45 ms
[2021-05-13 20:02:06] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2021-05-13 20:02:06] [INFO ] Deduced a trap composed of 45 places in 39 ms
[2021-05-13 20:02:06] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1839 ms
[2021-05-13 20:02:06] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 17 ms.
[2021-05-13 20:02:06] [INFO ] Added : 175 causal constraints over 36 iterations in 652 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-13 20:02:06] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-13 20:02:06] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:07] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 76 places in 123 ms
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 79 places in 127 ms
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 33 places in 95 ms
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 70 places in 93 ms
[2021-05-13 20:02:07] [INFO ] Deduced a trap composed of 29 places in 68 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 38 places in 84 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 30 places in 64 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 45 places in 60 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 37 places in 51 ms
[2021-05-13 20:02:08] [INFO ] Deduced a trap composed of 13 places in 81 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 35 places in 48 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 37 places in 44 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 44 places in 41 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 37 places in 43 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 45 places in 52 ms
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 27 places in 40 ms
[2021-05-13 20:02:09] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2286 ms
[2021-05-13 20:02:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2021-05-13 20:02:09] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 20:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:09] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2021-05-13 20:02:09] [INFO ] Deduced a trap composed of 76 places in 121 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 79 places in 107 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 70 places in 88 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 38 places in 71 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 24 places in 60 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2021-05-13 20:02:10] [INFO ] Deduced a trap composed of 33 places in 58 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 30 places in 83 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 37 places in 39 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 35 places in 67 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 37 places in 51 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 44 places in 47 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 37 places in 40 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-13 20:02:11] [INFO ] Deduced a trap composed of 27 places in 36 ms
[2021-05-13 20:02:11] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1955 ms
[2021-05-13 20:02:11] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 14 ms.
[2021-05-13 20:02:12] [INFO ] Added : 145 causal constraints over 29 iterations in 543 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 20:02:12] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2021-05-13 20:02:12] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:12] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-13 20:02:12] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2021-05-13 20:02:12] [INFO ] Deduced a trap composed of 11 places in 78 ms
[2021-05-13 20:02:12] [INFO ] Deduced a trap composed of 14 places in 89 ms
[2021-05-13 20:02:12] [INFO ] Deduced a trap composed of 25 places in 66 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 21 places in 56 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 30 places in 53 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 28 places in 48 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 36 places in 58 ms
[2021-05-13 20:02:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 800 ms
[2021-05-13 20:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 54 ms returned sat
[2021-05-13 20:02:13] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:13] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2021-05-13 20:02:13] [INFO ] Deduced a trap composed of 11 places in 65 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 14 places in 73 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 25 places in 64 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 28 places in 48 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 32 places in 47 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2021-05-13 20:02:14] [INFO ] Deduced a trap composed of 36 places in 42 ms
[2021-05-13 20:02:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 776 ms
[2021-05-13 20:02:14] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 24 ms.
[2021-05-13 20:02:15] [INFO ] Added : 117 causal constraints over 24 iterations in 464 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-13 20:02:15] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-13 20:02:15] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 20:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:15] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-13 20:02:15] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2021-05-13 20:02:15] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2021-05-13 20:02:15] [INFO ] Deduced a trap composed of 19 places in 132 ms
[2021-05-13 20:02:15] [INFO ] Deduced a trap composed of 23 places in 99 ms
[2021-05-13 20:02:16] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2021-05-13 20:02:16] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2021-05-13 20:02:16] [INFO ] Deduced a trap composed of 14 places in 95 ms
[2021-05-13 20:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 854 ms
[2021-05-13 20:02:16] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned unsat
[2021-05-13 20:02:16] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned unsat
[2021-05-13 20:02:16] [INFO ] [Real]Absence check using 31 positive place invariants in 28 ms returned sat
[2021-05-13 20:02:16] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 20:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:16] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-13 20:02:16] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2021-05-13 20:02:16] [INFO ] Deduced a trap composed of 14 places in 58 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 12 places in 49 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 12 places in 72 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 24 places in 56 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 46 places in 44 ms
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 33 places in 39 ms
[2021-05-13 20:02:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 766 ms
[2021-05-13 20:02:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2021-05-13 20:02:17] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 20:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:17] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-13 20:02:17] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 32 places in 47 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 36 places in 71 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2021-05-13 20:02:18] [INFO ] Deduced a trap composed of 14 places in 74 ms
[2021-05-13 20:02:19] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2021-05-13 20:02:19] [INFO ] Deduced a trap composed of 42 places in 45 ms
[2021-05-13 20:02:19] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1254 ms
[2021-05-13 20:02:19] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 14 ms.
[2021-05-13 20:02:19] [INFO ] Added : 129 causal constraints over 26 iterations in 501 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 20:02:19] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2021-05-13 20:02:19] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 20:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:19] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-13 20:02:20] [INFO ] Deduced a trap composed of 29 places in 91 ms
[2021-05-13 20:02:20] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2021-05-13 20:02:20] [INFO ] Deduced a trap composed of 15 places in 115 ms
[2021-05-13 20:02:20] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2021-05-13 20:02:20] [INFO ] Deduced a trap composed of 14 places in 149 ms
[2021-05-13 20:02:20] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2021-05-13 20:02:21] [INFO ] Deduced a trap composed of 22 places in 573 ms
[2021-05-13 20:02:21] [INFO ] Deduced a trap composed of 35 places in 77 ms
[2021-05-13 20:02:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1456 ms
[2021-05-13 20:02:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 77 ms returned sat
[2021-05-13 20:02:21] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:21] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2021-05-13 20:02:22] [INFO ] Deduced a trap composed of 15 places in 111 ms
[2021-05-13 20:02:22] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2021-05-13 20:02:22] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2021-05-13 20:02:22] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2021-05-13 20:02:22] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2021-05-13 20:02:22] [INFO ] Deduced a trap composed of 25 places in 62 ms
[2021-05-13 20:02:24] [INFO ] Deduced a trap composed of 27 places in 2274 ms
[2021-05-13 20:02:24] [INFO ] Deduced a trap composed of 32 places in 79 ms
[2021-05-13 20:02:27] [INFO ] Deduced a trap composed of 31 places in 2569 ms
[2021-05-13 20:02:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s15 s16 s17 s18 s19 s20 s21 s57 s134 s144 s149 s183 s184 s185 s219 s220 s225 s230 s231 s248 s249) 0)") while checking expression at index 9
[2021-05-13 20:02:27] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-13 20:02:27] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-13 20:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:27] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-13 20:02:27] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 15 places in 100 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 19 places in 152 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 14 places in 145 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 11 places in 171 ms
[2021-05-13 20:02:28] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2021-05-13 20:02:29] [INFO ] Deduced a trap composed of 21 places in 164 ms
[2021-05-13 20:02:29] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2021-05-13 20:02:29] [INFO ] Deduced a trap composed of 38 places in 133 ms
[2021-05-13 20:02:29] [INFO ] Deduced a trap composed of 73 places in 136 ms
[2021-05-13 20:02:29] [INFO ] Deduced a trap composed of 44 places in 136 ms
[2021-05-13 20:02:29] [INFO ] Deduced a trap composed of 41 places in 130 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 49 places in 160 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 47 places in 110 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 68 places in 109 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 18 places in 132 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 71 places in 128 ms
[2021-05-13 20:02:30] [INFO ] Deduced a trap composed of 32 places in 101 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 37 places in 147 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 29 places in 131 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 73 places in 133 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 74 places in 133 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 74 places in 133 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 70 places in 128 ms
[2021-05-13 20:02:31] [INFO ] Deduced a trap composed of 72 places in 129 ms
[2021-05-13 20:02:32] [INFO ] Deduced a trap composed of 66 places in 137 ms
[2021-05-13 20:02:32] [INFO ] Deduced a trap composed of 69 places in 138 ms
[2021-05-13 20:02:32] [INFO ] Deduced a trap composed of 67 places in 131 ms
[2021-05-13 20:02:32] [INFO ] Deduced a trap composed of 68 places in 117 ms
[2021-05-13 20:02:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s16 s17 s20 s21 s25 s26 s27 s48 s49 s85 s86 s87 s98 s101 s118 s120 s124 s129 s139 s144 s148 s149 s150 s153 s154 s155 s159 s164 s178 s179 s180 s188 s190 s198 s199 s200 s201 s202 s203 s204 s205 s215 s216 s225 s226 s227 s228 s229 s230 s231 s252 s253 s254 s255 s256 s257 s260 s261 s262 s263 s266 s267 s268 s269 s272) 0)") while checking expression at index 10
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 12300 steps, including 108 resets, run finished after 25 ms. (steps per millisecond=492 ) properties seen :[0, 0, 0, 1, 1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11100 steps, including 104 resets, run finished after 22 ms. (steps per millisecond=504 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 14000 steps, including 110 resets, run finished after 27 ms. (steps per millisecond=518 ) properties seen :[0, 0, 1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16600 steps, including 241 resets, run finished after 25 ms. (steps per millisecond=664 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 236/236 transitions.
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 522 edges and 273 vertex of which 270 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 270 transition count 188
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 224 transition count 188
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 94 place count 224 transition count 137
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 203 place count 166 transition count 137
Symmetric choice reduction at 2 with 40 rule applications. Total rules 243 place count 166 transition count 137
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 40 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 323 place count 126 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 325 place count 126 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 125 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 326 place count 125 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 328 place count 124 transition count 94
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 402 place count 87 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 87 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 86 transition count 55
Applied a total of 404 rules in 158 ms. Remains 86 /273 variables (removed 187) and now considering 55/236 (removed 181) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/273 places, 55/236 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties seen :[1, 0, 1, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 55 rows 86 cols
[2021-05-13 20:02:36] [INFO ] Computed 35 place invariants in 2 ms
[2021-05-13 20:02:36] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:36] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-13 20:02:36] [INFO ] Computed and/alt/rep : 52/143/52 causal constraints in 3 ms.
[2021-05-13 20:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 11 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:36] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-13 20:02:36] [INFO ] Computed and/alt/rep : 52/143/52 causal constraints in 4 ms.
[2021-05-13 20:02:36] [INFO ] Added : 25 causal constraints over 5 iterations in 47 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 20:02:36] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:36] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 20:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:02:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-13 20:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:02:36] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-13 20:02:36] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2021-05-13 20:02:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 39 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

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-03"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is BusinessProcesses-PT-03, 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 r037-tajo-162038177000172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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