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.r227-tall-162098230900168.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 ShieldIIPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230900168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K 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 119K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 1.7M May 5 16:52 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 ShieldIIPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621140093163

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 04:41:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 04:41:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 04:41:34] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2021-05-16 04:41:35] [INFO ] Transformed 6003 places.
[2021-05-16 04:41:35] [INFO ] Transformed 5903 transitions.
[2021-05-16 04:41:35] [INFO ] Found NUPN structural information;
[2021-05-16 04:41:35] [INFO ] Parsed PT model containing 6003 places and 5903 transitions in 539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 189 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 231 ms. (steps per millisecond=43 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0]
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 5903 rows 6003 cols
[2021-05-16 04:41:36] [INFO ] Computed 901 place invariants in 110 ms
[2021-05-16 04:41:39] [INFO ] [Real]Absence check using 901 positive place invariants in 2752 ms returned sat
[2021-05-16 04:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:41:41] [INFO ] [Real]Absence check using state equation in 1452 ms returned (error "Solver has unexpectedly terminated")
[2021-05-16 04:41:44] [INFO ] [Real]Absence check using 901 positive place invariants in 2731 ms returned sat
[2021-05-16 04:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:41:46] [INFO ] [Real]Absence check using state equation in 1563 ms returned (error "Solver has unexpectedly terminated")
[2021-05-16 04:41:49] [INFO ] [Real]Absence check using 901 positive place invariants in 2767 ms returned sat
[2021-05-16 04:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:41:51] [INFO ] [Real]Absence check using state equation in 1524 ms returned (error "Solver has unexpectedly terminated")
[2021-05-16 04:41:54] [INFO ] [Real]Absence check using 901 positive place invariants in 2721 ms returned sat
[2021-05-16 04:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:41:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:41:56] [INFO ] [Real]Absence check using state equation in 1574 ms returned (error "Failed to check-sat")
[2021-05-16 04:41:59] [INFO ] [Real]Absence check using 901 positive place invariants in 2828 ms returned sat
[2021-05-16 04:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:42:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:42:01] [INFO ] [Real]Absence check using state equation in 1474 ms returned (error "Failed to check-sat")
[2021-05-16 04:42:04] [INFO ] [Real]Absence check using 901 positive place invariants in 2799 ms returned sat
[2021-05-16 04:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:42:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:42:06] [INFO ] [Real]Absence check using state equation in 1508 ms returned (error "Failed to check-sat")
[2021-05-16 04:42:09] [INFO ] [Real]Absence check using 901 positive place invariants in 2814 ms returned sat
[2021-05-16 04:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:42:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 04:42:11] [INFO ] [Real]Absence check using state equation in 1489 ms returned (error "Failed to check-sat")
Support contains 66 out of 6003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Iterating post reduction 0 with 497 rules applied. Total rules applied 497 place count 6003 transition count 5406
Reduce places removed 497 places and 0 transitions.
Iterating post reduction 1 with 497 rules applied. Total rules applied 994 place count 5506 transition count 5406
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 994 place count 5506 transition count 4909
Deduced a syphon composed of 497 places in 57 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1988 place count 5009 transition count 4909
Symmetric choice reduction at 2 with 685 rule applications. Total rules 2673 place count 5009 transition count 4909
Deduced a syphon composed of 685 places in 24 ms
Reduce places removed 685 places and 685 transitions.
Iterating global reduction 2 with 1370 rules applied. Total rules applied 4043 place count 4324 transition count 4224
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 285 Pre rules applied. Total rules applied 4043 place count 4324 transition count 3939
Deduced a syphon composed of 285 places in 50 ms
Reduce places removed 285 places and 0 transitions.
Iterating global reduction 2 with 570 rules applied. Total rules applied 4613 place count 4039 transition count 3939
Performed 1480 Post agglomeration using F-continuation condition.Transition count delta: 1480
Deduced a syphon composed of 1480 places in 14 ms
Reduce places removed 1480 places and 0 transitions.
Iterating global reduction 2 with 2960 rules applied. Total rules applied 7573 place count 2559 transition count 2459
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 677 times.
Drop transitions removed 677 transitions
Iterating global reduction 2 with 677 rules applied. Total rules applied 8250 place count 2559 transition count 2459
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8251 place count 2559 transition count 2459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8252 place count 2558 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8253 place count 2557 transition count 2458
Applied a total of 8253 rules in 2537 ms. Remains 2557 /6003 variables (removed 3446) and now considering 2458/5903 (removed 3445) transitions.
Finished structural reductions, in 1 iterations. Remains : 2557/6003 places, 2458/5903 transitions.
Incomplete random walk after 1000000 steps, including 81 resets, run finished after 17557 ms. (steps per millisecond=56 ) properties seen :[1, 1, 1, 1, 1, 0, 1]
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 446778 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :[0]
// Phase 1: matrix 2458 rows 2557 cols
[2021-05-16 04:42:36] [INFO ] Computed 900 place invariants in 155 ms
[2021-05-16 04:42:37] [INFO ] [Real]Absence check using 891 positive place invariants in 944 ms returned sat
[2021-05-16 04:42:37] [INFO ] [Real]Absence check using 891 positive and 9 generalized place invariants in 15 ms returned sat
[2021-05-16 04:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:42:50] [INFO ] [Real]Absence check using state equation in 12538 ms returned sat
[2021-05-16 04:42:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:42:51] [INFO ] [Nat]Absence check using 891 positive place invariants in 949 ms returned sat
[2021-05-16 04:42:51] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 16 ms returned sat
[2021-05-16 04:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:43:04] [INFO ] [Nat]Absence check using state equation in 12840 ms returned sat
[2021-05-16 04:43:04] [INFO ] Deduced a trap composed of 9 places in 254 ms
[2021-05-16 04:43:05] [INFO ] Deduced a trap composed of 9 places in 231 ms
[2021-05-16 04:43:05] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2021-05-16 04:43:05] [INFO ] Deduced a trap composed of 8 places in 215 ms
[2021-05-16 04:43:05] [INFO ] Deduced a trap composed of 8 places in 197 ms
[2021-05-16 04:43:06] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2021-05-16 04:43:06] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2021-05-16 04:43:06] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2021-05-16 04:43:07] [INFO ] Deduced a trap composed of 11 places in 180 ms
[2021-05-16 04:43:07] [INFO ] Deduced a trap composed of 9 places in 169 ms
[2021-05-16 04:43:07] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2021-05-16 04:43:07] [INFO ] Deduced a trap composed of 7 places in 166 ms
[2021-05-16 04:43:08] [INFO ] Deduced a trap composed of 7 places in 168 ms
[2021-05-16 04:43:08] [INFO ] Deduced a trap composed of 7 places in 161 ms
[2021-05-16 04:43:08] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2021-05-16 04:43:08] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2021-05-16 04:43:09] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2021-05-16 04:43:09] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2021-05-16 04:43:09] [INFO ] Deduced a trap composed of 6 places in 123 ms
[2021-05-16 04:43:09] [INFO ] Deduced a trap composed of 7 places in 129 ms
[2021-05-16 04:43:10] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2021-05-16 04:43:10] [INFO ] Deduced a trap composed of 5 places in 121 ms
[2021-05-16 04:43:10] [INFO ] Deduced a trap composed of 6 places in 116 ms
[2021-05-16 04:43:10] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2021-05-16 04:43:10] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6307 ms
[2021-05-16 04:43:10] [INFO ] Computed and/alt/rep : 2456/15379/2456 causal constraints in 156 ms.
[2021-05-16 04:43:30] [INFO ] Added : 580 causal constraints over 116 iterations in 20100 ms.(timeout) Result :sat
[2021-05-16 04:43:31] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2021-05-16 04:43:31] [INFO ] Deduced a trap composed of 10 places in 206 ms
[2021-05-16 04:43:31] [INFO ] Deduced a trap composed of 10 places in 203 ms
[2021-05-16 04:43:32] [INFO ] Deduced a trap composed of 10 places in 203 ms
[2021-05-16 04:43:32] [INFO ] Deduced a trap composed of 9 places in 211 ms
[2021-05-16 04:43:32] [INFO ] Deduced a trap composed of 10 places in 199 ms
[2021-05-16 04:43:33] [INFO ] Deduced a trap composed of 13 places in 185 ms
[2021-05-16 04:43:33] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2021-05-16 04:43:33] [INFO ] Deduced a trap composed of 16 places in 111 ms
[2021-05-16 04:43:34] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2021-05-16 04:43:34] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2021-05-16 04:43:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3703 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
Incomplete Parikh walk after 740600 steps, including 1012 resets, run finished after 9498 ms. (steps per millisecond=77 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 2557 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2557/2557 places, 2458/2458 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2557 transition count 2455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 2554 transition count 2455
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 2554 transition count 2446
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 2545 transition count 2446
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 86 place count 2514 transition count 2415
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 105 place count 2514 transition count 2415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 2513 transition count 2414
Applied a total of 106 rules in 377 ms. Remains 2513 /2557 variables (removed 44) and now considering 2414/2458 (removed 44) transitions.
Finished structural reductions, in 1 iterations. Remains : 2513/2557 places, 2414/2458 transitions.
Incomplete random walk after 1000000 steps, including 47 resets, run finished after 17357 ms. (steps per millisecond=57 ) properties seen :[0]
Interrupted Best-First random walk after 444313 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen :[0]
Interrupted probabilistic random walk after 873754 steps, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen :[0]
Probabilistic random walk after 873754 steps, saw 60663 distinct states, run finished after 30001 ms. (steps per millisecond=29 ) properties seen :[0]
// Phase 1: matrix 2414 rows 2513 cols
[2021-05-16 04:44:36] [INFO ] Computed 900 place invariants in 54 ms
[2021-05-16 04:44:38] [INFO ] [Real]Absence check using 898 positive place invariants in 931 ms returned sat
[2021-05-16 04:44:38] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 5 ms returned sat
[2021-05-16 04:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:44:50] [INFO ] [Real]Absence check using state equation in 12306 ms returned sat
[2021-05-16 04:44:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:44:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 926 ms returned sat
[2021-05-16 04:44:51] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 5 ms returned sat
[2021-05-16 04:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:45:04] [INFO ] [Nat]Absence check using state equation in 12733 ms returned sat
[2021-05-16 04:45:04] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2021-05-16 04:45:04] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2021-05-16 04:45:04] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-16 04:45:05] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2021-05-16 04:45:05] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2021-05-16 04:45:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 790 ms
[2021-05-16 04:45:05] [INFO ] Computed and/alt/rep : 2408/12176/2408 causal constraints in 205 ms.
[2021-05-16 04:45:25] [INFO ] Added : 665 causal constraints over 133 iterations in 20209 ms.(timeout) Result :sat
[2021-05-16 04:45:25] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2021-05-16 04:45:25] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2021-05-16 04:45:26] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2021-05-16 04:45:26] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2021-05-16 04:45:26] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2021-05-16 04:45:26] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2021-05-16 04:45:27] [INFO ] Deduced a trap composed of 14 places in 79 ms
[2021-05-16 04:45:27] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2021-05-16 04:45:27] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2021-05-16 04:45:27] [INFO ] Deduced a trap composed of 23 places in 57 ms
[2021-05-16 04:45:28] [INFO ] Deduced a trap composed of 9 places in 31 ms
[2021-05-16 04:45:28] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2021-05-16 04:45:28] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2021-05-16 04:45:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3066 ms
Attempting to minimize the solution found.
Minimization took 83 ms.
Incomplete Parikh walk after 442700 steps, including 997 resets, run finished after 7541 ms. (steps per millisecond=58 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 2513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2513/2513 places, 2414/2414 transitions.
Applied a total of 0 rules in 81 ms. Remains 2513 /2513 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2513/2513 places, 2414/2414 transitions.
Starting structural reductions, iteration 0 : 2513/2513 places, 2414/2414 transitions.
Applied a total of 0 rules in 81 ms. Remains 2513 /2513 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
// Phase 1: matrix 2414 rows 2513 cols
[2021-05-16 04:45:36] [INFO ] Computed 900 place invariants in 46 ms
[2021-05-16 04:45:50] [INFO ] Implicit Places using invariants in 13630 ms returned []
// Phase 1: matrix 2414 rows 2513 cols
[2021-05-16 04:45:50] [INFO ] Computed 900 place invariants in 45 ms
[2021-05-16 04:46:33] [INFO ] Performed 1288/2513 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-16 04:47:03] [INFO ] Performed 2510/2513 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2021-05-16 04:47:03] [INFO ] Implicit Places using invariants and state equation in 73789 ms returned []
Implicit Place search using SMT with State Equation took 87420 ms to find 0 implicit places.
[2021-05-16 04:47:04] [INFO ] Redundant transitions in 232 ms returned []
// Phase 1: matrix 2414 rows 2513 cols
[2021-05-16 04:47:04] [INFO ] Computed 900 place invariants in 46 ms
[2021-05-16 04:47:17] [INFO ] Dead Transitions using invariants and state equation in 13000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2513/2513 places, 2414/2414 transitions.
Incomplete random walk after 100000 steps, including 4 resets, run finished after 1741 ms. (steps per millisecond=57 ) properties seen :[0]
// Phase 1: matrix 2414 rows 2513 cols
[2021-05-16 04:47:18] [INFO ] Computed 900 place invariants in 49 ms
[2021-05-16 04:47:20] [INFO ] [Real]Absence check using 898 positive place invariants in 934 ms returned sat
[2021-05-16 04:47:20] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 5 ms returned sat
[2021-05-16 04:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:47:32] [INFO ] [Real]Absence check using state equation in 12583 ms returned sat
[2021-05-16 04:47:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:47:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 919 ms returned sat
[2021-05-16 04:47:34] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 4 ms returned sat
[2021-05-16 04:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:47:46] [INFO ] [Nat]Absence check using state equation in 12894 ms returned sat
[2021-05-16 04:47:47] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2021-05-16 04:47:47] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2021-05-16 04:47:47] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-16 04:47:47] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2021-05-16 04:47:47] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2021-05-16 04:47:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 789 ms
[2021-05-16 04:47:47] [INFO ] Computed and/alt/rep : 2408/12176/2408 causal constraints in 121 ms.
[2021-05-16 04:47:52] [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 (=> (> t225 0) (and (or (and (> t682 0) (< o682 o225)) (and (> t2371 0) (< o2371 o225))) (or (and (> t690 0) (< o690 o225)) (and (> t691 0) (< o691 o225)) (and (> t692 0) (< o692 o225)) (and (> t693 0) (< o693 o225)))))") while checking expression at index 0
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2513 transition count 2414
Applied a total of 1 rules in 146 ms. Remains 2513 /2513 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
// Phase 1: matrix 2414 rows 2513 cols
[2021-05-16 04:47:53] [INFO ] Computed 900 place invariants in 45 ms
[2021-05-16 04:47:54] [INFO ] [Real]Absence check using 898 positive place invariants in 927 ms returned sat
[2021-05-16 04:47:54] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 5 ms returned sat
[2021-05-16 04:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:48:06] [INFO ] [Real]Absence check using state equation in 12405 ms returned sat
[2021-05-16 04:48:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:48:07] [INFO ] [Nat]Absence check using 898 positive place invariants in 922 ms returned sat
[2021-05-16 04:48:07] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 4 ms returned sat
[2021-05-16 04:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:48:20] [INFO ] [Nat]Absence check using state equation in 12538 ms returned sat
[2021-05-16 04:48:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 04:48:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2021-05-16 04:48:20] [INFO ] Deduced a trap composed of 4 places in 183 ms
[2021-05-16 04:48:21] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2021-05-16 04:48:21] [INFO ] Deduced a trap composed of 11 places in 174 ms
[2021-05-16 04:48:21] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2021-05-16 04:48:21] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2021-05-16 04:48:22] [INFO ] Deduced a trap composed of 9 places in 125 ms
[2021-05-16 04:48:22] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2021-05-16 04:48:22] [INFO ] Deduced a trap composed of 6 places in 106 ms
[2021-05-16 04:48:22] [INFO ] Deduced a trap composed of 18 places in 108 ms
[2021-05-16 04:48:22] [INFO ] Deduced a trap composed of 30 places in 88 ms
[2021-05-16 04:48:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2287 ms
[2021-05-16 04:48:22] [INFO ] Computed and/alt/rep : 2408/12180/2408 causal constraints in 109 ms.
[2021-05-16 04:48:43] [INFO ] Added : 655 causal constraints over 131 iterations in 20220 ms.(timeout) Result :sat
[2021-05-16 04:48:43] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-16 04:48:43] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2021-05-16 04:48:43] [INFO ] Deduced a trap composed of 14 places in 60 ms
[2021-05-16 04:48:43] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2021-05-16 04:48:44] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2021-05-16 04:48:44] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2021-05-16 04:48:44] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2021-05-16 04:48:44] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2021-05-16 04:48:44] [INFO ] Deduced a trap composed of 11 places in 38 ms
[2021-05-16 04:48:45] [INFO ] Deduced a trap composed of 17 places in 39 ms
[2021-05-16 04:48:45] [INFO ] Deduced a trap composed of 7 places in 31 ms
[2021-05-16 04:48:45] [INFO ] Deduced a trap composed of 17 places in 30 ms
[2021-05-16 04:48:45] [INFO ] Deduced a trap composed of 8 places in 23 ms
[2021-05-16 04:48:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2732 ms
Attempting to minimize the solution found.
Minimization took 73 ms.
[2021-05-16 04:48:45] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-16 04:48:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
[2021-05-16 04:48:46] [INFO ] Flatten gal took : 339 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-100B @ 3570 seconds

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3548
rslt: Output for ReachabilityFireability @ ShieldIIPs-PT-100B

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 04:48:47 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 47428,
"runtime": 22.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((p1801 <= 0) OR (p2486 <= 0) OR (p1400 <= 0) OR (((p1696 <= 0) OR (p1707 <= 0) OR (p1712 <= 0)) AND ((p541 <= 0) OR (p563 <= 0))) OR ((1 <= p1485) AND ((p226 <= 0)) AND (1 <= p1357)))))",
"processed_size": 199,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 11963,
"conflict_clusters": 316,
"places": 2513,
"places_significant": 1613,
"singleton_clusters": 0,
"transitions": 2414
},
"result":
{
"edges": 85,
"markings": 51,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 39,
"problems": 6
},
"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: 4927/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2513
lola: finding significant places
lola: 2513 places, 2414 transitions, 1613 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 ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p1801 <= 1)
lola: LP says that atomic proposition is always true: (p2486 <= 1)
lola: LP says that atomic proposition is always true: (p1400 <= 1)
lola: LP says that atomic proposition is always true: (p1696 <= 1)
lola: LP says that atomic proposition is always true: (p1707 <= 1)
lola: LP says that atomic proposition is always true: (p1712 <= 1)
lola: LP says that atomic proposition is always true: (p541 <= 1)
lola: LP says that atomic proposition is always true: (p563 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p1485 <= 1)
lola: LP says that atomic proposition is always true: (p1357 <= 1)
lola: A (G (((p1801 <= 0) OR (p2486 <= 0) OR (p1400 <= 0) OR (((p1696 <= 0) OR (p1707 <= 0) OR (p1712 <= 0)) AND ((p541 <= 0) OR (p563 <= 0))) OR ((1 <= p1485) AND ((p226 <= 0)) AND (1 <= p1357)))))
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 (((p1801 <= 0) OR (p2486 <= 0) OR (p1400 <= 0) OR (((p1696 <= 0) OR (p1707 <= 0) OR (p1712 <= 0)) AND ((p541 <= 0) OR (p563 <= 0))) OR ((1 <= p1485) AND ((p226 <= 0)) AND (1 <= p1357)))))
lola: processed formula length: 199
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: 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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1801) AND (1 <= p2486) AND (1 <= p1400) AND (((1 <= p1696) AND (1 <= p1707) AND (1 <= p1712)) OR ((1 <= p541) AND (1 <= p563))) AND ((p1485 <= 0) OR ((1 <= p226)) OR (p1357 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 39 literals and 6 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 51 markings, 85 edges
lola: memory consumption: 47428 KB
lola: time consumption: 22 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098230900168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;