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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 177K 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-18-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620939835591

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:03:57] [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 21:03:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:03:57] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-13 21:03:57] [INFO ] Transformed 717 places.
[2021-05-13 21:03:57] [INFO ] Transformed 642 transitions.
[2021-05-13 21:03:57] [INFO ] Found NUPN structural information;
[2021-05-13 21:03:57] [INFO ] Parsed PT model containing 717 places and 642 transitions in 118 ms.
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 51 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[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 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 627 rows 702 cols
[2021-05-13 21:03:57] [INFO ] Computed 114 place invariants in 50 ms
[2021-05-13 21:03:57] [INFO ] [Real]Absence check using 73 positive place invariants in 67 ms returned sat
[2021-05-13 21:03:57] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 26 ms returned sat
[2021-05-13 21:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:58] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2021-05-13 21:03:59] [INFO ] Deduced a trap composed of 8 places in 280 ms
[2021-05-13 21:03:59] [INFO ] Deduced a trap composed of 8 places in 208 ms
[2021-05-13 21:03:59] [INFO ] Deduced a trap composed of 144 places in 216 ms
[2021-05-13 21:03:59] [INFO ] Deduced a trap composed of 22 places in 235 ms
[2021-05-13 21:04:00] [INFO ] Deduced a trap composed of 146 places in 271 ms
[2021-05-13 21:04:00] [INFO ] Deduced a trap composed of 13 places in 231 ms
[2021-05-13 21:04:00] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2021-05-13 21:04:00] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2021-05-13 21:04:01] [INFO ] Deduced a trap composed of 143 places in 284 ms
[2021-05-13 21:04:01] [INFO ] Deduced a trap composed of 138 places in 338 ms
[2021-05-13 21:04:02] [INFO ] Deduced a trap composed of 14 places in 316 ms
[2021-05-13 21:04:02] [INFO ] Deduced a trap composed of 140 places in 349 ms
[2021-05-13 21:04:02] [INFO ] Deduced a trap composed of 21 places in 282 ms
[2021-05-13 21:04:02] [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 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s431 s432 s433 s455 s457 s458 s459 s632 s633) 0)") while checking expression at index 0
[2021-05-13 21:04:02] [INFO ] [Real]Absence check using 73 positive place invariants in 69 ms returned sat
[2021-05-13 21:04:02] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 4 ms returned unsat
[2021-05-13 21:04:03] [INFO ] [Real]Absence check using 73 positive place invariants in 69 ms returned sat
[2021-05-13 21:04:03] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 38 ms returned sat
[2021-05-13 21:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:04] [INFO ] [Real]Absence check using state equation in 1405 ms returned sat
[2021-05-13 21:04:04] [INFO ] Deduced a trap composed of 16 places in 221 ms
[2021-05-13 21:04:05] [INFO ] Deduced a trap composed of 12 places in 229 ms
[2021-05-13 21:04:05] [INFO ] Deduced a trap composed of 8 places in 205 ms
[2021-05-13 21:04:05] [INFO ] Deduced a trap composed of 26 places in 201 ms
[2021-05-13 21:04:05] [INFO ] Deduced a trap composed of 15 places in 221 ms
[2021-05-13 21:04:06] [INFO ] Deduced a trap composed of 22 places in 186 ms
[2021-05-13 21:04:06] [INFO ] Deduced a trap composed of 17 places in 213 ms
[2021-05-13 21:04:06] [INFO ] Deduced a trap composed of 29 places in 195 ms
[2021-05-13 21:04:06] [INFO ] Deduced a trap composed of 32 places in 220 ms
[2021-05-13 21:04:07] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2021-05-13 21:04:07] [INFO ] Deduced a trap composed of 24 places in 231 ms
[2021-05-13 21:04:07] [INFO ] Deduced a trap composed of 22 places in 192 ms
[2021-05-13 21:04:07] [INFO ] Deduced a trap composed of 35 places in 201 ms
[2021-05-13 21:04:08] [INFO ] Deduced a trap composed of 34 places in 215 ms
[2021-05-13 21:04:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s40 s41 s45 s46 s47 s246 s247 s250 s251 s257 s258 s278 s281 s320 s325 s330 s335 s476 s477 s478 s482 s487 s492 s497 s502 s648 s649 s665 s666 s669 s670) 0)") while checking expression at index 2
[2021-05-13 21:04:08] [INFO ] [Real]Absence check using 73 positive place invariants in 146 ms returned sat
[2021-05-13 21:04:08] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 73 ms returned sat
[2021-05-13 21:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:09] [INFO ] [Real]Absence check using state equation in 1539 ms returned sat
[2021-05-13 21:04:10] [INFO ] Deduced a trap composed of 130 places in 301 ms
[2021-05-13 21:04:10] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2021-05-13 21:04:10] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2021-05-13 21:04:10] [INFO ] Deduced a trap composed of 14 places in 208 ms
[2021-05-13 21:04:11] [INFO ] Deduced a trap composed of 13 places in 274 ms
[2021-05-13 21:04:11] [INFO ] Deduced a trap composed of 24 places in 285 ms
[2021-05-13 21:04:11] [INFO ] Deduced a trap composed of 28 places in 276 ms
[2021-05-13 21:04:12] [INFO ] Deduced a trap composed of 130 places in 303 ms
[2021-05-13 21:04:12] [INFO ] Deduced a trap composed of 144 places in 300 ms
[2021-05-13 21:04:12] [INFO ] Deduced a trap composed of 33 places in 289 ms
[2021-05-13 21:04:13] [INFO ] Deduced a trap composed of 135 places in 280 ms
[2021-05-13 21:04:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s40 s41 s66 s67 s83 s84 s85 s183 s184 s185 s200 s201 s204 s205 s236 s237 s238 s242 s243 s244 s246 s247 s250 s251 s259 s325 s335 s339 s348 s352 s361 s362 s363 s366 s367 s368 s372 s382 s387 s392 s396 s397 s398 s402 s416 s418 s426 s427 s428 s437 s456 s458 s461 s462 s463 s482 s487 s492 s502 s506 s507 s508 s509 s510 s513 s514 s515 s516 s519 s520 s525 s526 s527 s528 s533 s534 s547 s548 s549 s550 s551 s552 s557 s558 s559 s560 s567 s568 s571 s572 s575 s576 s596 s597 s598 s599 s608 s609 s612 s613 s614 s617 s618 s622 s623 s626 s627 s628 s629 s638 s639 s640 s641 s642 s643 s646 s647 s657 s658 s661 s662 s665 s666 s669 s670 s673) 0)") while checking expression at index 3
[2021-05-13 21:04:13] [INFO ] [Real]Absence check using 73 positive place invariants in 66 ms returned sat
[2021-05-13 21:04:13] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 30 ms returned sat
[2021-05-13 21:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:14] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2021-05-13 21:04:14] [INFO ] Deduced a trap composed of 8 places in 326 ms
[2021-05-13 21:04:15] [INFO ] Deduced a trap composed of 16 places in 339 ms
[2021-05-13 21:04:15] [INFO ] Deduced a trap composed of 16 places in 323 ms
[2021-05-13 21:04:16] [INFO ] Deduced a trap composed of 129 places in 304 ms
[2021-05-13 21:04:16] [INFO ] Deduced a trap composed of 21 places in 285 ms
[2021-05-13 21:04:16] [INFO ] Deduced a trap composed of 16 places in 258 ms
[2021-05-13 21:04:16] [INFO ] Deduced a trap composed of 18 places in 249 ms
[2021-05-13 21:04:17] [INFO ] Deduced a trap composed of 21 places in 262 ms
[2021-05-13 21:04:17] [INFO ] Deduced a trap composed of 25 places in 247 ms
[2021-05-13 21:04:17] [INFO ] Deduced a trap composed of 17 places in 208 ms
[2021-05-13 21:04:18] [INFO ] Deduced a trap composed of 21 places in 299 ms
[2021-05-13 21:04:18] [INFO ] Deduced a trap composed of 34 places in 339 ms
[2021-05-13 21:04:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s35 s36 s37 s262 s263 s264 s278 s281 s325 s330 s335 s481 s482 s483 s487 s492 s497 s502 s523 s524 s527 s528 s650 s651 s654 s655 s656 s661 s662 s669 s670) 0)") while checking expression at index 4
[2021-05-13 21:04:18] [INFO ] [Real]Absence check using 73 positive place invariants in 22 ms returned unsat
[2021-05-13 21:04:18] [INFO ] [Real]Absence check using 73 positive place invariants in 88 ms returned sat
[2021-05-13 21:04:18] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 29 ms returned sat
[2021-05-13 21:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:19] [INFO ] [Real]Absence check using state equation in 938 ms returned unsat
[2021-05-13 21:04:19] [INFO ] [Real]Absence check using 73 positive place invariants in 44 ms returned unsat
[2021-05-13 21:04:20] [INFO ] [Real]Absence check using 73 positive place invariants in 43 ms returned sat
[2021-05-13 21:04:20] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 20 ms returned sat
[2021-05-13 21:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:21] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2021-05-13 21:04:21] [INFO ] Deduced a trap composed of 15 places in 339 ms
[2021-05-13 21:04:21] [INFO ] Deduced a trap composed of 8 places in 324 ms
[2021-05-13 21:04:22] [INFO ] Deduced a trap composed of 25 places in 366 ms
[2021-05-13 21:04:22] [INFO ] Deduced a trap composed of 24 places in 303 ms
[2021-05-13 21:04:23] [INFO ] Deduced a trap composed of 25 places in 292 ms
[2021-05-13 21:04:23] [INFO ] Deduced a trap composed of 14 places in 305 ms
[2021-05-13 21:04:23] [INFO ] Deduced a trap composed of 26 places in 324 ms
[2021-05-13 21:04:24] [INFO ] Deduced a trap composed of 20 places in 313 ms
[2021-05-13 21:04:24] [INFO ] Deduced a trap composed of 28 places in 274 ms
[2021-05-13 21:04:24] [INFO ] Deduced a trap composed of 24 places in 282 ms
[2021-05-13 21:04:24] [INFO ] Deduced a trap composed of 48 places in 296 ms
[2021-05-13 21:04:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s183 s184 s185 s213 s214 s230 s231 s232 s250 s251 s265 s268 s269 s270 s436 s437 s438 s442 s446 s447 s448 s452 s456 s457 s458 s462 s467 s472 s477 s482 s492 s619 s620 s621 s636 s637 s644 s645 s648 s649) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 38 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 693 transition count 516
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 583 transition count 516
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 221 place count 583 transition count 380
Deduced a syphon composed of 136 places in 3 ms
Ensure Unique test removed 18 places
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 290 rules applied. Total rules applied 511 place count 429 transition count 380
Symmetric choice reduction at 2 with 90 rule applications. Total rules 601 place count 429 transition count 380
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 90 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 781 place count 339 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 783 place count 339 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 784 place count 338 transition count 288
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 784 place count 338 transition count 283
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 796 place count 331 transition count 283
Symmetric choice reduction at 4 with 1 rule applications. Total rules 797 place count 331 transition count 283
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 799 place count 330 transition count 282
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 997 place count 231 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 998 place count 231 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1000 place count 230 transition count 185
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1004 place count 230 transition count 185
Applied a total of 1004 rules in 176 ms. Remains 230 /702 variables (removed 472) and now considering 185/627 (removed 442) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/702 places, 185/627 transitions.
Incomplete random walk after 1000000 steps, including 40158 resets, run finished after 2931 ms. (steps per millisecond=341 ) properties seen :[1, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9429 resets, run finished after 1375 ms. (steps per millisecond=727 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7665 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9080 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties seen :[0, 0, 0]
// Phase 1: matrix 185 rows 230 cols
[2021-05-13 21:04:31] [INFO ] Computed 86 place invariants in 4 ms
[2021-05-13 21:04:32] [INFO ] [Real]Absence check using 65 positive place invariants in 43 ms returned sat
[2021-05-13 21:04:32] [INFO ] [Real]Absence check using 65 positive and 21 generalized place invariants in 17 ms returned sat
[2021-05-13 21:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:32] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-13 21:04:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 21:04:32] [INFO ] [Real]Added 4 Read/Feed constraints in 25 ms returned sat
[2021-05-13 21:04:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:04:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 64 ms returned sat
[2021-05-13 21:04:32] [INFO ] [Nat]Absence check using 65 positive and 21 generalized place invariants in 37 ms returned sat
[2021-05-13 21:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:32] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2021-05-13 21:04:32] [INFO ] [Nat]Added 4 Read/Feed constraints in 24 ms returned sat
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 50 places in 104 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 50 places in 70 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 50 places in 76 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 48 places in 66 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 55 places in 88 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 50 places in 91 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 52 places in 67 ms
[2021-05-13 21:04:33] [INFO ] Deduced a trap composed of 57 places in 97 ms
[2021-05-13 21:04:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 927 ms
[2021-05-13 21:04:33] [INFO ] Computed and/alt/rep : 183/862/183 causal constraints in 22 ms.
[2021-05-13 21:04:34] [INFO ] Added : 83 causal constraints over 17 iterations in 888 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2021-05-13 21:04:34] [INFO ] [Real]Absence check using 65 positive place invariants in 45 ms returned sat
[2021-05-13 21:04:35] [INFO ] [Real]Absence check using 65 positive and 21 generalized place invariants in 27 ms returned sat
[2021-05-13 21:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:35] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2021-05-13 21:04:35] [INFO ] [Real]Added 4 Read/Feed constraints in 5 ms returned sat
[2021-05-13 21:04:35] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2021-05-13 21:04:35] [INFO ] Deduced a trap composed of 11 places in 34 ms
[2021-05-13 21:04:35] [INFO ] Deduced a trap composed of 12 places in 21 ms
[2021-05-13 21:04:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 139 ms
[2021-05-13 21:04:35] [INFO ] [Real]Absence check using 65 positive place invariants in 34 ms returned sat
[2021-05-13 21:04:35] [INFO ] [Real]Absence check using 65 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-13 21:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:35] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-13 21:04:35] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:04:35] [INFO ] Deduced a trap composed of 51 places in 87 ms
[2021-05-13 21:04:35] [INFO ] Deduced a trap composed of 54 places in 104 ms
[2021-05-13 21:04:36] [INFO ] Deduced a trap composed of 51 places in 79 ms
[2021-05-13 21:04:36] [INFO ] Deduced a trap composed of 52 places in 61 ms
[2021-05-13 21:04:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 387 ms
[2021-05-13 21:04:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:04:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-13 21:04:36] [INFO ] [Nat]Absence check using 65 positive and 21 generalized place invariants in 20 ms returned sat
[2021-05-13 21:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:04:36] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2021-05-13 21:04:36] [INFO ] [Nat]Added 4 Read/Feed constraints in 66 ms returned sat
[2021-05-13 21:04:36] [INFO ] Deduced a trap composed of 50 places in 99 ms
[2021-05-13 21:04:36] [INFO ] Deduced a trap composed of 47 places in 64 ms
[2021-05-13 21:04:36] [INFO ] Deduced a trap composed of 49 places in 59 ms
[2021-05-13 21:04:36] [INFO ] Deduced a trap composed of 52 places in 59 ms
[2021-05-13 21:04:37] [INFO ] Deduced a trap composed of 6 places in 52 ms
[2021-05-13 21:04:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 515 ms
[2021-05-13 21:04:37] [INFO ] Computed and/alt/rep : 183/862/183 causal constraints in 19 ms.
[2021-05-13 21:04:37] [INFO ] Added : 92 causal constraints over 19 iterations in 614 ms. Result :sat
[2021-05-13 21:04:37] [INFO ] Deduced a trap composed of 51 places in 88 ms
[2021-05-13 21:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 12000 steps, including 520 resets, run finished after 64 ms. (steps per millisecond=187 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 433 resets, run finished after 42 ms. (steps per millisecond=273 ) properties seen :[1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 185/185 transitions.
Graph (trivial) has 30 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 10 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 229 transition count 177
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 223 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 15 place count 223 transition count 167
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 41 place count 207 transition count 167
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 86 place count 184 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 184 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 183 transition count 144
Applied a total of 88 rules in 70 ms. Remains 183 /230 variables (removed 47) and now considering 144/185 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/230 places, 144/185 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-06 TRUE 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-18"
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-18, 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-162038177100232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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