Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151400311.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151400311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 697K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 520K 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 Peterson-PT-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621025961087

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 20:59:22] [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-14 20:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:59:22] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2021-05-14 20:59:22] [INFO ] Transformed 480 places.
[2021-05-14 20:59:22] [INFO ] Transformed 690 transitions.
[2021-05-14 20:59:22] [INFO ] Found NUPN structural information;
[2021-05-14 20:59:22] [INFO ] Parsed PT model containing 480 places and 690 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=106 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0]
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 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 0 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 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
[2021-05-14 20:59:23] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 20:59:23] [INFO ] Computed 19 place invariants in 21 ms
[2021-05-14 20:59:23] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned unsat
[2021-05-14 20:59:23] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 20:59:23] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:23] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2021-05-14 20:59:23] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 20:59:23] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2021-05-14 20:59:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 64 ms returned sat
[2021-05-14 20:59:24] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 20:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:24] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-14 20:59:24] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 25 places in 284 ms
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 10 places in 186 ms
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 32 places in 154 ms
[2021-05-14 20:59:25] [INFO ] Deduced a trap composed of 10 places in 165 ms
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 12 places in 195 ms
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 42 places in 166 ms
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 32 places in 164 ms
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 32 places in 162 ms
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 66 places in 169 ms
[2021-05-14 20:59:26] [INFO ] Deduced a trap composed of 27 places in 148 ms
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 80 places in 126 ms
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 91 places in 130 ms
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 58 places in 135 ms
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 42 places in 135 ms
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 42 places in 143 ms
[2021-05-14 20:59:27] [INFO ] Deduced a trap composed of 57 places in 152 ms
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 13 places in 174 ms
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 103 places in 140 ms
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 57 places in 138 ms
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 45 places in 138 ms
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 39 places in 145 ms
[2021-05-14 20:59:28] [INFO ] Deduced a trap composed of 43 places in 130 ms
[2021-05-14 20:59:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 20:59:29] [INFO ] Deduced a trap composed of 2 places in 224 ms
[2021-05-14 20:59:29] [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 (> (+ s231 s236) 0)") while checking expression at index 1
[2021-05-14 20:59:29] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2021-05-14 20:59:29] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 20:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:29] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2021-05-14 20:59:29] [INFO ] [Real]Added 132 Read/Feed constraints in 16 ms returned sat
[2021-05-14 20:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2021-05-14 20:59:29] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:30] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2021-05-14 20:59:30] [INFO ] [Nat]Added 132 Read/Feed constraints in 30 ms returned sat
[2021-05-14 20:59:30] [INFO ] Deduced a trap composed of 10 places in 172 ms
[2021-05-14 20:59:30] [INFO ] Deduced a trap composed of 91 places in 170 ms
[2021-05-14 20:59:31] [INFO ] Deduced a trap composed of 91 places in 172 ms
[2021-05-14 20:59:31] [INFO ] Deduced a trap composed of 10 places in 135 ms
[2021-05-14 20:59:31] [INFO ] Deduced a trap composed of 58 places in 133 ms
[2021-05-14 20:59:31] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2021-05-14 20:59:31] [INFO ] Deduced a trap composed of 10 places in 175 ms
[2021-05-14 20:59:31] [INFO ] Deduced a trap composed of 91 places in 151 ms
[2021-05-14 20:59:32] [INFO ] Deduced a trap composed of 67 places in 155 ms
[2021-05-14 20:59:32] [INFO ] Deduced a trap composed of 72 places in 152 ms
[2021-05-14 20:59:32] [INFO ] Deduced a trap composed of 106 places in 156 ms
[2021-05-14 20:59:32] [INFO ] Deduced a trap composed of 66 places in 153 ms
[2021-05-14 20:59:32] [INFO ] Deduced a trap composed of 56 places in 189 ms
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 112 places in 188 ms
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 43 places in 164 ms
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 44 places in 157 ms
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 40 places in 127 ms
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 14 places in 152 ms
[2021-05-14 20:59:34] [INFO ] Deduced a trap composed of 14 places in 151 ms
[2021-05-14 20:59:34] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3720 ms
[2021-05-14 20:59:34] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 35 ms.
[2021-05-14 20:59:34] [INFO ] Added : 105 causal constraints over 21 iterations in 678 ms. Result :(error "Failed to check-sat")
[2021-05-14 20:59:34] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 20:59:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:35] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2021-05-14 20:59:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned unsat
[2021-05-14 20:59:35] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2021-05-14 20:59:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-14 20:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:36] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2021-05-14 20:59:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2021-05-14 20:59:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:36] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2021-05-14 20:59:36] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2021-05-14 20:59:36] [INFO ] Deduced a trap composed of 10 places in 161 ms
[2021-05-14 20:59:37] [INFO ] Deduced a trap composed of 14 places in 162 ms
[2021-05-14 20:59:37] [INFO ] Deduced a trap composed of 23 places in 163 ms
[2021-05-14 20:59:37] [INFO ] Deduced a trap composed of 16 places in 164 ms
[2021-05-14 20:59:37] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2021-05-14 20:59:37] [INFO ] Deduced a trap composed of 32 places in 146 ms
[2021-05-14 20:59:37] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 47 places in 92 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 62 places in 73 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 61 places in 73 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 58 places in 74 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 58 places in 74 ms
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 35 places in 156 ms
[2021-05-14 20:59:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2077 ms
[2021-05-14 20:59:38] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 35 ms.
[2021-05-14 20:59:41] [INFO ] Added : 385 causal constraints over 77 iterations in 2335 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-14 20:59:41] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 20:59:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:41] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-14 20:59:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2021-05-14 20:59:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:42] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2021-05-14 20:59:42] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2021-05-14 20:59:42] [INFO ] Deduced a trap composed of 14 places in 123 ms
[2021-05-14 20:59:42] [INFO ] Deduced a trap composed of 62 places in 123 ms
[2021-05-14 20:59:42] [INFO ] Deduced a trap composed of 61 places in 127 ms
[2021-05-14 20:59:42] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 27 places in 116 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 62 places in 125 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 42 places in 117 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 20 places in 127 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2021-05-14 20:59:43] [INFO ] Deduced a trap composed of 19 places in 138 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 54 places in 110 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 10 places in 153 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 57 places in 128 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 57 places in 122 ms
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 58 places in 87 ms
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 54 places in 97 ms
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 76 places in 131 ms
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 92 places in 144 ms
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 54 places in 128 ms
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 10 places in 161 ms
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 54 places in 138 ms
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 76 places in 93 ms
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 76 places in 95 ms
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 76 places in 92 ms
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 10 places in 88 ms
3timeout
^^^^^^^^
(error "Invalid token: 3timeout")
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 2 places in 227 ms
[2021-05-14 20:59:46] [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 (> (+ s231 s236) 0)") while checking expression at index 5
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 480 transition count 502
Reduce places removed 188 places and 0 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 376 place count 292 transition count 502
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 376 place count 292 transition count 411
Deduced a syphon composed of 91 places in 9 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 558 place count 201 transition count 411
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 598 place count 181 transition count 391
Applied a total of 598 rules in 111 ms. Remains 181 /480 variables (removed 299) and now considering 391/690 (removed 299) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/480 places, 391/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2319 ms. (steps per millisecond=431 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties seen :[0, 0, 1, 0]
FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-14 20:59:52] [INFO ] Flow matrix only has 331 transitions (discarded 60 similar events)
// Phase 1: matrix 331 rows 181 cols
[2021-05-14 20:59:52] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-14 20:59:52] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-14 20:59:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:52] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-14 20:59:52] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 20:59:52] [INFO ] [Real]Added 132 Read/Feed constraints in 17 ms returned sat
[2021-05-14 20:59:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 20:59:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 20:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:52] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-14 20:59:52] [INFO ] [Nat]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 26 places in 52 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 21 places in 41 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 32 places in 39 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 16 places in 58 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 42 places in 66 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 52 places in 57 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 42 places in 48 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 25 places in 49 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 46 places in 42 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 26 places in 43 ms
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 27 places in 45 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 30 places in 54 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 42 places in 55 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 44 places in 57 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 19 places in 55 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 22 places in 56 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 14 places in 60 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 31 places in 51 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 26 places in 51 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 37 places in 48 ms
[2021-05-14 20:59:55] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 31 places in 42 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 54 places in 45 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 33 places in 45 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 48 places in 44 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 32 places in 43 ms
[2021-05-14 20:59:56] [INFO ] Deduced a trap composed of 22 places in 43 ms
[2021-05-14 20:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 63 trap constraints in 4817 ms
[2021-05-14 20:59:57] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 20:59:57] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:57] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-14 20:59:57] [INFO ] [Real]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-14 20:59:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2021-05-14 20:59:57] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 20:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:57] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-14 20:59:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 13 places in 61 ms
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2021-05-14 20:59:57] [INFO ] Deduced a trap composed of 17 places in 56 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 50 places in 45 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 21 places in 49 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 22 places in 46 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 21 places in 48 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 15 places in 51 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 49 places in 51 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 10 places in 40 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 15 places in 40 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 38 places in 48 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2021-05-14 20:59:58] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2021-05-14 20:59:58] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1301 ms
[2021-05-14 20:59:58] [INFO ] Computed and/alt/rep : 386/1991/326 causal constraints in 19 ms.
[2021-05-14 21:00:00] [INFO ] Added : 323 causal constraints over 65 iterations in 1410 ms. Result :sat
[2021-05-14 21:00:00] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2021-05-14 21:00:00] [INFO ] Deduced a trap composed of 31 places in 26 ms
[2021-05-14 21:00:00] [INFO ] Deduced a trap composed of 34 places in 25 ms
[2021-05-14 21:00:00] [INFO ] Deduced a trap composed of 20 places in 36 ms
[2021-05-14 21:00:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 270 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-14 21:00:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:00] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Nat]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2021-05-14 21:00:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 314 ms
[2021-05-14 21:00:01] [INFO ] Computed and/alt/rep : 386/1991/326 causal constraints in 19 ms.
[2021-05-14 21:00:02] [INFO ] Added : 322 causal constraints over 65 iterations in 1548 ms. Result :sat
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 29 places in 55 ms
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 14 places in 47 ms
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 22 places in 52 ms
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 15 places in 57 ms
[2021-05-14 21:00:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 494 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 61000 steps, including 986 resets, run finished after 203 ms. (steps per millisecond=300 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 82200 steps, including 1000 resets, run finished after 204 ms. (steps per millisecond=402 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 181 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 181/181 places, 391/391 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 389
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 179 transition count 389
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 179 transition count 382
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 172 transition count 382
Applied a total of 18 rules in 21 ms. Remains 172 /181 variables (removed 9) and now considering 382/391 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 172/181 places, 382/391 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2096 ms. (steps per millisecond=477 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 655 ms. (steps per millisecond=1526 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties seen :[0, 0]
Finished probabilistic random walk after 3635136 steps, run visited all 2 properties in 5992 ms. (steps per millisecond=606 )
Probabilistic random walk after 3635136 steps, saw 605857 distinct states, run finished after 5992 ms. (steps per millisecond=606 ) properties seen :[1, 1]
FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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="Peterson-PT-4"
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 Peterson-PT-4, 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 r151-tall-162089151400311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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