Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789200390.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:43 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 ShieldPPPt-PT-010B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716984964305

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 12:16:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 12:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:16:06] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-29 12:16:06] [INFO ] Transformed 783 places.
[2024-05-29 12:16:06] [INFO ] Transformed 713 transitions.
[2024-05-29 12:16:06] [INFO ] Found NUPN structural information;
[2024-05-29 12:16:06] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 713 rows 783 cols
[2024-05-29 12:16:07] [INFO ] Computed 111 invariants in 18 ms
[2024-05-29 12:16:07] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 12:16:07] [INFO ] [Nat]Absence check using 111 positive place invariants in 38 ms returned sat
[2024-05-29 12:16:08] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 12:16:08] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 7 ms to minimize.
[2024-05-29 12:16:08] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2024-05-29 12:16:09] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 1 ms to minimize.
[2024-05-29 12:16:09] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2024-05-29 12:16:09] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2024-05-29 12:16:09] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2024-05-29 12:16:09] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 1 ms to minimize.
[2024-05-29 12:16:10] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2024-05-29 12:16:10] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-05-29 12:16:10] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2024-05-29 12:16:10] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-05-29 12:16:10] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 12:16:10] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 0 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2024-05-29 12:16:11] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2024-05-29 12:16:12] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5016 ms
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 3 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:16:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 503 ms
[2024-05-29 12:16:14] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2024-05-29 12:16:14] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2024-05-29 12:16:14] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-29 12:16:14] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-29 12:16:14] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-05-29 12:16:15] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2024-05-29 12:16:16] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2024-05-29 12:16:16] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-29 12:16:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2171 ms
[2024-05-29 12:16:16] [INFO ] After 8420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 320 ms.
[2024-05-29 12:16:16] [INFO ] After 9024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 110 ms.
Support contains 44 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 783 transition count 556
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 159 rules applied. Total rules applied 316 place count 626 transition count 554
Reduce places removed 1 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 332 place count 625 transition count 539
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 347 place count 610 transition count 539
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 347 place count 610 transition count 497
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 431 place count 568 transition count 497
Discarding 67 places :
Symmetric choice reduction at 4 with 67 rule applications. Total rules 498 place count 501 transition count 430
Iterating global reduction 4 with 67 rules applied. Total rules applied 565 place count 501 transition count 430
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 565 place count 501 transition count 405
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 615 place count 476 transition count 405
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 905 place count 331 transition count 260
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 951 place count 308 transition count 260
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 953 place count 308 transition count 258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 955 place count 306 transition count 258
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 980 place count 306 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 981 place count 305 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 982 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 982 place count 304 transition count 255
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 986 place count 302 transition count 255
Applied a total of 986 rules in 180 ms. Remains 302 /783 variables (removed 481) and now considering 255/713 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 302/783 places, 255/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 255 rows 302 cols
[2024-05-29 12:16:17] [INFO ] Computed 110 invariants in 9 ms
[2024-05-29 12:16:17] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:16:17] [INFO ] [Nat]Absence check using 110 positive place invariants in 26 ms returned sat
[2024-05-29 12:16:17] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:16:17] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 12:16:17] [INFO ] After 88ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:16:17] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-29 12:16:17] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-29 12:16:17] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 21 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 255/255 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 301 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2 place count 301 transition count 246
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 293 transition count 246
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 56 place count 274 transition count 227
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 271 transition count 227
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 271 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 270 transition count 226
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 270 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 269 transition count 225
Applied a total of 67 rules in 57 ms. Remains 269 /302 variables (removed 33) and now considering 225/255 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 269/302 places, 225/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 269 cols
[2024-05-29 12:16:17] [INFO ] Computed 110 invariants in 9 ms
[2024-05-29 12:16:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:16:17] [INFO ] [Nat]Absence check using 110 positive place invariants in 13 ms returned sat
[2024-05-29 12:16:18] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:18] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 12:16:18] [INFO ] After 31ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:16:18] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:16:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
[2024-05-29 12:16:18] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:16:18] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:16:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 306 ms
[2024-05-29 12:16:18] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-29 12:16:18] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 268 transition count 224
Applied a total of 2 rules in 12 ms. Remains 268 /269 variables (removed 1) and now considering 224/225 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 268/269 places, 224/225 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 809315 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 809315 steps, saw 636335 distinct states, run finished after 3002 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 268 cols
[2024-05-29 12:16:21] [INFO ] Computed 110 invariants in 5 ms
[2024-05-29 12:16:21] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:16:21] [INFO ] [Nat]Absence check using 110 positive place invariants in 18 ms returned sat
[2024-05-29 12:16:21] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:21] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 12:16:21] [INFO ] After 29ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:16:21] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:16:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2024-05-29 12:16:21] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 12:16:21] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 268 /268 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 268/268 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 268 /268 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-29 12:16:21] [INFO ] Invariant cache hit.
[2024-05-29 12:16:22] [INFO ] Implicit Places using invariants in 161 ms returned [251, 255]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 164 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 266/268 places, 224/224 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 264 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 222
Applied a total of 4 rules in 10 ms. Remains 264 /266 variables (removed 2) and now considering 222/224 (removed 2) transitions.
// Phase 1: matrix 222 rows 264 cols
[2024-05-29 12:16:22] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 12:16:22] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-29 12:16:22] [INFO ] Invariant cache hit.
[2024-05-29 12:16:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 12:16:22] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 264/268 places, 222/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 582 ms. Remains : 264/268 places, 222/224 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 792708 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 792708 steps, saw 635315 distinct states, run finished after 3004 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:16:25] [INFO ] Invariant cache hit.
[2024-05-29 12:16:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:16:25] [INFO ] [Nat]Absence check using 108 positive place invariants in 14 ms returned sat
[2024-05-29 12:16:25] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 12:16:25] [INFO ] After 31ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:16:26] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:16:26] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:16:26] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:16:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:16:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 272 ms
[2024-05-29 12:16:26] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 12:16:26] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 264 /264 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 264/264 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-29 12:16:26] [INFO ] Invariant cache hit.
[2024-05-29 12:16:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 12:16:26] [INFO ] Invariant cache hit.
[2024-05-29 12:16:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 12:16:26] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-29 12:16:26] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 12:16:26] [INFO ] Invariant cache hit.
[2024-05-29 12:16:26] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 264/264 places, 222/222 transitions.
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 264 transition count 222
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 264 transition count 221
Applied a total of 45 rules in 17 ms. Remains 264 /264 variables (removed 0) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 264 cols
[2024-05-29 12:16:26] [INFO ] Computed 108 invariants in 2 ms
[2024-05-29 12:16:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:16:26] [INFO ] [Nat]Absence check using 108 positive place invariants in 15 ms returned sat
[2024-05-29 12:16:27] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 12:16:27] [INFO ] After 45ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:16:27] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:16:27] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:16:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:16:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2024-05-29 12:16:27] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 12:16:27] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:16:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 12:16:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 264 places, 222 transitions and 915 arcs took 3 ms.
[2024-05-29 12:16:27] [INFO ] Flatten gal took : 59 ms
Total runtime 21350 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-010B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
ReachabilityFireability

FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716984988718

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 ShieldPPPt-PT-010B-ReachabilityFireability-2024-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ShieldPPPt-PT-010B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ShieldPPPt-PT-010B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 ShieldPPPt-PT-010B-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for ShieldPPPt-PT-010B-ReachabilityFireability-2024-00
lola: result : true
lola: markings : 40
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for ShieldPPPt-PT-010B-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 5 (type EQUN) for ShieldPPPt-PT-010B-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ShieldPPPt-PT-010B-ReachabilityFireability-2024-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-010B-ReachabilityFireability-2024-00: AG false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-010B, 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 r373-tall-171683789200390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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