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-162038177000191.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000191
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620936695777

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:11:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:11:38] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-13 20:11:38] [INFO ] Transformed 393 places.
[2021-05-13 20:11:38] [INFO ] Transformed 344 transitions.
[2021-05-13 20:11:38] [INFO ] Found NUPN structural information;
[2021-05-13 20:11:38] [INFO ] Parsed PT model containing 393 places and 344 transitions in 110 ms.
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 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 16 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 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 331 rows 380 cols
[2021-05-13 20:11:38] [INFO ] Computed 58 place invariants in 13 ms
[2021-05-13 20:11:38] [INFO ] [Real]Absence check using 44 positive place invariants in 34 ms returned sat
[2021-05-13 20:11:38] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-13 20:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:38] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2021-05-13 20:11:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:39] [INFO ] [Nat]Absence check using 44 positive place invariants in 67 ms returned sat
[2021-05-13 20:11:39] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-13 20:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:39] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2021-05-13 20:11:39] [INFO ] Deduced a trap composed of 18 places in 244 ms
[2021-05-13 20:11:39] [INFO ] Deduced a trap composed of 13 places in 150 ms
[2021-05-13 20:11:40] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2021-05-13 20:11:40] [INFO ] Deduced a trap composed of 11 places in 119 ms
[2021-05-13 20:11:40] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2021-05-13 20:11:40] [INFO ] Deduced a trap composed of 98 places in 139 ms
[2021-05-13 20:11:40] [INFO ] Deduced a trap composed of 101 places in 116 ms
[2021-05-13 20:11:40] [INFO ] Deduced a trap composed of 97 places in 278 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 32 places in 134 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 95 places in 122 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 26 places in 151 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 34 places in 140 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 32 places in 114 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 34 places in 117 ms
[2021-05-13 20:11:41] [INFO ] Deduced a trap composed of 105 places in 137 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 29 places in 116 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 104 places in 114 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 25 places in 92 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 31 places in 126 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 88 places in 90 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 20 places in 130 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 28 places in 96 ms
[2021-05-13 20:11:42] [INFO ] Deduced a trap composed of 35 places in 144 ms
[2021-05-13 20:11:43] [INFO ] Deduced a trap composed of 34 places in 103 ms
[2021-05-13 20:11:43] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3703 ms
[2021-05-13 20:11:43] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 25 ms.
[2021-05-13 20:11:43] [INFO ] Added : 135 causal constraints over 27 iterations in 834 ms. Result :sat
[2021-05-13 20:11:47] [INFO ] Deduced a trap composed of 13 places in 3188 ms
[2021-05-13 20:11:47] [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 0
[2021-05-13 20:11:47] [INFO ] [Real]Absence check using 44 positive place invariants in 30 ms returned sat
[2021-05-13 20:11:47] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2021-05-13 20:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:47] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-13 20:11:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:48] [INFO ] [Nat]Absence check using 44 positive place invariants in 192 ms returned sat
[2021-05-13 20:11:48] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 53 ms returned sat
[2021-05-13 20:11:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:48] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2021-05-13 20:11:48] [INFO ] Deduced a trap composed of 13 places in 213 ms
[2021-05-13 20:11:48] [INFO ] Deduced a trap composed of 28 places in 170 ms
[2021-05-13 20:11:49] [INFO ] Deduced a trap composed of 12 places in 195 ms
[2021-05-13 20:11:49] [INFO ] Deduced a trap composed of 79 places in 157 ms
[2021-05-13 20:11:49] [INFO ] Deduced a trap composed of 8 places in 148 ms
[2021-05-13 20:11:49] [INFO ] Deduced a trap composed of 14 places in 145 ms
[2021-05-13 20:11:49] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2021-05-13 20:11:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1295 ms
[2021-05-13 20:11:49] [INFO ] [Real]Absence check using 44 positive place invariants in 30 ms returned sat
[2021-05-13 20:11:49] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2021-05-13 20:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:50] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2021-05-13 20:11:50] [INFO ] Deduced a trap composed of 13 places in 235 ms
[2021-05-13 20:11:50] [INFO ] Deduced a trap composed of 19 places in 211 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 17 places in 208 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 87 places in 154 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 50 places in 88 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 74 places in 72 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 49 places in 82 ms
[2021-05-13 20:11:51] [INFO ] Deduced a trap composed of 96 places in 150 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 93 places in 123 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 72 places in 76 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 91 places in 108 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 56 places in 82 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 38 places in 78 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 72 places in 71 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 34 places in 84 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2021-05-13 20:11:52] [INFO ] Deduced a trap composed of 45 places in 73 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 45 places in 80 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 49 places in 75 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 29 places in 111 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 95 places in 122 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 93 places in 109 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 29 places in 94 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 96 places in 111 ms
[2021-05-13 20:11:53] [INFO ] Deduced a trap composed of 26 places in 109 ms
[2021-05-13 20:11:54] [INFO ] Deduced a trap composed of 97 places in 112 ms
[2021-05-13 20:11:54] [INFO ] Deduced a trap composed of 99 places in 109 ms
[2021-05-13 20:11:54] [INFO ] Deduced a trap composed of 48 places in 100 ms
[2021-05-13 20:11:54] [INFO ] Deduced a trap composed of 59 places in 67 ms
[2021-05-13 20:11:54] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4135 ms
[2021-05-13 20:11:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:54] [INFO ] [Nat]Absence check using 44 positive place invariants in 51 ms returned sat
[2021-05-13 20:11:54] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 96 ms returned sat
[2021-05-13 20:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:55] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2021-05-13 20:11:55] [INFO ] Deduced a trap composed of 17 places in 167 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 14 places in 135 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 12 places in 151 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 93 places in 132 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2021-05-13 20:11:56] [INFO ] Deduced a trap composed of 16 places in 69 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 17 places in 119 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 28 places in 102 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 29 places in 94 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 47 places in 79 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 52 places in 65 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 47 places in 82 ms
[2021-05-13 20:11:57] [INFO ] Deduced a trap composed of 63 places in 59 ms
[2021-05-13 20:11:57] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1970 ms
[2021-05-13 20:11:57] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 32 ms.
[2021-05-13 20:11:58] [INFO ] Added : 218 causal constraints over 44 iterations in 1000 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-13 20:11:58] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2021-05-13 20:11:58] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2021-05-13 20:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:59] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 91 places in 122 ms
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 16 places in 66 ms
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 11 places in 56 ms
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2021-05-13 20:11:59] [INFO ] Deduced a trap composed of 16 places in 66 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 26 places in 64 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 30 places in 97 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 28 places in 115 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 91 places in 102 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 33 places in 103 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 19 places in 104 ms
[2021-05-13 20:12:00] [INFO ] Deduced a trap composed of 46 places in 104 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 97 places in 102 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 44 places in 99 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 98 places in 77 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 100 places in 146 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 85 places in 134 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 88 places in 139 ms
[2021-05-13 20:12:01] [INFO ] Deduced a trap composed of 96 places in 89 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 88 places in 82 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 86 places in 82 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 88 places in 81 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 87 places in 81 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 92 places in 77 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 91 places in 69 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 88 places in 81 ms
[2021-05-13 20:12:02] [INFO ] Deduced a trap composed of 90 places in 90 ms
[2021-05-13 20:12:03] [INFO ] Deduced a trap composed of 92 places in 106 ms
[2021-05-13 20:12:03] [INFO ] Deduced a trap composed of 91 places in 137 ms
[2021-05-13 20:12:03] [INFO ] Deduced a trap composed of 87 places in 111 ms
[2021-05-13 20:12:03] [INFO ] Deduced a trap composed of 89 places in 125 ms
[2021-05-13 20:12:03] [INFO ] Deduced a trap composed of 86 places in 105 ms
[2021-05-13 20:12:03] [INFO ] Deduced a trap composed of 89 places in 96 ms
[2021-05-13 20:12:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s27 s28 s35 s36 s39 s40 s44 s45 s46 s50 s51 s56 s80 s81 s91 s92 s118 s119 s123 s124 s125 s133 s136 s167 s194 s199 s209 s224 s229 s234 s238 s239 s240 s249 s253 s254 s255 s264 s274 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s294 s299 s300 s303 s304 s312 s313 s316 s317 s318 s319 s320 s321 s322 s325 s326 s335 s336 s343 s344 s345 s346 s349 s350 s355 s356 s359 s360 s367 s368 s373 s374 s379) 0)") while checking expression at index 3
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 16600 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=415 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 235 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 10 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.14 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 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 205 place count 268 transition count 178
Deduced a syphon composed of 45 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 305 place count 213 transition count 178
Symmetric choice reduction at 2 with 62 rule applications. Total rules 367 place count 213 transition count 178
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 62 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 491 place count 151 transition count 116
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 491 place count 151 transition count 110
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 505 place count 143 transition count 110
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 615 place count 88 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 87 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 86 transition count 54
Applied a total of 617 rules in 113 ms. Remains 86 /380 variables (removed 294) and now considering 54/331 (removed 277) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/380 places, 54/331 transitions.
Incomplete random walk after 1000000 steps, including 42334 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 14047 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties seen :[0]
// Phase 1: matrix 54 rows 86 cols
[2021-05-13 20:12:06] [INFO ] Computed 38 place invariants in 1 ms
[2021-05-13 20:12:06] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-13 20:12:06] [INFO ] [Real]Absence check using 36 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-13 20:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:06] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-13 20:12:06] [INFO ] Computed and/alt/rep : 52/86/52 causal constraints in 5 ms.
[2021-05-13 20:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:12:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2021-05-13 20:12:07] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-13 20:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:12:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-13 20:12:07] [INFO ] Computed and/alt/rep : 52/86/52 causal constraints in 4 ms.
[2021-05-13 20:12:07] [INFO ] Added : 37 causal constraints over 8 iterations in 83 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 4700 steps, including 195 resets, run finished after 19 ms. (steps per millisecond=247 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 54/54 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 83 transition count 52
Applied a total of 5 rules in 7 ms. Remains 83 /86 variables (removed 3) and now considering 52/54 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/86 places, 52/54 transitions.
Incomplete random walk after 1000000 steps, including 44629 resets, run finished after 1636 ms. (steps per millisecond=611 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 14035 resets, run finished after 971 ms. (steps per millisecond=1029 ) properties seen :[0]
Probably explored full state space saw : 137 states, properties seen :[0]
Probabilistic random walk after 414 steps, saw 137 distinct states, run finished after 9 ms. (steps per millisecond=46 ) properties seen :[0]
Explored full state space saw : 137 states, properties seen :[0]
Exhaustive walk after 414 steps, saw 137 distinct states, run finished after 2 ms. (steps per millisecond=207 ) properties seen :[0]
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-162038177000191"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;