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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 43K 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-12-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717362540280

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 21:09:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:09:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:09:03] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-02 21:09:03] [INFO ] Transformed 172 places.
[2024-06-02 21:09:03] [INFO ] Transformed 166 transitions.
[2024-06-02 21:09:03] [INFO ] Found NUPN structural information;
[2024-06-02 21:09:03] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 203 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 14) seen :9
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :1
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 166 rows 172 cols
[2024-06-02 21:09:04] [INFO ] Computed 24 invariants in 12 ms
[2024-06-02 21:09:04] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 21:09:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2024-06-02 21:09:05] [INFO ] [Nat]Absence check using 11 positive and 13 generalized place invariants in 43 ms returned sat
[2024-06-02 21:09:05] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-06-02 21:09:05] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 9 ms to minimize.
[2024-06-02 21:09:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-06-02 21:09:05] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-06-02 21:09:05] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 41 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 167 transition count 158
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 159 transition count 156
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 158 transition count 153
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 155 transition count 153
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 30 place count 155 transition count 136
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 64 place count 138 transition count 136
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 75 place count 127 transition count 114
Iterating global reduction 4 with 11 rules applied. Total rules applied 86 place count 127 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 127 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 126 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 125 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 125 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 124 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 124 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 120 place count 110 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 128 place count 106 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 106 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 104 transition count 98
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 104 transition count 98
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 104 transition count 98
Applied a total of 134 rules in 127 ms. Remains 104 /172 variables (removed 68) and now considering 98/166 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 104/172 places, 98/166 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 104 cols
[2024-06-02 21:09:05] [INFO ] Computed 19 invariants in 11 ms
[2024-06-02 21:09:06] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:09:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-02 21:09:06] [INFO ] [Nat]Absence check using 12 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-02 21:09:06] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:09:06] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 21:09:06] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 103 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 102 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 102 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 101 transition count 95
Applied a total of 6 rules in 25 ms. Remains 101 /104 variables (removed 3) and now considering 95/98 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 101/104 places, 95/98 transitions.
Incomplete random walk after 10000 steps, including 405 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2772873 steps, run timeout after 3001 ms. (steps per millisecond=923 ) properties seen :{}
Probabilistic random walk after 2772873 steps, saw 435586 distinct states, run finished after 3003 ms. (steps per millisecond=923 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 101 cols
[2024-06-02 21:09:09] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:09:09] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:09:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-02 21:09:09] [INFO ] [Nat]Absence check using 12 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-02 21:09:09] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-02 21:09:09] [INFO ] After 186ms 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 21:09:09] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-02 21:09:09] [INFO ] Invariant cache hit.
[2024-06-02 21:09:09] [INFO ] Implicit Places using invariants in 111 ms returned [26, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/101 places, 95/95 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 99 transition count 94
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 98 transition count 94
Applied a total of 2 rules in 6 ms. Remains 98 /99 variables (removed 1) and now considering 94/95 (removed 1) transitions.
// Phase 1: matrix 94 rows 98 cols
[2024-06-02 21:09:09] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:09:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:09:09] [INFO ] Invariant cache hit.
[2024-06-02 21:09:10] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/101 places, 94/95 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 333 ms. Remains : 98/101 places, 94/95 transitions.
Incomplete random walk after 10000 steps, including 412 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2886354 steps, run timeout after 3001 ms. (steps per millisecond=961 ) properties seen :{}
Probabilistic random walk after 2886354 steps, saw 454617 distinct states, run finished after 3001 ms. (steps per millisecond=961 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:09:13] [INFO ] Invariant cache hit.
[2024-06-02 21:09:13] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:09:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-02 21:09:13] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-02 21:09:13] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:09:13] [INFO ] After 117ms 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 21:09:13] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 98/98 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-02 21:09:13] [INFO ] Invariant cache hit.
[2024-06-02 21:09:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:09:13] [INFO ] Invariant cache hit.
[2024-06-02 21:09:13] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 21:09:13] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:09:13] [INFO ] Invariant cache hit.
[2024-06-02 21:09:13] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:09:13] [INFO ] Invariant cache hit.
[2024-06-02 21:09:13] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:09:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 21:09:13] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:09:13] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:09:13] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 21:09:14] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:09:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-02 21:09:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 94 transitions and 289 arcs took 2 ms.
[2024-06-02 21:09:14] [INFO ] Flatten gal took : 54 ms
Total runtime 11463 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-12
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityCardinality

FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717362555894

--------------------
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 ReachabilityCardinality -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/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 MedleyA-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 MedleyA-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 MedleyA-PT-12-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type SRCH) for 0 MedleyA-PT-12-ReachabilityCardinality-2024-09
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: FINISHED task # 4 (type FNDP) for MedleyA-PT-12-ReachabilityCardinality-2024-09
lola: result : true
lola: fired transitions : 87345
lola: tried executions : 4543
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for MedleyA-PT-12-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 7 (type SRCH) for MedleyA-PT-12-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 8 (type EXCL) for MedleyA-PT-12-ReachabilityCardinality-2024-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-12-ReachabilityCardinality-2024-09: AG false findpath


Time elapsed: 0 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
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-12, examination is ReachabilityCardinality"
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-171734926400059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;