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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 28K 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-04-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717361625576

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-04
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 20:53:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:53:48] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-06-02 20:53:48] [INFO ] Transformed 115 places.
[2024-06-02 20:53:48] [INFO ] Transformed 107 transitions.
[2024-06-02 20:53:48] [INFO ] Found NUPN structural information;
[2024-06-02 20:53:48] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 165 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 283 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 16) seen :5
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 11) seen :1
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :1
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 107 rows 115 cols
[2024-06-02 20:53:50] [INFO ] Computed 9 invariants in 9 ms
[2024-06-02 20:53:51] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 20:53:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 20:53:51] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2024-06-02 20:53:51] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 9 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 227 ms
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:53:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 242 ms
[2024-06-02 20:53:53] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:53:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:53:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-06-02 20:53:53] [INFO ] After 1852ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 201 ms.
[2024-06-02 20:53:53] [INFO ] After 2242ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (false)on formula MedleyA-PT-04-ReachabilityFireability-2024-05
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (true)on formula MedleyA-PT-04-ReachabilityFireability-2024-03
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 58 ms.
Support contains 56 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Graph (complete) has 207 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 114 transition count 103
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 110 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 19 place count 105 transition count 98
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 19 place count 105 transition count 93
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 29 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 98 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 98 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 93 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 93 transition count 86
Applied a total of 44 rules in 50 ms. Remains 93 /115 variables (removed 22) and now considering 86/107 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 93/115 places, 86/107 transitions.
Incomplete random walk after 10000 steps, including 393 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :1
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 20:53:54] [INFO ] Computed 8 invariants in 10 ms
[2024-06-02 20:53:54] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:53:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:54] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:53:54] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:53:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 338 ms
[2024-06-02 20:53:54] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-06-02 20:53:54] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 39 ms.
Support contains 38 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 86/86 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 2 rules applied. Total rules applied 2 place count 93 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 91 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 91 transition count 82
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 89 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 87 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 87 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 87 transition count 79
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 14 place count 86 transition count 79
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 2 with 12 rules applied. Total rules applied 26 place count 80 transition count 73
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 80 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 78 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 77 transition count 70
Applied a total of 31 rules in 34 ms. Remains 77 /93 variables (removed 16) and now considering 70/86 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 77/93 places, 70/86 transitions.
Incomplete random walk after 10000 steps, including 593 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 236 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 224 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2831236 steps, run timeout after 3001 ms. (steps per millisecond=943 ) properties seen :{1=1}
Probabilistic random walk after 2831236 steps, saw 486092 distinct states, run finished after 3002 ms. (steps per millisecond=943 ) properties seen :1
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 77 cols
[2024-06-02 20:53:58] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:53:58] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:53:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:58] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:53:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 218 ms
[2024-06-02 20:53:58] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-06-02 20:53:58] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 37 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 77/77 places, 70/70 transitions.
Incomplete random walk after 10000 steps, including 618 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3517066 steps, run timeout after 3001 ms. (steps per millisecond=1171 ) properties seen :{}
Probabilistic random walk after 3517066 steps, saw 600166 distinct states, run finished after 3002 ms. (steps per millisecond=1171 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:54:01] [INFO ] Invariant cache hit.
[2024-06-02 20:54:01] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:54:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:54:01] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:54:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 228 ms
[2024-06-02 20:54:01] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-06-02 20:54:02] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 37 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 77/77 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-02 20:54:02] [INFO ] Invariant cache hit.
[2024-06-02 20:54:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:54:02] [INFO ] Invariant cache hit.
[2024-06-02 20:54:02] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 20:54:02] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 20:54:02] [INFO ] Invariant cache hit.
[2024-06-02 20:54:02] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-02 20:54:02] [INFO ] Invariant cache hit.
[2024-06-02 20:54:02] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:54:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 20:54:02] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 6 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:54:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 243 ms
[2024-06-02 20:54:02] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-06-02 20:54:02] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-02 20:54:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 70 transitions and 219 arcs took 1 ms.
[2024-06-02 20:54:03] [INFO ] Flatten gal took : 51 ms
Total runtime 14763 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-04
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

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

BK_STOP 1717361644398

--------------------
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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 MedleyA-PT-04-ReachabilityFireability-2024-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 MedleyA-PT-04-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 MedleyA-PT-04-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 MedleyA-PT-04-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type EXCL) for MedleyA-PT-04-ReachabilityFireability-2024-02
lola: result : false
lola: markings : 38241
lola: fired transitions : 42798
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for MedleyA-PT-04-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 4 (type EQUN) for MedleyA-PT-04-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 6 (type SRCH) for MedleyA-PT-04-ReachabilityFireability-2024-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-04-ReachabilityFireability-2024-02: EF false tandem / relaxed


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-04"
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-04, 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-171734926300020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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