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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
270.000 3600000.00 51623.00 118.90 TTFFFFFTTTFTTFTT 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-162038177000192.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-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1620936743705

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:12:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:12:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:12:26] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-13 20:12:26] [INFO ] Transformed 393 places.
[2021-05-13 20:12:26] [INFO ] Transformed 344 transitions.
[2021-05-13 20:12:26] [INFO ] Found NUPN structural information;
[2021-05-13 20:12:26] [INFO ] Parsed PT model containing 393 places and 344 transitions in 169 ms.
Deduced a syphon composed of 13 places in 11 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 101 ms. (steps per millisecond=99 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 331 rows 380 cols
[2021-05-13 20:12:26] [INFO ] Computed 58 place invariants in 43 ms
[2021-05-13 20:12:26] [INFO ] [Real]Absence check using 44 positive place invariants in 74 ms returned sat
[2021-05-13 20:12:26] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 15 ms returned sat
[2021-05-13 20:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:27] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2021-05-13 20:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:12:27] [INFO ] [Nat]Absence check using 44 positive place invariants in 68 ms returned sat
[2021-05-13 20:12:27] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 10 ms returned sat
[2021-05-13 20:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:28] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2021-05-13 20:12:28] [INFO ] Deduced a trap composed of 11 places in 275 ms
[2021-05-13 20:12:29] [INFO ] Deduced a trap composed of 14 places in 367 ms
[2021-05-13 20:12:29] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2021-05-13 20:12:29] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2021-05-13 20:12:29] [INFO ] Deduced a trap composed of 16 places in 130 ms
[2021-05-13 20:12:29] [INFO ] Deduced a trap composed of 33 places in 256 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 22 places in 32 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 34 places in 110 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 34 places in 63 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 38 places in 60 ms
[2021-05-13 20:12:30] [INFO ] Deduced a trap composed of 38 places in 59 ms
[2021-05-13 20:12:30] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2409 ms
[2021-05-13 20:12:30] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 17 ms.
[2021-05-13 20:12:32] [INFO ] Added : 245 causal constraints over 49 iterations in 1318 ms. Result :sat
[2021-05-13 20:12:32] [INFO ] Deduced a trap composed of 40 places in 100 ms
[2021-05-13 20:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-13 20:12:32] [INFO ] [Real]Absence check using 44 positive place invariants in 58 ms returned sat
[2021-05-13 20:12:32] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2021-05-13 20:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:33] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2021-05-13 20:12:33] [INFO ] Deduced a trap composed of 8 places in 544 ms
[2021-05-13 20:12:33] [INFO ] Deduced a trap composed of 13 places in 119 ms
[2021-05-13 20:12:33] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 14 places in 181 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 94 places in 130 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 24 places in 125 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 11 places in 119 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 22 places in 65 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 17 places in 60 ms
[2021-05-13 20:12:34] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2021-05-13 20:12:35] [INFO ] Deduced a trap composed of 25 places in 112 ms
[2021-05-13 20:12:35] [INFO ] Deduced a trap composed of 24 places in 148 ms
[2021-05-13 20:12:35] [INFO ] Deduced a trap composed of 25 places in 151 ms
[2021-05-13 20:12:35] [INFO ] Deduced a trap composed of 37 places in 153 ms
[2021-05-13 20:12:36] [INFO ] Deduced a trap composed of 24 places in 1327 ms
[2021-05-13 20:12:37] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2021-05-13 20:12:37] [INFO ] Deduced a trap composed of 32 places in 81 ms
[2021-05-13 20:12:37] [INFO ] Deduced a trap composed of 24 places in 53 ms
[2021-05-13 20:12:37] [INFO ] Deduced a trap composed of 24 places in 389 ms
[2021-05-13 20:12:37] [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 s73 s74 s75 s76 s77 s105 s233 s234 s235 s244 s341 s342 s363 s364) 0)") while checking expression at index 1
[2021-05-13 20:12:37] [INFO ] [Real]Absence check using 44 positive place invariants in 80 ms returned sat
[2021-05-13 20:12:37] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 16 ms returned sat
[2021-05-13 20:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:38] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2021-05-13 20:12:38] [INFO ] Deduced a trap composed of 18 places in 486 ms
[2021-05-13 20:12:39] [INFO ] Deduced a trap composed of 19 places in 313 ms
[2021-05-13 20:12:39] [INFO ] Deduced a trap composed of 8 places in 304 ms
[2021-05-13 20:12:39] [INFO ] Deduced a trap composed of 11 places in 218 ms
[2021-05-13 20:12:39] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2021-05-13 20:12:40] [INFO ] Deduced a trap composed of 22 places in 158 ms
[2021-05-13 20:12:40] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2021-05-13 20:12:40] [INFO ] Deduced a trap composed of 28 places in 164 ms
[2021-05-13 20:12:40] [INFO ] Deduced a trap composed of 36 places in 85 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 13 places in 684 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 41 places in 89 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 15 places in 86 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 27 places in 106 ms
[2021-05-13 20:12:41] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 19 places in 93 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 31 places in 100 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 40 places in 83 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 27 places in 106 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 27 places in 98 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 36 places in 77 ms
[2021-05-13 20:12:42] [INFO ] Deduced a trap composed of 30 places in 103 ms
[2021-05-13 20:12:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s41 s42 s43 s44 s45 s46 s82 s83 s84 s89 s90 s91 s92 s188 s189 s190 s199) 0)") while checking expression at index 2
[2021-05-13 20:12:42] [INFO ] [Real]Absence check using 44 positive place invariants in 53 ms returned sat
[2021-05-13 20:12:42] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2021-05-13 20:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:43] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2021-05-13 20:12:43] [INFO ] Deduced a trap composed of 8 places in 159 ms
[2021-05-13 20:12:43] [INFO ] Deduced a trap composed of 12 places in 282 ms
[2021-05-13 20:12:43] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 15 places in 108 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 94 places in 84 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 23 places in 94 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 31 places in 72 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 95 places in 70 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 92 places in 70 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 50 places in 62 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 41 places in 54 ms
[2021-05-13 20:12:44] [INFO ] Deduced a trap composed of 38 places in 150 ms
[2021-05-13 20:12:45] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2021-05-13 20:12:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1702 ms
[2021-05-13 20:12:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:12:45] [INFO ] [Nat]Absence check using 44 positive place invariants in 49 ms returned sat
[2021-05-13 20:12:45] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2021-05-13 20:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:45] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2021-05-13 20:12:45] [INFO ] Deduced a trap composed of 8 places in 180 ms
[2021-05-13 20:12:45] [INFO ] Deduced a trap composed of 33 places in 116 ms
[2021-05-13 20:12:45] [INFO ] Deduced a trap composed of 17 places in 115 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 87 places in 90 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 23 places in 82 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 13 places in 85 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 24 places in 111 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 13 places in 87 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 24 places in 82 ms
[2021-05-13 20:12:46] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 27 places in 86 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 33 places in 104 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 34 places in 81 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 33 places in 134 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 92 places in 81 ms
[2021-05-13 20:12:47] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 90 places in 96 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 95 places in 77 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 95 places in 99 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 96 places in 101 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 94 places in 98 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 92 places in 97 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 91 places in 97 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 85 places in 75 ms
[2021-05-13 20:12:48] [INFO ] Deduced a trap composed of 88 places in 77 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 92 places in 86 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 94 places in 77 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 91 places in 78 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 93 places in 85 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 93 places in 74 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 94 places in 72 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 95 places in 109 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 92 places in 93 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 89 places in 112 ms
[2021-05-13 20:12:49] [INFO ] Deduced a trap composed of 94 places in 76 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 90 places in 82 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 90 places in 81 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2021-05-13 20:12:50] [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 s120 s121 s122 s137 s138 s267 s270 s271 s273 s274 s275) 0)") while checking expression at index 3
[2021-05-13 20:12:50] [INFO ] [Real]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-13 20:12:50] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-13 20:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:50] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 13 places in 58 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 12 places in 60 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 24 places in 35 ms
[2021-05-13 20:12:50] [INFO ] Deduced a trap composed of 28 places in 35 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 37 places in 35 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 41 places in 31 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 34 places in 25 ms
[2021-05-13 20:12:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 508 ms
[2021-05-13 20:12:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:12:51] [INFO ] [Nat]Absence check using 44 positive place invariants in 30 ms returned sat
[2021-05-13 20:12:51] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-13 20:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:51] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 14 places in 49 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 16 places in 35 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 28 places in 33 ms
[2021-05-13 20:12:51] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-13 20:12:52] [INFO ] Deduced a trap composed of 31 places in 32 ms
[2021-05-13 20:12:52] [INFO ] Deduced a trap composed of 40 places in 31 ms
[2021-05-13 20:12:52] [INFO ] Deduced a trap composed of 33 places in 25 ms
[2021-05-13 20:12:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 632 ms
[2021-05-13 20:12:52] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 18 ms.
[2021-05-13 20:12:52] [INFO ] Added : 234 causal constraints over 47 iterations in 812 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2021-05-13 20:12:53] [INFO ] [Real]Absence check using 44 positive place invariants in 23 ms returned sat
[2021-05-13 20:12:53] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned unsat
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 14200 steps, including 105 resets, run finished after 31 ms. (steps per millisecond=458 ) properties seen :[0, 0, 0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 23000 steps, including 157 resets, run finished after 39 ms. (steps per millisecond=589 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 232 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 11 ms
Free SCC test removed 7 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.16 ms
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 364 transition count 223
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 205 place count 268 transition count 223
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 205 place count 268 transition count 179
Deduced a syphon composed of 44 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 304 place count 213 transition count 179
Symmetric choice reduction at 2 with 59 rule applications. Total rules 363 place count 213 transition count 179
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 59 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 481 place count 154 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 481 place count 154 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 491 place count 148 transition count 116
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 605 place count 91 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 606 place count 90 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 607 place count 89 transition count 58
Applied a total of 607 rules in 100 ms. Remains 89 /380 variables (removed 291) and now considering 58/331 (removed 273) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/380 places, 58/331 transitions.
Finished random walk after 559363 steps, including 22022 resets, run visited all 2 properties in 1088 ms. (steps per millisecond=514 )
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-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-08"
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-08, 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-162038177000192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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