About the Execution of 2023-gold for MedleyA-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 411.323 | 68451.00 | 119987.00 | 606.10 | FFTTTFFTFTTFTTTT | normal |
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-171734926500109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717367743794
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-22
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-06-02 22:35:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:35:46] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-02 22:35:46] [INFO ] Transformed 307 places.
[2024-06-02 22:35:46] [INFO ] Transformed 740 transitions.
[2024-06-02 22:35:46] [INFO ] Found NUPN structural information;
[2024-06-02 22:35:46] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 290 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 11) seen :2
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 740 rows 307 cols
[2024-06-02 22:35:48] [INFO ] Computed 24 invariants in 26 ms
[2024-06-02 22:35:49] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 22:35:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-02 22:35:49] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2024-06-02 22:35:51] [INFO ] After 1520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 10 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 81 places in 245 ms of which 1 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 1 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 0 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1536 ms
[2024-06-02 22:35:53] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-06-02 22:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 80 places in 286 ms of which 1 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 1 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 1 ms to minimize.
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 0 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 1 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 1 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2024-06-02 22:35:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1762 ms
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 0 ms to minimize.
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 57 places in 283 ms of which 1 ms to minimize.
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 1 ms to minimize.
[2024-06-02 22:35:56] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2024-06-02 22:35:57] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2024-06-02 22:35:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1374 ms
[2024-06-02 22:35:57] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 1 ms to minimize.
[2024-06-02 22:35:57] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 1 ms to minimize.
[2024-06-02 22:35:58] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 0 ms to minimize.
[2024-06-02 22:35:58] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 0 ms to minimize.
[2024-06-02 22:35:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1262 ms
[2024-06-02 22:35:59] [INFO ] After 9079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 10203 ms.
[2024-06-02 22:36:09] [INFO ] After 19673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 71 ms.
Support contains 112 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 305 transition count 729
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 17 rules applied. Total rules applied 29 place count 295 transition count 722
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 289 transition count 722
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 35 place count 289 transition count 720
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 287 transition count 720
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 87 place count 239 transition count 665
Iterating global reduction 3 with 48 rules applied. Total rules applied 135 place count 239 transition count 665
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 140 place count 239 transition count 660
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 237 transition count 654
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 237 transition count 654
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 236 transition count 652
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 236 transition count 652
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 172 place count 223 transition count 639
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 222 transition count 647
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 188 place count 222 transition count 633
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 221 transition count 632
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 196 place count 221 transition count 626
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 202 place count 215 transition count 626
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 206 place count 215 transition count 627
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 210 place count 211 transition count 627
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 219 place count 211 transition count 627
Applied a total of 219 rules in 316 ms. Remains 211 /307 variables (removed 96) and now considering 627/740 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 211/307 places, 627/740 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 7) seen :1
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :2
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 627 rows 211 cols
[2024-06-02 22:36:10] [INFO ] Computed 23 invariants in 7 ms
[2024-06-02 22:36:10] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:36:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 22:36:10] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 22:36:11] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:11] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-02 22:36:11] [INFO ] After 353ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:11] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2024-06-02 22:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-06-02 22:36:12] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2024-06-02 22:36:12] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2024-06-02 22:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2024-06-02 22:36:12] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-06-02 22:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-06-02 22:36:12] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 1 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 1 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 1 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2024-06-02 22:36:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1168 ms
[2024-06-02 22:36:13] [INFO ] After 2704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 322 ms.
[2024-06-02 22:36:14] [INFO ] After 3724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 78 ms.
Support contains 63 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 627/627 transitions.
Graph (complete) has 960 edges and 211 vertex of which 208 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 208 transition count 619
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 202 transition count 614
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 23 place count 197 transition count 614
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 197 transition count 613
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 196 transition count 613
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 36 place count 185 transition count 596
Iterating global reduction 3 with 11 rules applied. Total rules applied 47 place count 185 transition count 596
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 183 transition count 588
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 183 transition count 588
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 173 transition count 578
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 171 transition count 575
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 171 transition count 575
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 169 transition count 593
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 169 transition count 592
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 169 transition count 588
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 165 transition count 588
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 165 transition count 587
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 101 place count 159 transition count 586
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 102 place count 159 transition count 585
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 109 place count 159 transition count 585
Applied a total of 109 rules in 148 ms. Remains 159 /211 variables (removed 52) and now considering 585/627 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 159/211 places, 585/627 transitions.
Incomplete random walk after 10000 steps, including 514 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 398117 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398117 steps, saw 80007 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 22:36:18] [INFO ] Flow matrix only has 573 transitions (discarded 12 similar events)
// Phase 1: matrix 573 rows 159 cols
[2024-06-02 22:36:18] [INFO ] Computed 23 invariants in 7 ms
[2024-06-02 22:36:18] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:36:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 22:36:18] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 22:36:18] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:18] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-06-02 22:36:19] [INFO ] After 351ms SMT Verify possible using 185 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:19] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2024-06-02 22:36:19] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-06-02 22:36:19] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-06-02 22:36:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 599 ms
[2024-06-02 22:36:20] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:36:20] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:36:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2024-06-02 22:36:20] [INFO ] After 1659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 341 ms.
[2024-06-02 22:36:20] [INFO ] After 2603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 63 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 585/585 transitions.
Applied a total of 0 rules in 16 ms. Remains 159 /159 variables (removed 0) and now considering 585/585 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 159/159 places, 585/585 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 585/585 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 22:36:20] [INFO ] Flow matrix only has 573 transitions (discarded 12 similar events)
[2024-06-02 22:36:20] [INFO ] Invariant cache hit.
[2024-06-02 22:36:21] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-02 22:36:21] [INFO ] Flow matrix only has 573 transitions (discarded 12 similar events)
[2024-06-02 22:36:21] [INFO ] Invariant cache hit.
[2024-06-02 22:36:21] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-06-02 22:36:21] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-06-02 22:36:21] [INFO ] Redundant transitions in 43 ms returned []
[2024-06-02 22:36:21] [INFO ] Flow matrix only has 573 transitions (discarded 12 similar events)
[2024-06-02 22:36:21] [INFO ] Invariant cache hit.
[2024-06-02 22:36:21] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 144 transitions.
Found 144 dead transitions using SMT.
Drop transitions removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 441/585 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-06-02 22:36:22] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1179 ms. Remains : 159/159 places, 441/585 transitions.
Incomplete random walk after 10000 steps, including 526 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 434999 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434999 steps, saw 88967 distinct states, run finished after 3002 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 441 rows 159 cols
[2024-06-02 22:36:25] [INFO ] Computed 23 invariants in 16 ms
[2024-06-02 22:36:25] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:36:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 22:36:25] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 22:36:26] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 22:36:26] [INFO ] After 275ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:26] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2024-06-02 22:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-06-02 22:36:26] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2024-06-02 22:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-06-02 22:36:27] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2024-06-02 22:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-06-02 22:36:27] [INFO ] After 985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 306 ms.
[2024-06-02 22:36:27] [INFO ] After 1803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 65 ms.
Support contains 63 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 159/159 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-06-02 22:36:27] [INFO ] Invariant cache hit.
[2024-06-02 22:36:27] [INFO ] Implicit Places using invariants in 137 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/159 places, 441/441 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 159 ms. Remains : 158/159 places, 441/441 transitions.
Incomplete random walk after 10000 steps, including 517 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 441021 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 441021 steps, saw 90107 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 441 rows 158 cols
[2024-06-02 22:36:31] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 22:36:31] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:36:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 22:36:31] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 5 ms returned sat
[2024-06-02 22:36:31] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 22:36:32] [INFO ] After 261ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:36:32] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2024-06-02 22:36:32] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2024-06-02 22:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2024-06-02 22:36:32] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 238 ms.
[2024-06-02 22:36:32] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 39 ms.
Support contains 58 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 441/441 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 158 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 156 transition count 439
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 155 transition count 438
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 155 transition count 438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 154 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 10 place count 153 transition count 439
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 152 transition count 430
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 152 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 151 transition count 426
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 151 transition count 426
Applied a total of 14 rules in 31 ms. Remains 151 /158 variables (removed 7) and now considering 426/441 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 151/158 places, 426/441 transitions.
Incomplete random walk after 10000 steps, including 554 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 621354 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 621354 steps, saw 117620 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 426 rows 151 cols
[2024-06-02 22:36:36] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 22:36:36] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:36:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 22:36:36] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 5 ms returned sat
[2024-06-02 22:36:36] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:36:36] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-02 22:36:37] [INFO ] After 169ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 22:36:37] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2024-06-02 22:36:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 22:36:37] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2024-06-02 22:36:37] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-06-02 22:36:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2024-06-02 22:36:37] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-06-02 22:36:37] [INFO ] After 1433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 24 ms.
Support contains 56 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 426/426 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 428
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 150 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 148 transition count 478
Applied a total of 6 rules in 24 ms. Remains 148 /151 variables (removed 3) and now considering 478/426 (removed -52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 148/151 places, 478/426 transitions.
Incomplete random walk after 10000 steps, including 596 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 624784 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 624784 steps, saw 132016 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 478 rows 148 cols
[2024-06-02 22:36:41] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 22:36:41] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:36:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-02 22:36:41] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 7 ms returned sat
[2024-06-02 22:36:41] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:36:41] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-02 22:36:42] [INFO ] After 227ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-06-02 22:36:42] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2024-06-02 22:36:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 618 ms
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2024-06-02 22:36:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 540 ms
[2024-06-02 22:36:43] [INFO ] After 1649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 218 ms.
[2024-06-02 22:36:43] [INFO ] After 2250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 56 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 478/478 transitions.
Applied a total of 0 rules in 11 ms. Remains 148 /148 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 148/148 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-06-02 22:36:43] [INFO ] Invariant cache hit.
[2024-06-02 22:36:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 22:36:43] [INFO ] Invariant cache hit.
[2024-06-02 22:36:44] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-02 22:36:44] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-06-02 22:36:44] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 22:36:44] [INFO ] Invariant cache hit.
[2024-06-02 22:36:44] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 932 ms. Remains : 148/148 places, 478/478 transitions.
Graph (complete) has 704 edges and 148 vertex of which 146 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 146 transition count 462
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 146 transition count 460
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 146 transition count 468
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 27 place count 145 transition count 462
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 145 transition count 462
Applied a total of 29 rules in 36 ms. Remains 145 /148 variables (removed 3) and now considering 462/478 (removed 16) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 462 rows 145 cols
[2024-06-02 22:36:44] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 22:36:44] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:36:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 22:36:44] [INFO ] [Nat]Absence check using 7 positive and 13 generalized place invariants in 6 ms returned sat
[2024-06-02 22:36:45] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:36:45] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-06-02 22:36:45] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:36:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-02 22:36:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 148 places, 478 transitions and 2581 arcs took 4 ms.
[2024-06-02 22:36:45] [INFO ] Flatten gal took : 121 ms
Total runtime 59380 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MedleyA-PT-22
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1717367812245
--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 15 (type EXCL) for 3 MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 14 (type SRCH) for 3 MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 15 (type EXCL) for MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: result : true
lola: markings : 71882
lola: fired transitions : 131676
lola: time used : 5.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for MedleyA-PT-22-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 8 (type EQUN) for MedleyA-PT-22-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 14 (type SRCH) for MedleyA-PT-22-ReachabilityCardinality-2024-06 (obsolete)
lola: LAUNCH task # 18 (type EXCL) for 0 MedleyA-PT-22-ReachabilityCardinality-2024-01
lola: time limit : 3595 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 MedleyA-PT-22-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 MedleyA-PT-22-ReachabilityCardinality-2024-01
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: LAUNCH task # 17 (type SRCH) for 0 MedleyA-PT-22-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type FNDP) for MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: result : unknown
lola: fired transitions : 346808
lola: tried executions : 45328
lola: time used : 5.000000
lola: memory pages used : 0
lola: FINISHED task # 8 (type EQUN) for MedleyA-PT-22-ReachabilityCardinality-2024-06
lola: result : unknown
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-11.sara.
lola: FINISHED task # 10 (type FNDP) for MedleyA-PT-22-ReachabilityCardinality-2024-01
lola: result : true
lola: fired transitions : 5806
lola: tried executions : 691
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for MedleyA-PT-22-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 17 (type SRCH) for MedleyA-PT-22-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 18 (type EXCL) for MedleyA-PT-22-ReachabilityCardinality-2024-01 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MedleyA-PT-22-ReachabilityCardinality-2024-01: AG false findpath
MedleyA-PT-22-ReachabilityCardinality-2024-06: AG false tandem / relaxed
Time elapsed: 5 secs. Pages in use: 3
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
export BK_EXAMINATION="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-22, 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-171734926500109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "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 '
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 ;