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.r189-tajo-162089433000412.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 ResAllocation-PT-R100C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089433000412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621430491576

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:21:33] [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-19 13:21:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:21:33] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-19 13:21:33] [INFO ] Transformed 400 places.
[2021-05-19 13:21:33] [INFO ] Transformed 202 transitions.
[2021-05-19 13:21:33] [INFO ] Parsed PT model containing 400 places and 202 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 101 ms. (steps per millisecond=99 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 1, 0, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 202 rows 400 cols
[2021-05-19 13:21:33] [INFO ] Computed 200 place invariants in 9 ms
[2021-05-19 13:21:33] [INFO ] [Real]Absence check using 200 positive place invariants in 93 ms returned sat
[2021-05-19 13:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:34] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-19 13:21:34] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2021-05-19 13:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2021-05-19 13:21:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 83 ms returned sat
[2021-05-19 13:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:34] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2021-05-19 13:21:34] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2021-05-19 13:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2021-05-19 13:21:35] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 18 ms.
[2021-05-19 13:21:35] [INFO ] Added : 170 causal constraints over 34 iterations in 518 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-19 13:21:35] [INFO ] [Real]Absence check using 200 positive place invariants in 61 ms returned sat
[2021-05-19 13:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:35] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2021-05-19 13:21:35] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2021-05-19 13:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-19 13:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 56 ms returned sat
[2021-05-19 13:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:36] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2021-05-19 13:21:36] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-19 13:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-19 13:21:36] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 9 ms.
[2021-05-19 13:21:36] [INFO ] Added : 175 causal constraints over 35 iterations in 471 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-19 13:21:37] [INFO ] [Real]Absence check using 200 positive place invariants in 72 ms returned sat
[2021-05-19 13:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:37] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2021-05-19 13:21:37] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 13 ms.
[2021-05-19 13:21:37] [INFO ] Added : 98 causal constraints over 20 iterations in 355 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-19 13:21:38] [INFO ] [Real]Absence check using 200 positive place invariants in 155 ms returned sat
[2021-05-19 13:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:38] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2021-05-19 13:21:38] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2021-05-19 13:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-19 13:21:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 77 ms returned sat
[2021-05-19 13:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:39] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2021-05-19 13:21:39] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-19 13:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-19 13:21:39] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 14 ms.
[2021-05-19 13:21:39] [INFO ] Added : 187 causal constraints over 38 iterations in 764 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 270900 steps, including 156 resets, run finished after 1845 ms. (steps per millisecond=146 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 221200 steps, including 99 resets, run finished after 1358 ms. (steps per millisecond=162 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195900 steps, including 137 resets, run finished after 1144 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 200000 steps, including 134 resets, run finished after 1018 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 20 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 397 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 397 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 395 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 393 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 393 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 391 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 389 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 389 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 387 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 385 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 385 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 383 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 381 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 381 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 32 place count 379 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 377 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 377 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 375 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 41 place count 373 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 373 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 44 place count 371 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 47 place count 369 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 48 place count 369 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 50 place count 367 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 53 place count 365 transition count 184
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 54 place count 365 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 56 place count 363 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 59 place count 361 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 60 place count 361 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 62 place count 359 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 65 place count 357 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 66 place count 357 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 68 place count 355 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 71 place count 353 transition count 178
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 72 place count 353 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 74 place count 351 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 77 place count 349 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 78 place count 349 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 80 place count 347 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 83 place count 345 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 84 place count 345 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 86 place count 343 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 89 place count 341 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 90 place count 341 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 92 place count 339 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 95 place count 337 transition count 170
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 96 place count 337 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 98 place count 335 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 101 place count 333 transition count 168
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 102 place count 333 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 104 place count 331 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 3 rules applied. Total rules applied 107 place count 329 transition count 166
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 108 place count 329 transition count 165
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 111 place count 326 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 113 place count 325 transition count 164
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 114 place count 325 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 117 place count 322 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 119 place count 321 transition count 162
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 120 place count 321 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 123 place count 318 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 125 place count 317 transition count 160
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 126 place count 317 transition count 159
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 129 place count 314 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 131 place count 313 transition count 158
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 132 place count 313 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 135 place count 310 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 137 place count 309 transition count 156
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 138 place count 309 transition count 155
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 141 place count 306 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 143 place count 305 transition count 154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 144 place count 305 transition count 153
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 147 place count 302 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 149 place count 301 transition count 152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 150 place count 301 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 24 with 3 rules applied. Total rules applied 153 place count 298 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 155 place count 297 transition count 150
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 156 place count 297 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 159 place count 294 transition count 149
Applied a total of 159 rules in 481 ms. Remains 294 /400 variables (removed 106) and now considering 149/202 (removed 53) transitions.
Finished structural reductions, in 1 iterations. Remains : 294/400 places, 149/202 transitions.
Incomplete random walk after 1000000 steps, including 701 resets, run finished after 2998 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 29 resets, run finished after 2335 ms. (steps per millisecond=428 ) properties seen :[1, 1, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 121 resets, run finished after 1699 ms. (steps per millisecond=588 ) properties seen :[0]
// Phase 1: matrix 149 rows 294 cols
[2021-05-19 13:21:52] [INFO ] Computed 147 place invariants in 3 ms
[2021-05-19 13:21:52] [INFO ] [Real]Absence check using 147 positive place invariants in 62 ms returned sat
[2021-05-19 13:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:53] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-19 13:21:53] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-19 13:21:53] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-19 13:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2021-05-19 13:21:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:53] [INFO ] [Nat]Absence check using 147 positive place invariants in 36 ms returned sat
[2021-05-19 13:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:53] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2021-05-19 13:21:53] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2021-05-19 13:21:53] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2021-05-19 13:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2021-05-19 13:21:53] [INFO ] Computed and/alt/rep : 147/147/147 causal constraints in 11 ms.
[2021-05-19 13:21:54] [INFO ] Added : 144 causal constraints over 29 iterations in 362 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 125000 steps, including 145 resets, run finished after 451 ms. (steps per millisecond=277 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 149/149 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 294 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 292 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 290 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 290 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 288 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 286 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 286 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 284 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 282 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 282 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 280 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 24 place count 278 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 278 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 276 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 30 place count 274 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 274 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 33 place count 272 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 36 place count 270 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 37 place count 270 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 39 place count 268 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 42 place count 266 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 43 place count 266 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 45 place count 264 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 48 place count 262 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 49 place count 262 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 51 place count 260 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 54 place count 258 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 55 place count 258 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 57 place count 256 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 60 place count 254 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 61 place count 254 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 63 place count 252 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 66 place count 250 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 67 place count 250 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 69 place count 248 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 72 place count 246 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 73 place count 246 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 75 place count 244 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 78 place count 242 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 79 place count 242 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 81 place count 240 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 84 place count 238 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 85 place count 238 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 87 place count 236 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 90 place count 234 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 91 place count 234 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 93 place count 232 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 96 place count 230 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 97 place count 230 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 99 place count 228 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 3 rules applied. Total rules applied 102 place count 226 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 103 place count 226 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 105 place count 224 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 108 place count 222 transition count 113
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 109 place count 222 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 111 place count 220 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 114 place count 218 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 115 place count 218 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 117 place count 216 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 3 rules applied. Total rules applied 120 place count 214 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 121 place count 214 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 123 place count 212 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 3 rules applied. Total rules applied 126 place count 210 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 127 place count 210 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 129 place count 208 transition count 106
Applied a total of 129 rules in 139 ms. Remains 208 /294 variables (removed 86) and now considering 106/149 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/294 places, 106/149 transitions.
Incomplete random walk after 1000000 steps, including 1397 resets, run finished after 2470 ms. (steps per millisecond=404 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 257 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties seen :[0]
Interrupted probabilistic random walk after 17663979 steps, run timeout after 30001 ms. (steps per millisecond=588 ) properties seen :[0]
Probabilistic random walk after 17663979 steps, saw 3179538 distinct states, run finished after 30001 ms. (steps per millisecond=588 ) properties seen :[0]
// Phase 1: matrix 106 rows 208 cols
[2021-05-19 13:22:28] [INFO ] Computed 104 place invariants in 8 ms
[2021-05-19 13:22:28] [INFO ] [Real]Absence check using 104 positive place invariants in 50 ms returned sat
[2021-05-19 13:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:28] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-19 13:22:28] [INFO ] Computed and/alt/rep : 104/104/104 causal constraints in 7 ms.
[2021-05-19 13:22:29] [INFO ] Added : 99 causal constraints over 20 iterations in 225 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 68700 steps, including 234 resets, run finished after 240 ms. (steps per millisecond=286 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 208 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 208/208 places, 106/106 transitions.
Applied a total of 0 rules in 7 ms. Remains 208 /208 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 208/208 places, 106/106 transitions.
Applied a total of 0 rules in 7 ms. Remains 208 /208 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 208 cols
[2021-05-19 13:22:29] [INFO ] Computed 104 place invariants in 3 ms
[2021-05-19 13:22:29] [INFO ] Implicit Places using invariants in 268 ms returned [109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 199, 201, 203, 205, 207]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 278 ms to find 50 implicit places.
[2021-05-19 13:22:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:22:29] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:22:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 158/208 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2021-05-19 13:22:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:22:29] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:22:29] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 2 iterations. Remains : 158/208 places, 106/106 transitions.
Incomplete random walk after 1000000 steps, including 1397 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 255 resets, run finished after 1161 ms. (steps per millisecond=861 ) properties seen :[0]
Interrupted probabilistic random walk after 18029839 steps, run timeout after 30001 ms. (steps per millisecond=600 ) properties seen :[0]
Probabilistic random walk after 18029839 steps, saw 3236990 distinct states, run finished after 30001 ms. (steps per millisecond=600 ) properties seen :[0]
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:23:02] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:23:02] [INFO ] [Real]Absence check using 54 positive place invariants in 16 ms returned sat
[2021-05-19 13:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:23:03] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-19 13:23:03] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-19 13:23:03] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-19 13:23:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2021-05-19 13:23:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:23:03] [INFO ] [Nat]Absence check using 54 positive place invariants in 19 ms returned sat
[2021-05-19 13:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:23:03] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-19 13:23:03] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2021-05-19 13:23:03] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-19 13:23:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2021-05-19 13:23:03] [INFO ] Computed and/alt/rep : 104/104/104 causal constraints in 9 ms.
[2021-05-19 13:23:03] [INFO ] Added : 99 causal constraints over 20 iterations in 186 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 88700 steps, including 287 resets, run finished after 195 ms. (steps per millisecond=454 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:23:03] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:23:03] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:23:03] [INFO ] Computed 54 place invariants in 2 ms
[2021-05-19 13:23:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2021-05-19 13:23:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:23:04] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:23:04] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 106/106 transitions.
Incomplete random walk after 100000 steps, including 139 resets, run finished after 213 ms. (steps per millisecond=469 ) properties seen :[0]
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:23:04] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:23:04] [INFO ] [Real]Absence check using 54 positive place invariants in 28 ms returned sat
[2021-05-19 13:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:23:04] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-19 13:23:04] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2021-05-19 13:23:04] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2021-05-19 13:23:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2021-05-19 13:23:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:23:04] [INFO ] [Nat]Absence check using 54 positive place invariants in 16 ms returned sat
[2021-05-19 13:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:23:05] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-19 13:23:05] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-19 13:23:05] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-19 13:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2021-05-19 13:23:05] [INFO ] Computed and/alt/rep : 104/104/104 causal constraints in 6 ms.
[2021-05-19 13:23:05] [INFO ] Added : 99 causal constraints over 20 iterations in 157 ms. Result :sat
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 158 cols
[2021-05-19 13:23:05] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-19 13:23:05] [INFO ] [Real]Absence check using 54 positive place invariants in 25 ms returned sat
[2021-05-19 13:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:23:05] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-19 13:23:05] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-19 13:23:05] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-19 13:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2021-05-19 13:23:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:23:05] [INFO ] [Nat]Absence check using 54 positive place invariants in 25 ms returned sat
[2021-05-19 13:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:23:05] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-19 13:23:05] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2021-05-19 13:23:05] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-19 13:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2021-05-19 13:23:05] [INFO ] Computed and/alt/rep : 104/104/104 causal constraints in 9 ms.
[2021-05-19 13:23:05] [INFO ] Added : 99 causal constraints over 20 iterations in 199 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-19 13:23:05] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-19 13:23:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-19 13:23:06] [INFO ] Flatten gal took : 42 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R100C002 @ 3570 seconds

FORMULA ResAllocation-PT-R100C002-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ResAllocation-PT-R100C002

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:23:06 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18592,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p94) AND (1 <= p97) AND (1 <= p3) AND (1 <= p107) AND (1 <= p108) AND (((1 <= p1) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p100) AND (1 <= p103))))))",
"processed_size": 165,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 420,
"conflict_clusters": 54,
"places": 158,
"places_significant": 104,
"singleton_clusters": 0,
"transitions": 106
},
"result":
{
"edges": 5072,
"markings": 2463,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 264/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 158
lola: finding significant places
lola: 158 places, 106 transitions, 104 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (((1 <= p94) AND (1 <= p97) AND (1 <= p3) AND (1 <= p107) AND (1 <= p108) AND (((1 <= p1) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p100) AND (1 <= p103))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p94) AND (1 <= p97) AND (1 <= p3) AND (1 <= p107) AND (1 <= p108) AND (((1 <= p1) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p100) AND (1 <= p103))))))
lola: processed formula length: 165
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p94) AND (1 <= p97) AND (1 <= p3) AND (1 <= p107) AND (1 <= p108) AND (((1 <= p1) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p100) AND (1 <= p103))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 2 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2463 markings, 5072 edges
lola: memory consumption: 18592 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r189-tajo-162089433000412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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