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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 159K 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-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620939246271

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:54:07] [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:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:54:07] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-13 20:54:07] [INFO ] Transformed 638 places.
[2021-05-13 20:54:07] [INFO ] Transformed 578 transitions.
[2021-05-13 20:54:07] [INFO ] Found NUPN structural information;
[2021-05-13 20:54:07] [INFO ] Parsed PT model containing 638 places and 578 transitions in 121 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 570 rows 630 cols
[2021-05-13 20:54:08] [INFO ] Computed 100 place invariants in 31 ms
[2021-05-13 20:54:08] [INFO ] [Real]Absence check using 62 positive place invariants in 59 ms returned sat
[2021-05-13 20:54:08] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 31 ms returned sat
[2021-05-13 20:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:09] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2021-05-13 20:54:10] [INFO ] Deduced a trap composed of 129 places in 337 ms
[2021-05-13 20:54:10] [INFO ] Deduced a trap composed of 14 places in 196 ms
[2021-05-13 20:54:10] [INFO ] Deduced a trap composed of 16 places in 113 ms
[2021-05-13 20:54:10] [INFO ] Deduced a trap composed of 15 places in 112 ms
[2021-05-13 20:54:10] [INFO ] Deduced a trap composed of 12 places in 112 ms
[2021-05-13 20:54:10] [INFO ] Deduced a trap composed of 31 places in 131 ms
[2021-05-13 20:54:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1193 ms
[2021-05-13 20:54:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:54:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 73 ms returned sat
[2021-05-13 20:54:11] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 34 ms returned sat
[2021-05-13 20:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:12] [INFO ] [Nat]Absence check using state equation in 1052 ms returned sat
[2021-05-13 20:54:12] [INFO ] Deduced a trap composed of 17 places in 204 ms
[2021-05-13 20:54:12] [INFO ] Deduced a trap composed of 11 places in 152 ms
[2021-05-13 20:54:12] [INFO ] Deduced a trap composed of 31 places in 147 ms
[2021-05-13 20:54:13] [INFO ] Deduced a trap composed of 8 places in 168 ms
[2021-05-13 20:54:13] [INFO ] Deduced a trap composed of 39 places in 153 ms
[2021-05-13 20:54:13] [INFO ] Deduced a trap composed of 31 places in 141 ms
[2021-05-13 20:54:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1176 ms
[2021-05-13 20:54:13] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 52 ms.
[2021-05-13 20:54:16] [INFO ] Added : 335 causal constraints over 67 iterations in 2571 ms. Result :(error "Failed to check-sat")
[2021-05-13 20:54:16] [INFO ] [Real]Absence check using 62 positive place invariants in 69 ms returned sat
[2021-05-13 20:54:16] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 58 ms returned sat
[2021-05-13 20:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:17] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2021-05-13 20:54:17] [INFO ] Deduced a trap composed of 12 places in 297 ms
[2021-05-13 20:54:18] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2021-05-13 20:54:18] [INFO ] Deduced a trap composed of 8 places in 270 ms
[2021-05-13 20:54:18] [INFO ] Deduced a trap composed of 37 places in 270 ms
[2021-05-13 20:54:19] [INFO ] Deduced a trap composed of 20 places in 221 ms
[2021-05-13 20:54:19] [INFO ] Deduced a trap composed of 16 places in 171 ms
[2021-05-13 20:54:19] [INFO ] Deduced a trap composed of 129 places in 174 ms
[2021-05-13 20:54:19] [INFO ] Deduced a trap composed of 131 places in 174 ms
[2021-05-13 20:54:19] [INFO ] Deduced a trap composed of 32 places in 193 ms
[2021-05-13 20:54:20] [INFO ] Deduced a trap composed of 14 places in 189 ms
[2021-05-13 20:54:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2503 ms
[2021-05-13 20:54:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:54:20] [INFO ] [Nat]Absence check using 62 positive place invariants in 72 ms returned sat
[2021-05-13 20:54:20] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 27 ms returned sat
[2021-05-13 20:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:21] [INFO ] [Nat]Absence check using state equation in 1182 ms returned sat
[2021-05-13 20:54:21] [INFO ] Deduced a trap composed of 12 places in 287 ms
[2021-05-13 20:54:22] [INFO ] Deduced a trap composed of 8 places in 252 ms
[2021-05-13 20:54:22] [INFO ] Deduced a trap composed of 8 places in 265 ms
[2021-05-13 20:54:22] [INFO ] Deduced a trap composed of 13 places in 261 ms
[2021-05-13 20:54:22] [INFO ] Deduced a trap composed of 14 places in 241 ms
[2021-05-13 20:54:23] [INFO ] Deduced a trap composed of 19 places in 239 ms
[2021-05-13 20:54:23] [INFO ] Deduced a trap composed of 39 places in 224 ms
[2021-05-13 20:54:23] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2021-05-13 20:54:23] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2021-05-13 20:54:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2294 ms
[2021-05-13 20:54:23] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 29 ms.
[2021-05-13 20:54:25] [INFO ] Added : 190 causal constraints over 38 iterations in 1347 ms. Result :(error "Failed to check-sat")
[2021-05-13 20:54:25] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned unsat
[2021-05-13 20:54:25] [INFO ] [Real]Absence check using 62 positive place invariants in 60 ms returned sat
[2021-05-13 20:54:25] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 38 ms returned sat
[2021-05-13 20:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:26] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2021-05-13 20:54:26] [INFO ] Deduced a trap composed of 15 places in 274 ms
[2021-05-13 20:54:27] [INFO ] Deduced a trap composed of 108 places in 242 ms
[2021-05-13 20:54:27] [INFO ] Deduced a trap composed of 16 places in 249 ms
[2021-05-13 20:54:27] [INFO ] Deduced a trap composed of 11 places in 241 ms
[2021-05-13 20:54:27] [INFO ] Deduced a trap composed of 15 places in 234 ms
[2021-05-13 20:54:28] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2021-05-13 20:54:28] [INFO ] Deduced a trap composed of 22 places in 152 ms
[2021-05-13 20:54:28] [INFO ] Deduced a trap composed of 18 places in 115 ms
[2021-05-13 20:54:28] [INFO ] Deduced a trap composed of 29 places in 141 ms
[2021-05-13 20:54:28] [INFO ] Deduced a trap composed of 39 places in 123 ms
[2021-05-13 20:54:28] [INFO ] Deduced a trap composed of 41 places in 111 ms
[2021-05-13 20:54:29] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2021-05-13 20:54:29] [INFO ] Deduced a trap composed of 42 places in 110 ms
[2021-05-13 20:54:29] [INFO ] Deduced a trap composed of 48 places in 113 ms
[2021-05-13 20:54:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2759 ms
[2021-05-13 20:54:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:54:29] [INFO ] [Nat]Absence check using 62 positive place invariants in 77 ms returned sat
[2021-05-13 20:54:29] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 37 ms returned sat
[2021-05-13 20:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:30] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2021-05-13 20:54:30] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2021-05-13 20:54:31] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2021-05-13 20:54:31] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2021-05-13 20:54:31] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2021-05-13 20:54:31] [INFO ] Deduced a trap composed of 14 places in 174 ms
[2021-05-13 20:54:31] [INFO ] Deduced a trap composed of 28 places in 192 ms
[2021-05-13 20:54:32] [INFO ] Deduced a trap composed of 29 places in 134 ms
[2021-05-13 20:54:32] [INFO ] Deduced a trap composed of 35 places in 156 ms
[2021-05-13 20:54:32] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2021-05-13 20:54:32] [INFO ] Deduced a trap composed of 15 places in 138 ms
[2021-05-13 20:54:32] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2021-05-13 20:54:32] [INFO ] Deduced a trap composed of 43 places in 86 ms
[2021-05-13 20:54:33] [INFO ] Deduced a trap composed of 41 places in 85 ms
[2021-05-13 20:54:33] [INFO ] Deduced a trap composed of 48 places in 74 ms
[2021-05-13 20:54:33] [INFO ] Deduced a trap composed of 54 places in 84 ms
[2021-05-13 20:54:33] [INFO ] Deduced a trap composed of 44 places in 83 ms
[2021-05-13 20:54:33] [INFO ] Deduced a trap composed of 53 places in 75 ms
[2021-05-13 20:54:33] [INFO ] Deduced a trap composed of 56 places in 70 ms
[2021-05-13 20:54:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2930 ms
[2021-05-13 20:54:33] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 48 ms.
[2021-05-13 20:54:34] [INFO ] Added : 70 causal constraints over 14 iterations in 714 ms. Result :(error "Failed to check-sat")
[2021-05-13 20:54:34] [INFO ] [Real]Absence check using 62 positive place invariants in 52 ms returned sat
[2021-05-13 20:54:34] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2021-05-13 20:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:35] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2021-05-13 20:54:35] [INFO ] Deduced a trap composed of 8 places in 219 ms
[2021-05-13 20:54:35] [INFO ] Deduced a trap composed of 11 places in 161 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 14 places in 157 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 32 places in 92 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 45 places in 114 ms
[2021-05-13 20:54:36] [INFO ] Deduced a trap composed of 39 places in 88 ms
[2021-05-13 20:54:37] [INFO ] Deduced a trap composed of 46 places in 104 ms
[2021-05-13 20:54:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1596 ms
[2021-05-13 20:54:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:54:37] [INFO ] [Nat]Absence check using 62 positive place invariants in 95 ms returned sat
[2021-05-13 20:54:37] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 31 ms returned sat
[2021-05-13 20:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:38] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2021-05-13 20:54:38] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2021-05-13 20:54:38] [INFO ] Deduced a trap composed of 11 places in 159 ms
[2021-05-13 20:54:39] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2021-05-13 20:54:39] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2021-05-13 20:54:39] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2021-05-13 20:54:39] [INFO ] Deduced a trap composed of 14 places in 181 ms
[2021-05-13 20:54:39] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2021-05-13 20:54:39] [INFO ] Deduced a trap composed of 17 places in 136 ms
[2021-05-13 20:54:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1572 ms
[2021-05-13 20:54:40] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 45 ms.
[2021-05-13 20:54:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t243 0) (and (> t555 0) (< o555 o243)))") while checking expression at index 4
[2021-05-13 20:54:42] [INFO ] [Real]Absence check using 62 positive place invariants in 52 ms returned sat
[2021-05-13 20:54:42] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-13 20:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:43] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2021-05-13 20:54:43] [INFO ] Deduced a trap composed of 13 places in 392 ms
[2021-05-13 20:54:44] [INFO ] Deduced a trap composed of 14 places in 293 ms
[2021-05-13 20:54:44] [INFO ] Deduced a trap composed of 11 places in 328 ms
[2021-05-13 20:54:44] [INFO ] Deduced a trap composed of 20 places in 295 ms
[2021-05-13 20:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1389 ms
[2021-05-13 20:54:44] [INFO ] [Real]Absence check using 62 positive place invariants in 50 ms returned sat
[2021-05-13 20:54:44] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-13 20:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:45] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2021-05-13 20:54:45] [INFO ] Deduced a trap composed of 8 places in 271 ms
[2021-05-13 20:54:46] [INFO ] Deduced a trap composed of 16 places in 241 ms
[2021-05-13 20:54:46] [INFO ] Deduced a trap composed of 15 places in 271 ms
[2021-05-13 20:54:46] [INFO ] Deduced a trap composed of 19 places in 137 ms
[2021-05-13 20:54:46] [INFO ] Deduced a trap composed of 11 places in 117 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 22 places in 90 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 26 places in 111 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 36 places in 89 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 20 places in 121 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 22 places in 82 ms
[2021-05-13 20:54:47] [INFO ] Deduced a trap composed of 27 places in 67 ms
[2021-05-13 20:54:48] [INFO ] Deduced a trap composed of 32 places in 79 ms
[2021-05-13 20:54:48] [INFO ] Deduced a trap composed of 42 places in 89 ms
[2021-05-13 20:54:48] [INFO ] Deduced a trap composed of 41 places in 86 ms
[2021-05-13 20:54:48] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2021-05-13 20:54:48] [INFO ] Deduced a trap composed of 45 places in 74 ms
[2021-05-13 20:54:48] [INFO ] Deduced a trap composed of 44 places in 78 ms
[2021-05-13 20:54:48] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2985 ms
[2021-05-13 20:54:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:54:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 93 ms returned sat
[2021-05-13 20:54:48] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 55 ms returned sat
[2021-05-13 20:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:50] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2021-05-13 20:54:50] [INFO ] Deduced a trap composed of 13 places in 299 ms
[2021-05-13 20:54:50] [INFO ] Deduced a trap composed of 17 places in 292 ms
[2021-05-13 20:54:50] [INFO ] Deduced a trap composed of 8 places in 263 ms
[2021-05-13 20:54:51] [INFO ] Deduced a trap composed of 14 places in 268 ms
[2021-05-13 20:54:51] [INFO ] Deduced a trap composed of 18 places in 248 ms
[2021-05-13 20:54:51] [INFO ] Deduced a trap composed of 11 places in 251 ms
[2021-05-13 20:54:51] [INFO ] Deduced a trap composed of 17 places in 201 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 19 places in 134 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 19 places in 69 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 31 places in 69 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 25 places in 84 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2021-05-13 20:54:52] [INFO ] Deduced a trap composed of 29 places in 72 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 31 places in 97 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 22 places in 92 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 34 places in 95 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 36 places in 109 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 24 places in 30 ms
[2021-05-13 20:54:53] [INFO ] Deduced a trap composed of 32 places in 23 ms
[2021-05-13 20:54:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3615 ms
[2021-05-13 20:54:53] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 48 ms.
[2021-05-13 20:54:53] [INFO ] Added : 5 causal constraints over 1 iterations in 76 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 20:54:53] [INFO ] [Real]Absence check using 62 positive place invariants in 30 ms returned unsat
[2021-05-13 20:54:54] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned unsat
[2021-05-13 20:54:54] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2021-05-13 20:54:54] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 57 ms returned sat
[2021-05-13 20:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:55] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2021-05-13 20:54:55] [INFO ] Deduced a trap composed of 13 places in 187 ms
[2021-05-13 20:54:55] [INFO ] Deduced a trap composed of 8 places in 156 ms
[2021-05-13 20:54:55] [INFO ] Deduced a trap composed of 16 places in 153 ms
[2021-05-13 20:54:55] [INFO ] Deduced a trap composed of 38 places in 161 ms
[2021-05-13 20:54:56] [INFO ] Deduced a trap composed of 8 places in 174 ms
[2021-05-13 20:54:56] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2021-05-13 20:54:56] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2021-05-13 20:54:56] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2021-05-13 20:54:56] [INFO ] Deduced a trap composed of 30 places in 117 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 31 places in 111 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 45 places in 109 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 45 places in 91 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 42 places in 133 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 51 places in 101 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 45 places in 134 ms
[2021-05-13 20:54:57] [INFO ] Deduced a trap composed of 51 places in 124 ms
[2021-05-13 20:54:58] [INFO ] Deduced a trap composed of 32 places in 81 ms
[2021-05-13 20:54:58] [INFO ] Deduced a trap composed of 52 places in 73 ms
[2021-05-13 20:54:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2955 ms
[2021-05-13 20:54:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:54:58] [INFO ] [Nat]Absence check using 62 positive place invariants in 93 ms returned sat
[2021-05-13 20:54:58] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 31 ms returned sat
[2021-05-13 20:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:54:59] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2021-05-13 20:54:59] [INFO ] Deduced a trap composed of 8 places in 195 ms
[2021-05-13 20:54:59] [INFO ] Deduced a trap composed of 12 places in 176 ms
[2021-05-13 20:55:00] [INFO ] Deduced a trap composed of 19 places in 167 ms
[2021-05-13 20:55:00] [INFO ] Deduced a trap composed of 16 places in 262 ms
[2021-05-13 20:55:00] [INFO ] Deduced a trap composed of 48 places in 262 ms
[2021-05-13 20:55:00] [INFO ] Deduced a trap composed of 42 places in 232 ms
[2021-05-13 20:55:01] [INFO ] Deduced a trap composed of 16 places in 234 ms
[2021-05-13 20:55:01] [INFO ] Deduced a trap composed of 144 places in 228 ms
[2021-05-13 20:55:01] [INFO ] Deduced a trap composed of 69 places in 184 ms
[2021-05-13 20:55:01] [INFO ] Deduced a trap composed of 140 places in 188 ms
[2021-05-13 20:55:01] [INFO ] Deduced a trap composed of 134 places in 183 ms
[2021-05-13 20:55:02] [INFO ] Deduced a trap composed of 142 places in 179 ms
[2021-05-13 20:55:02] [INFO ] Deduced a trap composed of 132 places in 182 ms
[2021-05-13 20:55:02] [INFO ] Deduced a trap composed of 39 places in 186 ms
[2021-05-13 20:55:02] [INFO ] Deduced a trap composed of 137 places in 176 ms
[2021-05-13 20:55:02] [INFO ] Deduced a trap composed of 140 places in 175 ms
[2021-05-13 20:55:03] [INFO ] Deduced a trap composed of 151 places in 266 ms
[2021-05-13 20:55:03] [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 s29 s30 s31 s32 s35 s36 s47 s48 s51 s52 s53 s54 s55 s60 s61 s74 s75 s81 s82 s114 s115 s116 s136 s137 s138 s148 s149 s150 s166 s167 s168 s169 s170 s171 s172 s176 s178 s179 s180 s181 s182 s186 s187 s188 s189 s193 s194 s195 s203 s204 s212 s213 s220 s221 s222 s251 s252 s253 s254 s255 s290 s303 s308 s317 s318 s319 s323 s333 s348 s353 s357 s358 s359 s363 s368 s372 s374 s378 s382 s383 s384 s393 s403 s418 s421 s423 s424 s425 s433 s443 s447 s450 s451 s452 s453 s456 s457 s458 s459 s460 s461 s481 s482 s494 s495 s496 s497 s498 s499 s500 s509 s510 s515 s516 s517 s518 s521 s522 s527 s528 s529 s530 s532 s533 s538 s539 s540 s541 s548 s549 s561 s563 s565 s571 s581 s582 s583 s584 s587 s588 s589 s590 s591 s592 s595 s596 s615 s621 s627) 0)") while checking expression at index 9
[2021-05-13 20:55:03] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2021-05-13 20:55:03] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 27 ms returned sat
[2021-05-13 20:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:04] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2021-05-13 20:55:04] [INFO ] Deduced a trap composed of 120 places in 324 ms
[2021-05-13 20:55:04] [INFO ] Deduced a trap composed of 12 places in 287 ms
[2021-05-13 20:55:05] [INFO ] Deduced a trap composed of 15 places in 286 ms
[2021-05-13 20:55:05] [INFO ] Deduced a trap composed of 8 places in 222 ms
[2021-05-13 20:55:05] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2021-05-13 20:55:05] [INFO ] Deduced a trap composed of 21 places in 265 ms
[2021-05-13 20:55:06] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2021-05-13 20:55:06] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2021-05-13 20:55:06] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2021-05-13 20:55:06] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2021-05-13 20:55:06] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2021-05-13 20:55:06] [INFO ] Deduced a trap composed of 49 places in 107 ms
[2021-05-13 20:55:07] [INFO ] Deduced a trap composed of 39 places in 105 ms
[2021-05-13 20:55:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2888 ms
[2021-05-13 20:55:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:55:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 104 ms returned sat
[2021-05-13 20:55:07] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 31 ms returned sat
[2021-05-13 20:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:08] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2021-05-13 20:55:08] [INFO ] Deduced a trap composed of 15 places in 310 ms
[2021-05-13 20:55:08] [INFO ] Deduced a trap composed of 8 places in 295 ms
[2021-05-13 20:55:09] [INFO ] Deduced a trap composed of 11 places in 314 ms
[2021-05-13 20:55:09] [INFO ] Deduced a trap composed of 15 places in 311 ms
[2021-05-13 20:55:09] [INFO ] Deduced a trap composed of 16 places in 283 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 39 places in 247 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 46 places in 273 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 40 places in 107 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 45 places in 82 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 49 places in 82 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2021-05-13 20:55:10] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 45 places in 108 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 43 places in 84 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 47 places in 69 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 50 places in 63 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2021-05-13 20:55:11] [INFO ] Deduced a trap composed of 32 places in 33 ms
[2021-05-13 20:55:11] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3527 ms
[2021-05-13 20:55:11] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 47 ms.
[2021-05-13 20:55:12] [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 (=> (> t78 0) (and (> t535 0) (< o535 o78)))") while checking expression at index 10
[2021-05-13 20:55:12] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2021-05-13 20:55:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-13 20:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:13] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2021-05-13 20:55:13] [INFO ] Deduced a trap composed of 13 places in 311 ms
[2021-05-13 20:55:13] [INFO ] Deduced a trap composed of 8 places in 277 ms
[2021-05-13 20:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 637 ms
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 30 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 624 transition count 475
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 189 place count 530 transition count 475
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 189 place count 530 transition count 349
Deduced a syphon composed of 126 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 456 place count 389 transition count 349
Symmetric choice reduction at 2 with 85 rule applications. Total rules 541 place count 389 transition count 349
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 85 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 711 place count 304 transition count 264
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 711 place count 304 transition count 256
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 730 place count 293 transition count 256
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 906 place count 204 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 908 place count 203 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 909 place count 203 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 910 place count 202 transition count 172
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 915 place count 202 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 916 place count 201 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 917 place count 200 transition count 171
Applied a total of 917 rules in 156 ms. Remains 200 /630 variables (removed 430) and now considering 171/570 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/630 places, 171/570 transitions.
Incomplete random walk after 1000000 steps, including 53176 resets, run finished after 2356 ms. (steps per millisecond=424 ) properties seen :[0, 1, 0, 1, 0, 1, 1]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9682 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties seen :[1, 0, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 10443 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10555 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties seen :[0, 0]
// Phase 1: matrix 171 rows 200 cols
[2021-05-13 20:55:19] [INFO ] Computed 74 place invariants in 8 ms
[2021-05-13 20:55:19] [INFO ] [Real]Absence check using 58 positive place invariants in 34 ms returned sat
[2021-05-13 20:55:19] [INFO ] [Real]Absence check using 58 positive and 16 generalized place invariants in 10 ms returned sat
[2021-05-13 20:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:20] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-13 20:55:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-13 20:55:20] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2021-05-13 20:55:20] [INFO ] Deduced a trap composed of 6 places in 39 ms
[2021-05-13 20:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-13 20:55:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:55:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 38 ms returned sat
[2021-05-13 20:55:20] [INFO ] [Nat]Absence check using 58 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:20] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-13 20:55:20] [INFO ] [Nat]Added 5 Read/Feed constraints in 9 ms returned sat
[2021-05-13 20:55:20] [INFO ] Deduced a trap composed of 42 places in 100 ms
[2021-05-13 20:55:20] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-13 20:55:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2021-05-13 20:55:20] [INFO ] Computed and/alt/rep : 163/806/163 causal constraints in 9 ms.
[2021-05-13 20:55:20] [INFO ] Added : 55 causal constraints over 11 iterations in 178 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 20:55:20] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2021-05-13 20:55:20] [INFO ] [Real]Absence check using 58 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 20:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:21] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-13 20:55:21] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2021-05-13 20:55:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:55:21] [INFO ] [Nat]Absence check using 58 positive place invariants in 25 ms returned sat
[2021-05-13 20:55:21] [INFO ] [Nat]Absence check using 58 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 20:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:55:21] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-13 20:55:21] [INFO ] [Nat]Added 5 Read/Feed constraints in 29 ms returned sat
[2021-05-13 20:55:21] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2021-05-13 20:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-13 20:55:21] [INFO ] Computed and/alt/rep : 163/806/163 causal constraints in 14 ms.
[2021-05-13 20:55:21] [INFO ] Added : 86 causal constraints over 18 iterations in 408 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 11900 steps, including 864 resets, run finished after 46 ms. (steps per millisecond=258 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 10100 steps, including 140 resets, run finished after 35 ms. (steps per millisecond=288 ) properties seen :[1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 171/171 transitions.
Graph (trivial) has 29 edges and 200 vertex of which 4 / 200 are part of one of the 1 SCC in 8 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 197 transition count 161
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 192 transition count 161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 192 transition count 151
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 180 transition count 151
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 168 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 168 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 167 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 167 transition count 138
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 167 transition count 138
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 166 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 165 transition count 136
Applied a total of 69 rules in 71 ms. Remains 165 /200 variables (removed 35) and now considering 136/171 (removed 35) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/200 places, 136/171 transitions.
Finished random walk after 370720 steps, including 16010 resets, run visited all 1 properties in 1167 ms. (steps per millisecond=317 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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-16"
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-16, 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-162038177000224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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