fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038177100240
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BusinessProcesses-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
259.623 3600000.00 62604.00 53.10 TTTFFTFTTTTFTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 15K 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 192K 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620940442005

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:14:03] [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:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:14:03] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2021-05-13 21:14:03] [INFO ] Transformed 782 places.
[2021-05-13 21:14:03] [INFO ] Transformed 697 transitions.
[2021-05-13 21:14:03] [INFO ] Found NUPN structural information;
[2021-05-13 21:14:03] [INFO ] Parsed PT model containing 782 places and 697 transitions in 155 ms.
Deduced a syphon composed of 63 places in 29 ms
Reduce places removed 63 places and 59 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 58 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 79 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 638 rows 719 cols
[2021-05-13 21:14:04] [INFO ] Computed 121 place invariants in 28 ms
[2021-05-13 21:14:04] [INFO ] [Real]Absence check using 78 positive place invariants in 59 ms returned sat
[2021-05-13 21:14:04] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-13 21:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:05] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2021-05-13 21:14:05] [INFO ] Deduced a trap composed of 12 places in 194 ms
[2021-05-13 21:14:05] [INFO ] Deduced a trap composed of 18 places in 161 ms
[2021-05-13 21:14:05] [INFO ] Deduced a trap composed of 22 places in 217 ms
[2021-05-13 21:14:06] [INFO ] Deduced a trap composed of 28 places in 179 ms
[2021-05-13 21:14:06] [INFO ] Deduced a trap composed of 21 places in 177 ms
[2021-05-13 21:14:06] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2021-05-13 21:14:06] [INFO ] Deduced a trap composed of 21 places in 296 ms
[2021-05-13 21:14:07] [INFO ] Deduced a trap composed of 57 places in 216 ms
[2021-05-13 21:14:07] [INFO ] Deduced a trap composed of 19 places in 234 ms
[2021-05-13 21:14:07] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2021-05-13 21:14:07] [INFO ] Deduced a trap composed of 61 places in 214 ms
[2021-05-13 21:14:08] [INFO ] Deduced a trap composed of 39 places in 223 ms
[2021-05-13 21:14:08] [INFO ] Deduced a trap composed of 58 places in 208 ms
[2021-05-13 21:14:08] [INFO ] Deduced a trap composed of 61 places in 200 ms
[2021-05-13 21:14:08] [INFO ] Deduced a trap composed of 13 places in 203 ms
[2021-05-13 21:14:09] [INFO ] Deduced a trap composed of 56 places in 234 ms
[2021-05-13 21:14:09] [INFO ] Deduced a trap composed of 76 places in 187 ms
[2021-05-13 21:14:09] [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 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s69 s71 s73 s76 s77 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s99 s114 s115 s116 s124 s125 s126 s231 s232 s233 s282 s283 s294 s295 s296 s297 s298 s351 s366 s381 s396 s493 s498 s501 s503 s504 s505 s508 s513 s518 s523 s557 s579 s580 s655 s656 s659 s660 s661 s662 s665 s666 s667 s670 s671 s674 s675 s701) 0)") while checking expression at index 0
[2021-05-13 21:14:09] [INFO ] [Real]Absence check using 78 positive place invariants in 83 ms returned sat
[2021-05-13 21:14:09] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 35 ms returned sat
[2021-05-13 21:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:10] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2021-05-13 21:14:11] [INFO ] Deduced a trap composed of 8 places in 360 ms
[2021-05-13 21:14:11] [INFO ] Deduced a trap composed of 49 places in 321 ms
[2021-05-13 21:14:11] [INFO ] Deduced a trap composed of 16 places in 307 ms
[2021-05-13 21:14:12] [INFO ] Deduced a trap composed of 20 places in 307 ms
[2021-05-13 21:14:12] [INFO ] Deduced a trap composed of 15 places in 308 ms
[2021-05-13 21:14:12] [INFO ] Deduced a trap composed of 21 places in 307 ms
[2021-05-13 21:14:13] [INFO ] Deduced a trap composed of 22 places in 276 ms
[2021-05-13 21:14:13] [INFO ] Deduced a trap composed of 52 places in 253 ms
[2021-05-13 21:14:13] [INFO ] Deduced a trap composed of 156 places in 281 ms
[2021-05-13 21:14:14] [INFO ] Deduced a trap composed of 43 places in 273 ms
[2021-05-13 21:14:14] [INFO ] Deduced a trap composed of 161 places in 210 ms
[2021-05-13 21:14:14] [INFO ] Deduced a trap composed of 153 places in 207 ms
[2021-05-13 21:14:14] [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 s69 s70 s71 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s93 s94 s95 s155 s157 s158 s160 s161 s187 s188 s189 s200 s201 s202 s225 s226 s227 s237 s238 s239 s255 s256 s257 s265 s340 s355 s356 s357 s360 s361 s362 s366 s370 s371 s372 s375 s377 s381 s401 s406 s411 s427 s429 s433 s452 s453 s454 s462 s463 s464 s467 s468 s469 s487 s488 s489 s493 s503 s507 s509 s513 s518 s523 s527 s528 s529 s530 s531 s532 s533 s534 s535 s538 s539 s540 s541 s542 s543 s546 s547 s555 s557 s558 s559 s575 s576 s579 s580 s587 s588 s599 s600 s601 s602 s603 s604 s625 s626 s627 s628 s629 s630 s643 s644 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s665 s666 s667 s670 s671 s672 s673 s674 s675 s680 s681 s684 s695 s701 s710 s711 s712) 0)") while checking expression at index 1
[2021-05-13 21:14:14] [INFO ] [Real]Absence check using 78 positive place invariants in 47 ms returned sat
[2021-05-13 21:14:14] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 23 ms returned sat
[2021-05-13 21:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:15] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2021-05-13 21:14:16] [INFO ] Deduced a trap composed of 12 places in 365 ms
[2021-05-13 21:14:16] [INFO ] Deduced a trap composed of 22 places in 358 ms
[2021-05-13 21:14:16] [INFO ] Deduced a trap composed of 21 places in 337 ms
[2021-05-13 21:14:17] [INFO ] Deduced a trap composed of 120 places in 349 ms
[2021-05-13 21:14:17] [INFO ] Deduced a trap composed of 8 places in 343 ms
[2021-05-13 21:14:17] [INFO ] Deduced a trap composed of 132 places in 344 ms
[2021-05-13 21:14:18] [INFO ] Deduced a trap composed of 17 places in 298 ms
[2021-05-13 21:14:18] [INFO ] Deduced a trap composed of 15 places in 271 ms
[2021-05-13 21:14:18] [INFO ] Deduced a trap composed of 17 places in 260 ms
[2021-05-13 21:14:19] [INFO ] Deduced a trap composed of 25 places in 262 ms
[2021-05-13 21:14:19] [INFO ] Deduced a trap composed of 17 places in 238 ms
[2021-05-13 21:14:19] [INFO ] Deduced a trap composed of 45 places in 332 ms
[2021-05-13 21:14:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s69 s71 s75 s76 s77 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s105 s114 s115 s116 s246 s249 s250 s251 s365 s366 s367 s381 s396 s555 s643 s644 s695) 0)") while checking expression at index 2
[2021-05-13 21:14:19] [INFO ] [Real]Absence check using 78 positive place invariants in 65 ms returned sat
[2021-05-13 21:14:19] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 30 ms returned sat
[2021-05-13 21:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:20] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2021-05-13 21:14:21] [INFO ] Deduced a trap composed of 8 places in 248 ms
[2021-05-13 21:14:21] [INFO ] Deduced a trap composed of 12 places in 236 ms
[2021-05-13 21:14:21] [INFO ] Deduced a trap composed of 16 places in 214 ms
[2021-05-13 21:14:21] [INFO ] Deduced a trap composed of 19 places in 237 ms
[2021-05-13 21:14:22] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2021-05-13 21:14:22] [INFO ] Deduced a trap composed of 35 places in 187 ms
[2021-05-13 21:14:22] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2021-05-13 21:14:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1683 ms
[2021-05-13 21:14:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:14:22] [INFO ] [Nat]Absence check using 78 positive place invariants in 202 ms returned sat
[2021-05-13 21:14:22] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 32 ms returned sat
[2021-05-13 21:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:24] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2021-05-13 21:14:24] [INFO ] Deduced a trap composed of 8 places in 189 ms
[2021-05-13 21:14:24] [INFO ] Deduced a trap composed of 12 places in 196 ms
[2021-05-13 21:14:24] [INFO ] Deduced a trap composed of 16 places in 198 ms
[2021-05-13 21:14:25] [INFO ] Deduced a trap composed of 19 places in 216 ms
[2021-05-13 21:14:25] [INFO ] Deduced a trap composed of 21 places in 173 ms
[2021-05-13 21:14:25] [INFO ] Deduced a trap composed of 35 places in 165 ms
[2021-05-13 21:14:25] [INFO ] Deduced a trap composed of 39 places in 189 ms
[2021-05-13 21:14:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1562 ms
[2021-05-13 21:14:25] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 39 ms.
[2021-05-13 21:14:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t243 0) (and (> t240 0) (< o240 o243)))") while checking expression at index 3
[2021-05-13 21:14:27] [INFO ] [Real]Absence check using 78 positive place invariants in 31 ms returned unsat
[2021-05-13 21:14:28] [INFO ] [Real]Absence check using 78 positive place invariants in 113 ms returned sat
[2021-05-13 21:14:28] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 43 ms returned sat
[2021-05-13 21:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:29] [INFO ] [Real]Absence check using state equation in 1568 ms returned sat
[2021-05-13 21:14:29] [INFO ] Deduced a trap composed of 16 places in 190 ms
[2021-05-13 21:14:30] [INFO ] Deduced a trap composed of 14 places in 183 ms
[2021-05-13 21:14:30] [INFO ] Deduced a trap composed of 18 places in 165 ms
[2021-05-13 21:14:30] [INFO ] Deduced a trap composed of 33 places in 194 ms
[2021-05-13 21:14:30] [INFO ] Deduced a trap composed of 27 places in 156 ms
[2021-05-13 21:14:30] [INFO ] Deduced a trap composed of 47 places in 166 ms
[2021-05-13 21:14:31] [INFO ] Deduced a trap composed of 44 places in 173 ms
[2021-05-13 21:14:31] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2021-05-13 21:14:31] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2021-05-13 21:14:31] [INFO ] Deduced a trap composed of 60 places in 216 ms
[2021-05-13 21:14:32] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2021-05-13 21:14:32] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2021-05-13 21:14:32] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2021-05-13 21:14:32] [INFO ] Deduced a trap composed of 53 places in 161 ms
[2021-05-13 21:14:32] [INFO ] Deduced a trap composed of 32 places in 72 ms
[2021-05-13 21:14:32] [INFO ] Deduced a trap composed of 28 places in 116 ms
[2021-05-13 21:14:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s437 s438 s439 s441 s443 s444 s445 s603 s604) 0)") while checking expression at index 5
[2021-05-13 21:14:32] [INFO ] [Real]Absence check using 78 positive place invariants in 46 ms returned sat
[2021-05-13 21:14:32] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2021-05-13 21:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:34] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2021-05-13 21:14:34] [INFO ] Deduced a trap composed of 20 places in 314 ms
[2021-05-13 21:14:34] [INFO ] Deduced a trap composed of 12 places in 280 ms
[2021-05-13 21:14:35] [INFO ] Deduced a trap composed of 21 places in 264 ms
[2021-05-13 21:14:35] [INFO ] Deduced a trap composed of 158 places in 220 ms
[2021-05-13 21:14:35] [INFO ] Deduced a trap composed of 140 places in 301 ms
[2021-05-13 21:14:35] [INFO ] Deduced a trap composed of 57 places in 280 ms
[2021-05-13 21:14:36] [INFO ] Deduced a trap composed of 28 places in 264 ms
[2021-05-13 21:14:36] [INFO ] Deduced a trap composed of 17 places in 316 ms
[2021-05-13 21:14:36] [INFO ] Deduced a trap composed of 21 places in 255 ms
[2021-05-13 21:14:37] [INFO ] Deduced a trap composed of 128 places in 275 ms
[2021-05-13 21:14:37] [INFO ] Deduced a trap composed of 130 places in 308 ms
[2021-05-13 21:14:37] [INFO ] Deduced a trap composed of 18 places in 260 ms
[2021-05-13 21:14:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 21:14:38] [INFO ] Deduced a trap composed of 6 places in 496 ms
[2021-05-13 21:14:38] [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 s285) 0)") while checking expression at index 6
[2021-05-13 21:14:38] [INFO ] [Real]Absence check using 78 positive place invariants in 126 ms returned sat
[2021-05-13 21:14:38] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 28 ms returned sat
[2021-05-13 21:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:39] [INFO ] [Real]Absence check using state equation in 1394 ms returned sat
[2021-05-13 21:14:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:14:40] [INFO ] [Nat]Absence check using 78 positive place invariants in 118 ms returned sat
[2021-05-13 21:14:40] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 41 ms returned sat
[2021-05-13 21:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:14:41] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2021-05-13 21:14:42] [INFO ] Deduced a trap composed of 28 places in 233 ms
[2021-05-13 21:14:42] [INFO ] Deduced a trap composed of 8 places in 202 ms
[2021-05-13 21:14:42] [INFO ] Deduced a trap composed of 17 places in 218 ms
[2021-05-13 21:14:42] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2021-05-13 21:14:42] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2021-05-13 21:14:43] [INFO ] Deduced a trap composed of 16 places in 194 ms
[2021-05-13 21:14:43] [INFO ] Deduced a trap composed of 25 places in 291 ms
[2021-05-13 21:14:43] [INFO ] Deduced a trap composed of 29 places in 200 ms
[2021-05-13 21:14:43] [INFO ] Deduced a trap composed of 45 places in 215 ms
[2021-05-13 21:14:44] [INFO ] Deduced a trap composed of 21 places in 232 ms
[2021-05-13 21:14:44] [INFO ] Deduced a trap composed of 22 places in 233 ms
[2021-05-13 21:14:44] [INFO ] Deduced a trap composed of 25 places in 173 ms
[2021-05-13 21:14:44] [INFO ] Deduced a trap composed of 47 places in 210 ms
[2021-05-13 21:14:45] [INFO ] Deduced a trap composed of 43 places in 188 ms
[2021-05-13 21:14:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s171 s172 s173 s176 s177 s178 s294 s295 s296 s297 s298 s299 s300 s301 s437 s438 s439 s443 s453 s458 s463 s473 s478 s482 s483 s484 s486 s488 s489 s490 s610 s611 s612 s613 s616 s621 s622 s629 s630 s635 s636) 0)") while checking expression at index 7
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 34 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Discarding 25 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (complete) has 1418 edges and 719 vertex of which 694 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.15 ms
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 694 transition count 515
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 225 place count 582 transition count 515
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 142 Pre rules applied. Total rules applied 225 place count 582 transition count 373
Deduced a syphon composed of 142 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 529 place count 420 transition count 373
Symmetric choice reduction at 2 with 80 rule applications. Total rules 609 place count 420 transition count 373
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 80 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 769 place count 340 transition count 293
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 769 place count 340 transition count 287
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 782 place count 333 transition count 287
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 986 place count 231 transition count 185
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 2 with 2 rules applied. Total rules applied 988 place count 230 transition count 188
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 992 place count 230 transition count 188
Applied a total of 992 rules in 211 ms. Remains 230 /719 variables (removed 489) and now considering 188/638 (removed 450) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/719 places, 188/638 transitions.
Finished random walk after 281810 steps, including 7858 resets, run visited all 7 properties in 790 ms. (steps per millisecond=356 )
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-00 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-20"
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-20, 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-162038177100240"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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