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.r189-tajo-162089433000407.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 ResAllocation-PT-R050C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089433000407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 212K 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 ResAllocation-PT-R050C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621430384482

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:19:48] [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-19 13:19:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:19:49] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2021-05-19 13:19:49] [INFO ] Transformed 200 places.
[2021-05-19 13:19:49] [INFO ] Transformed 102 transitions.
[2021-05-19 13:19:49] [INFO ] Parsed PT model containing 200 places and 102 transitions in 350 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 135 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 102 rows 200 cols
[2021-05-19 13:19:50] [INFO ] Computed 100 place invariants in 7 ms
[2021-05-19 13:19:50] [INFO ] [Real]Absence check using 100 positive place invariants in 309 ms returned sat
[2021-05-19 13:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:51] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-19 13:19:51] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2021-05-19 13:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2021-05-19 13:19:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 132 ms returned sat
[2021-05-19 13:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:51] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2021-05-19 13:19:51] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2021-05-19 13:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2021-05-19 13:19:52] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 44 ms.
[2021-05-19 13:19:52] [INFO ] Added : 96 causal constraints over 20 iterations in 434 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-19 13:19:52] [INFO ] [Real]Absence check using 100 positive place invariants in 19 ms returned unsat
[2021-05-19 13:19:52] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned unsat
[2021-05-19 13:19:52] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned unsat
[2021-05-19 13:19:52] [INFO ] [Real]Absence check using 100 positive place invariants in 19 ms returned unsat
[2021-05-19 13:19:52] [INFO ] [Real]Absence check using 100 positive place invariants in 90 ms returned sat
[2021-05-19 13:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:53] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-19 13:19:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:53] [INFO ] [Nat]Absence check using 100 positive place invariants in 547 ms returned sat
[2021-05-19 13:19:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:53] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-19 13:19:54] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 22 ms.
[2021-05-19 13:19:54] [INFO ] Added : 49 causal constraints over 10 iterations in 168 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using 100 positive place invariants in 39 ms returned unsat
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 64900 steps, including 99 resets, run finished after 293 ms. (steps per millisecond=221 ) properties seen :[0, 1] could not realise parikh vector
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 45100 steps, including 147 resets, run finished after 168 ms. (steps per millisecond=268 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 102/102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 199 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 199 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 198 transition count 100
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 198 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 195 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 194 transition count 98
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 194 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 191 transition count 97
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 191 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 189 transition count 96
Applied a total of 17 rules in 166 ms. Remains 189 /200 variables (removed 11) and now considering 96/102 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/200 places, 96/102 transitions.
Incomplete random walk after 1000000 steps, including 1772 resets, run finished after 2742 ms. (steps per millisecond=364 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties seen :[0]
Interrupted probabilistic random walk after 20168296 steps, run timeout after 30001 ms. (steps per millisecond=672 ) properties seen :[0]
Probabilistic random walk after 20168296 steps, saw 3630569 distinct states, run finished after 30003 ms. (steps per millisecond=672 ) properties seen :[0]
// Phase 1: matrix 96 rows 189 cols
[2021-05-19 13:20:28] [INFO ] Computed 95 place invariants in 12 ms
[2021-05-19 13:20:28] [INFO ] [Real]Absence check using 95 positive place invariants in 42 ms returned sat
[2021-05-19 13:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:29] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-19 13:20:29] [INFO ] Deduced a trap composed of 3 places in 39 ms
[2021-05-19 13:20:29] [INFO ] Deduced a trap composed of 3 places in 34 ms
[2021-05-19 13:20:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2021-05-19 13:20:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:29] [INFO ] [Nat]Absence check using 95 positive place invariants in 49 ms returned sat
[2021-05-19 13:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:29] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 3 places in 710 ms
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 3 places in 34 ms
[2021-05-19 13:20:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 786 ms
[2021-05-19 13:20:30] [INFO ] Computed and/alt/rep : 94/94/94 causal constraints in 9 ms.
[2021-05-19 13:20:30] [INFO ] Added : 92 causal constraints over 19 iterations in 273 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 52800 steps, including 151 resets, run finished after 124 ms. (steps per millisecond=425 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 189/189 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 189/189 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 189 /189 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 189 cols
[2021-05-19 13:20:30] [INFO ] Computed 95 place invariants in 2 ms
[2021-05-19 13:20:31] [INFO ] Implicit Places using invariants in 350 ms returned [98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, 142, 144, 146, 148, 150, 152, 154, 156, 158, 162, 164, 166, 168, 170, 172, 174, 176, 178, 180, 182, 184, 186, 188]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 353 ms to find 45 implicit places.
[2021-05-19 13:20:31] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:20:31] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-19 13:20:31] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 144/189 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2021-05-19 13:20:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:20:31] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-19 13:20:31] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/189 places, 96/96 transitions.
Incomplete random walk after 1000000 steps, including 1768 resets, run finished after 1595 ms. (steps per millisecond=626 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 161 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties seen :[0]
Interrupted probabilistic random walk after 20945587 steps, run timeout after 30001 ms. (steps per millisecond=698 ) properties seen :[0]
Probabilistic random walk after 20945587 steps, saw 3746373 distinct states, run finished after 30002 ms. (steps per millisecond=698 ) properties seen :[0]
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:21:03] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-19 13:21:03] [INFO ] [Real]Absence check using 50 positive place invariants in 87 ms returned sat
[2021-05-19 13:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:04] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-19 13:21:04] [INFO ] Computed and/alt/rep : 94/94/94 causal constraints in 19 ms.
[2021-05-19 13:21:04] [INFO ] Added : 92 causal constraints over 19 iterations in 297 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 75500 steps, including 178 resets, run finished after 329 ms. (steps per millisecond=229 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 144/144 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:21:04] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-19 13:21:05] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:21:05] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-19 13:21:05] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2021-05-19 13:21:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:21:05] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-19 13:21:05] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 96/96 transitions.
Incomplete random walk after 100000 steps, including 177 resets, run finished after 165 ms. (steps per millisecond=606 ) properties seen :[0]
// Phase 1: matrix 96 rows 144 cols
[2021-05-19 13:21:06] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-19 13:21:06] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2021-05-19 13:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:06] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-19 13:21:06] [INFO ] Computed and/alt/rep : 94/94/94 causal constraints in 8 ms.
[2021-05-19 13:21:06] [INFO ] Added : 92 causal constraints over 19 iterations in 303 ms. Result :sat
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 143 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 143 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 141 transition count 94
Applied a total of 5 rules in 12 ms. Remains 141 /144 variables (removed 3) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 141 cols
[2021-05-19 13:21:06] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-19 13:21:06] [INFO ] [Real]Absence check using 49 positive place invariants in 20 ms returned sat
[2021-05-19 13:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:06] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-19 13:21:06] [INFO ] Computed and/alt/rep : 92/92/92 causal constraints in 10 ms.
[2021-05-19 13:21:07] [INFO ] Added : 88 causal constraints over 18 iterations in 240 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-19 13:21:07] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2021-05-19 13:21:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-19 13:21:07] [INFO ] Flatten gal took : 109 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ResAllocation-PT-R050C002 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ ResAllocation-PT-R050C002

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:21:08 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 17168,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p93 <= 0) OR (p96 + 1 <= p105) OR ((p135 <= 0)))))",
"processed_size": 60,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 384,
"conflict_clusters": 48,
"places": 144,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 96
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 240/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 144
lola: finding significant places
lola: 144 places, 96 transitions, 94 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p129)
lola: A (G (((p93 <= 0) OR (p96 + 1 <= p105) OR ((p135 <= 0)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p93 <= 0) OR (p96 + 1 <= p105) OR ((p135 <= 0)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p93) AND (p105 <= p96) AND ((1 <= p135)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: memory consumption: 17168 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

--------------------
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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r189-tajo-162089433000407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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