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.r597-smll-171734926500085.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 MedleyA-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 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 MedleyA-PT-17-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717363214792

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=MedleyA-PT-17
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 21:20:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:20:17] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-06-02 21:20:17] [INFO ] Transformed 248 places.
[2024-06-02 21:20:17] [INFO ] Transformed 591 transitions.
[2024-06-02 21:20:17] [INFO ] Found NUPN structural information;
[2024-06-02 21:20:17] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Incomplete random walk after 10000 steps, including 344 resets, run finished after 1097 ms. (steps per millisecond=9 ) properties (out of 16) seen :1
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 353618 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{1=1, 3=1, 4=1, 5=1, 8=1, 9=1, 12=1, 14=1}
Probabilistic random walk after 353618 steps, saw 64967 distinct states, run finished after 3004 ms. (steps per millisecond=117 ) properties seen :8
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 589 rows 248 cols
[2024-06-02 21:20:22] [INFO ] Computed 7 invariants in 23 ms
[2024-06-02 21:20:23] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 21:20:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 21:20:30] [INFO ] After 7244ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2024-06-02 21:20:30] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 8 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 2 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1644 ms
[2024-06-02 21:20:32] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2024-06-02 21:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-06-02 21:20:41] [INFO ] After 18325ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 1444 ms.
[2024-06-02 21:20:43] [INFO ] After 20027ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 39 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 161 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 246 transition count 563
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 34 rules applied. Total rules applied 58 place count 223 transition count 552
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 214 transition count 552
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 67 place count 214 transition count 536
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 99 place count 198 transition count 536
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 145 place count 152 transition count 455
Iterating global reduction 3 with 46 rules applied. Total rules applied 191 place count 152 transition count 455
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 223 place count 152 transition count 423
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 223 place count 152 transition count 420
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 149 transition count 420
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 147 transition count 416
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 147 transition count 416
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 251 place count 138 transition count 407
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 257 place count 135 transition count 418
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 267 place count 135 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 271 place count 131 transition count 404
Iterating global reduction 4 with 4 rules applied. Total rules applied 275 place count 131 transition count 404
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 281 place count 128 transition count 409
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 302 place count 128 transition count 388
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 331 place count 107 transition count 380
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 107 transition count 379
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 335 place count 107 transition count 397
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 342 place count 104 transition count 393
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 104 transition count 393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 103 transition count 392
Applied a total of 344 rules in 236 ms. Remains 103 /248 variables (removed 145) and now considering 392/589 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 103/248 places, 392/589 transitions.
Incomplete random walk after 10000 steps, including 829 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 685952 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{0=1}
Probabilistic random walk after 685952 steps, saw 120684 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2024-06-02 21:20:46] [INFO ] Flow matrix only has 362 transitions (discarded 30 similar events)
// Phase 1: matrix 362 rows 103 cols
[2024-06-02 21:20:46] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:20:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:20:47] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:20:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:20:47] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:20:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 21:20:50] [INFO ] After 2506ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:20:52] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 0 ms to minimize.
[2024-06-02 21:20:52] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2024-06-02 21:20:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 603 ms
[2024-06-02 21:20:52] [INFO ] After 4814ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-06-02 21:20:52] [INFO ] After 5282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 34 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 392/392 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 103 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 391
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 100 transition count 401
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 399
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 100 transition count 395
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 21 place count 96 transition count 390
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 25 place count 96 transition count 386
Applied a total of 25 rules in 62 ms. Remains 96 /103 variables (removed 7) and now considering 386/392 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 96/103 places, 386/392 transitions.
Incomplete random walk after 10000 steps, including 902 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1130738 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{0=1}
Probabilistic random walk after 1130738 steps, saw 193797 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2024-06-02 21:20:55] [INFO ] Flow matrix only has 349 transitions (discarded 37 similar events)
// Phase 1: matrix 349 rows 96 cols
[2024-06-02 21:20:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:20:55] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:20:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:20:56] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:20:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:20:56] [INFO ] After 110ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:20:57] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:20:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 21:20:57] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-06-02 21:20:57] [INFO ] After 1507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 386/386 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 388
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 95 transition count 386
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 95 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 94 transition count 400
Applied a total of 6 rules in 31 ms. Remains 94 /96 variables (removed 2) and now considering 400/386 (removed -14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 94/96 places, 400/386 transitions.
Incomplete random walk after 10000 steps, including 903 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1421399 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 1421399 steps, saw 264711 distinct states, run finished after 3004 ms. (steps per millisecond=473 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:21:00] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
// Phase 1: matrix 361 rows 94 cols
[2024-06-02 21:21:00] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:21:00] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:21:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:21:00] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:21:00] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:21:01] [INFO ] After 927ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:21:02] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2024-06-02 21:21:03] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2024-06-02 21:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1468 ms
[2024-06-02 21:21:03] [INFO ] After 2477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 725 ms.
[2024-06-02 21:21:04] [INFO ] After 3693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 32 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 400/400 transitions.
Applied a total of 0 rules in 14 ms. Remains 94 /94 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 94/94 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-02 21:21:04] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
[2024-06-02 21:21:04] [INFO ] Invariant cache hit.
[2024-06-02 21:21:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:21:04] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
[2024-06-02 21:21:04] [INFO ] Invariant cache hit.
[2024-06-02 21:21:04] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:21:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 21:21:04] [INFO ] Redundant transitions in 36 ms returned []
[2024-06-02 21:21:04] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
[2024-06-02 21:21:04] [INFO ] Invariant cache hit.
[2024-06-02 21:21:04] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 94/94 places, 400/400 transitions.
Graph (trivial) has 73 edges and 94 vertex of which 9 / 94 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 13 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 87 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 87 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 86 transition count 342
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 31 place count 86 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 86 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 85 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 84 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 84 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 38 place count 84 transition count 314
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 4 with 2 rules applied. Total rules applied 40 place count 83 transition count 313
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 83 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 82 transition count 311
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 82 transition count 311
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 82 transition count 310
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 82 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 81 transition count 309
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 49 place count 81 transition count 309
Applied a total of 49 rules in 73 ms. Remains 81 /94 variables (removed 13) and now considering 309/400 (removed 91) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 309 rows 81 cols
[2024-06-02 21:21:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:21:04] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:21:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:21:05] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2024-06-02 21:21:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 552 ms
[2024-06-02 21:21:06] [INFO ] After 1582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 318 ms.
[2024-06-02 21:21:06] [INFO ] After 1943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:21:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-02 21:21:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 400 transitions and 2415 arcs took 5 ms.
[2024-06-02 21:21:07] [INFO ] Flatten gal took : 131 ms
Total runtime 49723 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-17
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityFireability

FORMULA MedleyA-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717363268619

--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 MedleyA-PT-17-ReachabilityFireability-2024-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 MedleyA-PT-17-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 MedleyA-PT-17-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 MedleyA-PT-17-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 3 (type FNDP) for MedleyA-PT-17-ReachabilityFireability-2024-11
lola: result : true
lola: fired transitions : 29
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for MedleyA-PT-17-ReachabilityFireability-2024-11 (obsolete)
lola: CANCELED task # 6 (type SRCH) for MedleyA-PT-17-ReachabilityFireability-2024-11 (obsolete)
lola: CANCELED task # 7 (type EXCL) for MedleyA-PT-17-ReachabilityFireability-2024-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-17-ReachabilityFireability-2024-11: EF true findpath


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="MedleyA-PT-17"
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 MedleyA-PT-17, 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 r597-smll-171734926500085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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