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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 238K 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-22-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717367823590

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-22
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 22:37:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:37:06] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-06-02 22:37:06] [INFO ] Transformed 307 places.
[2024-06-02 22:37:06] [INFO ] Transformed 740 transitions.
[2024-06-02 22:37:06] [INFO ] Found NUPN structural information;
[2024-06-02 22:37:06] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 285 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 16) seen :2
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :1
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 740 rows 307 cols
[2024-06-02 22:37:08] [INFO ] Computed 24 invariants in 40 ms
[2024-06-02 22:37:10] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-06-02 22:37:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-06-02 22:37:10] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2024-06-02 22:37:11] [INFO ] After 1437ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 9 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2024-06-02 22:37:22] [INFO ] After 12198ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 896 ms.
[2024-06-02 22:37:23] [INFO ] After 13451ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 43 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 300 transition count 711
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 275 transition count 707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 274 transition count 707
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 57 place count 274 transition count 701
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 69 place count 268 transition count 701
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 150 place count 187 transition count 605
Iterating global reduction 3 with 81 rules applied. Total rules applied 231 place count 187 transition count 605
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 237 place count 187 transition count 599
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 256 place count 168 transition count 560
Iterating global reduction 4 with 19 rules applied. Total rules applied 275 place count 168 transition count 560
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 281 place count 162 transition count 544
Iterating global reduction 4 with 6 rules applied. Total rules applied 287 place count 162 transition count 544
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 305 place count 153 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 306 place count 152 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 152 transition count 534
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 311 place count 150 transition count 544
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 326 place count 150 transition count 529
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 334 place count 150 transition count 521
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 342 place count 142 transition count 521
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 350 place count 142 transition count 514
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 359 place count 134 transition count 513
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 373 place count 134 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 133 transition count 512
Applied a total of 374 rules in 269 ms. Remains 133 /307 variables (removed 174) and now considering 512/740 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 133/307 places, 512/740 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 8) seen :2
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 512 rows 133 cols
[2024-06-02 22:37:24] [INFO ] Computed 23 invariants in 4 ms
[2024-06-02 22:37:24] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:37:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 22:37:24] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 10 ms returned sat
[2024-06-02 22:37:25] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 22:37:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:37:25] [INFO ] After 452ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 22:37:26] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 387 ms.
[2024-06-02 22:37:26] [INFO ] After 1877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 55 ms.
Support contains 22 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 512/512 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 133 transition count 511
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 132 transition count 511
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 129 transition count 507
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 129 transition count 507
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 127 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 127 transition count 498
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 492
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 120 transition count 491
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 120 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 119 transition count 502
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 119 transition count 497
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 38 place count 114 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 113 transition count 494
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 113 transition count 494
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 113 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 112 transition count 493
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 112 transition count 630
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 106 transition count 630
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 61 place count 106 transition count 630
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 105 transition count 629
Applied a total of 62 rules in 136 ms. Remains 105 /133 variables (removed 28) and now considering 629/512 (removed -117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 105/133 places, 629/512 transitions.
Incomplete random walk after 10000 steps, including 625 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 6) seen :1
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 629 rows 105 cols
[2024-06-02 22:37:27] [INFO ] Computed 23 invariants in 7 ms
[2024-06-02 22:37:27] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:37:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 22:37:27] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 22:37:28] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 22:37:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-02 22:37:28] [INFO ] After 376ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 22:37:28] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 490 ms.
[2024-06-02 22:37:29] [INFO ] After 1985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 21 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 629/629 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 104 transition count 631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 622
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 618
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 618
Applied a total of 6 rules in 33 ms. Remains 102 /105 variables (removed 3) and now considering 618/629 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 102/105 places, 618/629 transitions.
Incomplete random walk after 10000 steps, including 615 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 372110 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 372110 steps, saw 75970 distinct states, run finished after 3003 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 618 rows 102 cols
[2024-06-02 22:37:33] [INFO ] Computed 23 invariants in 4 ms
[2024-06-02 22:37:33] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:37:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 22:37:33] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 22:37:33] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 22:37:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-02 22:37:34] [INFO ] After 374ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 22:37:34] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2024-06-02 22:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-06-02 22:37:34] [INFO ] After 943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 375 ms.
[2024-06-02 22:37:35] [INFO ] After 2007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 37 ms.
Support contains 17 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 618/618 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 617
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 617
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 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 616
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 100 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 615
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 99 transition count 614
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 97 transition count 613
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 97 transition count 612
Applied a total of 12 rules in 70 ms. Remains 97 /102 variables (removed 5) and now considering 612/618 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 97/102 places, 612/618 transitions.
Incomplete random walk after 10000 steps, including 637 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 385439 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385439 steps, saw 78351 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 612 rows 97 cols
[2024-06-02 22:37:38] [INFO ] Computed 23 invariants in 10 ms
[2024-06-02 22:37:38] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 22:37:38] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2024-06-02 22:37:39] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:37:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 22:37:39] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2024-06-02 22:37:39] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:37:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-02 22:37:39] [INFO ] After 266ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:37:40] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2024-06-02 22:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-06-02 22:37:40] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 258 ms.
[2024-06-02 22:37:40] [INFO ] After 1513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 22 ms.
Support contains 17 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 612/612 transitions.
Applied a total of 0 rules in 13 ms. Remains 97 /97 variables (removed 0) and now considering 612/612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 97/97 places, 612/612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 612/612 transitions.
Applied a total of 0 rules in 12 ms. Remains 97 /97 variables (removed 0) and now considering 612/612 (removed 0) transitions.
[2024-06-02 22:37:40] [INFO ] Invariant cache hit.
[2024-06-02 22:37:40] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 22:37:40] [INFO ] Invariant cache hit.
[2024-06-02 22:37:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-02 22:37:41] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-06-02 22:37:41] [INFO ] Redundant transitions in 49 ms returned []
[2024-06-02 22:37:41] [INFO ] Invariant cache hit.
[2024-06-02 22:37:41] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 144 transitions.
Found 144 dead transitions using SMT.
Drop transitions removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 468/612 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 468
Applied a total of 1 rules in 10 ms. Remains 96 /97 variables (removed 1) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 96 cols
[2024-06-02 22:37:41] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 22:37:41] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 22:37:41] [INFO ] Invariant cache hit.
[2024-06-02 22:37:41] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 22:37:42] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/97 places, 468/612 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1517 ms. Remains : 96/97 places, 468/612 transitions.
Incomplete random walk after 10000 steps, including 650 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 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 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 517588 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517588 steps, saw 103851 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 22:37:45] [INFO ] Invariant cache hit.
[2024-06-02 22:37:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 22:37:45] [INFO ] [Real]Absence check using 11 positive and 11 generalized place invariants in 6 ms returned sat
[2024-06-02 22:37:45] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:37:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-02 22:37:45] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 6 ms returned sat
[2024-06-02 22:37:46] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:37:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 22:37:46] [INFO ] After 198ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:37:46] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 200 ms.
[2024-06-02 22:37:46] [INFO ] After 1071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 23 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 468/468 transitions.
Applied a total of 0 rules in 11 ms. Remains 96 /96 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 96/96 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 468/468 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-06-02 22:37:46] [INFO ] Invariant cache hit.
[2024-06-02 22:37:47] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 22:37:47] [INFO ] Invariant cache hit.
[2024-06-02 22:37:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-02 22:37:47] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-02 22:37:47] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 22:37:47] [INFO ] Invariant cache hit.
[2024-06-02 22:37:47] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 818 ms. Remains : 96/96 places, 468/468 transitions.
Graph (complete) has 616 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 91 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 91 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 90 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 90 transition count 450
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 90 transition count 450
Applied a total of 16 rules in 23 ms. Remains 90 /96 variables (removed 6) and now considering 450/468 (removed 18) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 450 rows 90 cols
[2024-06-02 22:37:47] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 22:37:47] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-02 22:37:47] [INFO ] [Real]Absence check using 11 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-02 22:37:47] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:37:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-02 22:37:47] [INFO ] [Nat]Absence check using 11 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-02 22:37:48] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:37:48] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 206 ms.
[2024-06-02 22:37:48] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:37:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-02 22:37:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 468 transitions and 2931 arcs took 5 ms.
[2024-06-02 22:37:49] [INFO ] Flatten gal took : 151 ms
Total runtime 42645 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-22
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA MedleyA-PT-22-ReachabilityFireability-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MedleyA-PT-22-ReachabilityFireability-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MedleyA-PT-22-ReachabilityFireability-2024-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MedleyA-PT-22-ReachabilityFireability-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717367870546

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 16 (type EXCL) for 3 MedleyA-PT-22-ReachabilityFireability-2024-09
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 MedleyA-PT-22-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 MedleyA-PT-22-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 15 (type SRCH) for 3 MedleyA-PT-22-ReachabilityFireability-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: 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: 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: FINISHED task # 15 (type SRCH) for MedleyA-PT-22-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 315
lola: fired transitions : 443
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for MedleyA-PT-22-ReachabilityFireability-2024-09 (obsolete)
lola: CANCELED task # 13 (type EQUN) for MedleyA-PT-22-ReachabilityFireability-2024-09 (obsolete)
lola: CANCELED task # 16 (type EXCL) for MedleyA-PT-22-ReachabilityFireability-2024-09 (obsolete)
lola: LAUNCH task # 34 (type EXCL) for 9 MedleyA-PT-22-ReachabilityFireability-2024-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 24 (type FNDP) for 6 MedleyA-PT-22-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 6 MedleyA-PT-22-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 6 MedleyA-PT-22-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type EQUN) for MedleyA-PT-22-ReachabilityFireability-2024-09
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for MedleyA-PT-22-ReachabilityFireability-2024-09
lola: result : unknown
lola: fired transitions : 389
lola: tried executions : 62
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-25.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 24 (type FNDP) for MedleyA-PT-22-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 12632
lola: tried executions : 953
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 25 (type EQUN) for MedleyA-PT-22-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 27 (type SRCH) for MedleyA-PT-22-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 18 (type FNDP) for 0 MedleyA-PT-22-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 0 MedleyA-PT-22-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 0 MedleyA-PT-22-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type EQUN) for MedleyA-PT-22-ReachabilityFireability-2024-12
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 21 (type SRCH) for MedleyA-PT-22-ReachabilityFireability-2024-06
lola: result : true
lola: markings : 51
lola: fired transitions : 52
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for MedleyA-PT-22-ReachabilityFireability-2024-06 (obsolete)
lola: CANCELED task # 19 (type EQUN) for MedleyA-PT-22-ReachabilityFireability-2024-06 (obsolete)
lola: LAUNCH task # 30 (type FNDP) for 9 MedleyA-PT-22-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type EQUN) for 9 MedleyA-PT-22-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type SRCH) for 9 MedleyA-PT-22-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 33 (type SRCH) for MedleyA-PT-22-ReachabilityFireability-2024-13
lola: result : true
lola: markings : 87
lola: fired transitions : 88
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 30 (type FNDP) for MedleyA-PT-22-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 31 (type EQUN) for MedleyA-PT-22-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 34 (type EXCL) for MedleyA-PT-22-ReachabilityFireability-2024-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-22-ReachabilityFireability-2024-06: EF true tandem / insertion
MedleyA-PT-22-ReachabilityFireability-2024-09: EF true tandem / insertion
MedleyA-PT-22-ReachabilityFireability-2024-12: EF true findpath
MedleyA-PT-22-ReachabilityFireability-2024-13: EF true 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="MedleyA-PT-22"
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-22, 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-171734926500110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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