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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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-08-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717362012154

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-08
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 21:00:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:00:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:00:15] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-02 21:00:15] [INFO ] Transformed 147 places.
[2024-06-02 21:00:15] [INFO ] Transformed 312 transitions.
[2024-06-02 21:00:15] [INFO ] Found NUPN structural information;
[2024-06-02 21:00:15] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 494 resets, run finished after 923 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 292572 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{6=1, 8=1}
Probabilistic random walk after 292572 steps, saw 57939 distinct states, run finished after 3006 ms. (steps per millisecond=97 ) properties seen :2
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 21:00:19] [INFO ] Computed 11 invariants in 17 ms
[2024-06-02 21:00:20] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 21:00:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 21:00:20] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:00:22] [INFO ] After 1394ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2024-06-02 21:00:22] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 9 ms to minimize.
[2024-06-02 21:00:22] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 334 ms
[2024-06-02 21:00:23] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-06-02 21:00:23] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-06-02 21:00:23] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2024-06-02 21:00:23] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:00:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:00:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2024-06-02 21:00:24] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 4 ms to minimize.
[2024-06-02 21:00:24] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2024-06-02 21:00:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2024-06-02 21:00:24] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-06-02 21:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-06-02 21:00:24] [INFO ] After 4107ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :10
Attempting to minimize the solution found.
Minimization took 1252 ms.
[2024-06-02 21:00:26] [INFO ] After 5648ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :10
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 10 different solutions.
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 153 ms.
Support contains 104 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 131 transition count 297
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 131 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 30 place count 131 transition count 294
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 131 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 38 place count 131 transition count 285
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 130 transition count 285
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 130 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 129 transition count 284
Applied a total of 42 rules in 80 ms. Remains 129 /147 variables (removed 18) and now considering 284/312 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 129/147 places, 284/312 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 7) seen :1
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 152 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 284 rows 129 cols
[2024-06-02 21:00:27] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 21:00:27] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 21:00:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:00:27] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-02 21:00:28] [INFO ] After 836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 21:00:29] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-06-02 21:00:30] [INFO ] After 2221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 695 ms.
[2024-06-02 21:00:30] [INFO ] After 3039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 34 ms.
Support contains 101 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 284/284 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 129 transition count 283
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 282
Applied a total of 4 rules in 21 ms. Remains 127 /129 variables (removed 2) and now considering 282/284 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 127/129 places, 282/284 transitions.
Incomplete random walk after 10000 steps, including 477 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 496005 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{2=1}
Probabilistic random walk after 496005 steps, saw 95902 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :1
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 282 rows 127 cols
[2024-06-02 21:00:34] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:00:34] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 21:00:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:00:35] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:00:36] [INFO ] After 1421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 21:00:36] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-06-02 21:00:37] [INFO ] After 2163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 557 ms.
[2024-06-02 21:00:37] [INFO ] After 2814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 84 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 282/282 transitions.
Graph (complete) has 467 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 117 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 117 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 116 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 116 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 21 place count 115 transition count 279
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 33 place count 115 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 115 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 114 transition count 266
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 114 transition count 266
Applied a total of 37 rules in 45 ms. Remains 114 /127 variables (removed 13) and now considering 266/282 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 114/127 places, 266/282 transitions.
Incomplete random walk after 10000 steps, including 489 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 570768 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 570768 steps, saw 104210 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :3
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 266 rows 114 cols
[2024-06-02 21:00:41] [INFO ] Computed 9 invariants in 12 ms
[2024-06-02 21:00:41] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:00:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:00:41] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:00:41] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:00:42] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2024-06-02 21:00:42] [INFO ] After 888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 50 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 266/266 transitions.
Graph (complete) has 437 edges and 114 vertex of which 112 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 112 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 110 transition count 259
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 110 transition count 255
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 106 transition count 255
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 27 place count 96 transition count 243
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 96 transition count 243
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 94 transition count 241
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 94 transition count 241
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 91 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 90 transition count 247
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 90 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 89 transition count 245
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 89 transition count 245
Applied a total of 53 rules in 44 ms. Remains 89 /114 variables (removed 25) and now considering 245/266 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 89/114 places, 245/266 transitions.
Incomplete random walk after 10000 steps, including 524 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 776689 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 776689 steps, saw 154635 distinct states, run finished after 3002 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 245 rows 89 cols
[2024-06-02 21:00:45] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 21:00:45] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:00:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:00:46] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 21:00:46] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:00:46] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 212 ms.
[2024-06-02 21:00:46] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 50 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 89/89 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-06-02 21:00:46] [INFO ] Invariant cache hit.
[2024-06-02 21:00:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 21:00:46] [INFO ] Invariant cache hit.
[2024-06-02 21:00:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 21:00:47] [INFO ] Redundant transitions in 18 ms returned []
[2024-06-02 21:00:47] [INFO ] Invariant cache hit.
[2024-06-02 21:00:47] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 52 transitions.
Found 52 dead transitions using SMT.
Drop transitions removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 193/245 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-06-02 21:00:47] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 423 ms. Remains : 89/89 places, 193/245 transitions.
Incomplete random walk after 10000 steps, including 513 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 893277 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 893277 steps, saw 177748 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 193 rows 89 cols
[2024-06-02 21:00:50] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:00:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:00:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:00:50] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-02 21:00:50] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:00:51] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 205 ms.
[2024-06-02 21:00:51] [INFO ] After 753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 50 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 193/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 89/89 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 193/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-06-02 21:00:51] [INFO ] Invariant cache hit.
[2024-06-02 21:00:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 21:00:51] [INFO ] Invariant cache hit.
[2024-06-02 21:00:51] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 21:00:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:00:51] [INFO ] Invariant cache hit.
[2024-06-02 21:00:51] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 89/89 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-02 21:00:51] [INFO ] Invariant cache hit.
[2024-06-02 21:00:51] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:00:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:00:51] [INFO ] [Nat]Absence check using 4 positive and 4 generalized place invariants in 3 ms returned sat
[2024-06-02 21:00:52] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:00:52] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-06-02 21:00:52] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:00:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-02 21:00:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 193 transitions and 904 arcs took 3 ms.
[2024-06-02 21:00:52] [INFO ] Flatten gal took : 80 ms
Total runtime 37942 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-08
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability

FORMULA MedleyA-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MedleyA-PT-08-ReachabilityFireability-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717362054263

--------------------
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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 3 MedleyA-PT-08-ReachabilityFireability-2024-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 MedleyA-PT-08-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 MedleyA-PT-08-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 3 MedleyA-PT-08-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 10 (type SRCH) for MedleyA-PT-08-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 18
lola: fired transitions : 17
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for MedleyA-PT-08-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 8 (type EQUN) for MedleyA-PT-08-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 11 (type EXCL) for MedleyA-PT-08-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 18 (type EXCL) for 0 MedleyA-PT-08-ReachabilityFireability-2024-04
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 0 MedleyA-PT-08-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 MedleyA-PT-08-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 0 MedleyA-PT-08-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type FNDP) for MedleyA-PT-08-ReachabilityFireability-2024-15
lola: result : true
lola: fired transitions : 16
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 14 (type FNDP) for MedleyA-PT-08-ReachabilityFireability-2024-04
lola: result : true
lola: fired transitions : 334
lola: tried executions : 17
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 15 (type EQUN) for MedleyA-PT-08-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 17 (type SRCH) for MedleyA-PT-08-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 18 (type EXCL) for MedleyA-PT-08-ReachabilityFireability-2024-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-08-ReachabilityFireability-2024-04: AG false findpath
MedleyA-PT-08-ReachabilityFireability-2024-15: AG false tandem / insertion


Time elapsed: 1 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-08"
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-08, 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-171734926400040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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