About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 617.636 | 54787.00 | 99133.00 | 265.60 | 1 0 1 0 0 7 1 0 0 0 0 0 0 0 0 0 | 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.r091-tall-171624187900541.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 greatspnxred
Input is DBSingleClientW-PT-d1m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716296296151
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:58:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 12:58:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:58:17] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-21 12:58:17] [INFO ] Transformed 1440 places.
[2024-05-21 12:58:17] [INFO ] Transformed 672 transitions.
[2024-05-21 12:58:17] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 12:58:17] [INFO ] Computed 6 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 1741, 10, 1741]
RANDOM walk for 10000 steps (2279 resets) in 149 ms. (66 steps per ms)
BEST_FIRST walk for 40001 steps (3851 resets) in 150 ms. (264 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[10, 1741, 10, 1741]
[2024-05-21 12:58:18] [INFO ] Invariant cache hit.
[2024-05-21 12:58:18] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 12:58:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2024-05-21 12:58:18] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-21 12:58:18] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 12:58:18] [INFO ] [Real]Added 418 Read/Feed constraints in 73 ms returned sat
[2024-05-21 12:58:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:58:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:58:18] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-21 12:58:18] [INFO ] [Nat]Added 418 Read/Feed constraints in 80 ms returned sat
[2024-05-21 12:58:19] [INFO ] Deduced a trap composed of 180 places in 234 ms of which 88 ms to minimize.
[2024-05-21 12:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-21 12:58:19] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 123 ms.
[2024-05-21 12:58:19] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
[2024-05-21 12:58:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-21 12:58:19] [INFO ] Added : 7 causal constraints over 2 iterations in 506 ms. Result :sat
Minimization took 506 ms.
[2024-05-21 12:58:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:58:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 12:58:20] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-21 12:58:20] [INFO ] [Real]Added 418 Read/Feed constraints in 85 ms returned sat
[2024-05-21 12:58:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:58:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:58:20] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-21 12:58:20] [INFO ] [Nat]Added 418 Read/Feed constraints in 78 ms returned sat
[2024-05-21 12:58:21] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-21 12:58:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-05-21 12:58:21] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 69 ms.
[2024-05-21 12:58:21] [INFO ] Added : 11 causal constraints over 3 iterations in 271 ms. Result :sat
Minimization took 581 ms.
[2024-05-21 12:58:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 12:58:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Real]Added 418 Read/Feed constraints in 103 ms returned sat
[2024-05-21 12:58:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Nat]Added 418 Read/Feed constraints in 79 ms returned sat
[2024-05-21 12:58:22] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 57 ms.
[2024-05-21 12:58:22] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 12:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-21 12:58:23] [INFO ] Added : 10 causal constraints over 3 iterations in 450 ms. Result :sat
Minimization took 575 ms.
[2024-05-21 12:58:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:58:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[10, 1741, 10, 1]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[10, 1741, 10]
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.5 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 326 transition count 592
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 175 place count 232 transition count 338
Iterating global reduction 1 with 94 rules applied. Total rules applied 269 place count 232 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 272 place count 232 transition count 335
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 345 place count 159 transition count 262
Iterating global reduction 2 with 73 rules applied. Total rules applied 418 place count 159 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 423 place count 159 transition count 257
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 464 place count 118 transition count 191
Iterating global reduction 3 with 41 rules applied. Total rules applied 505 place count 118 transition count 191
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 528 place count 118 transition count 168
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 539 place count 107 transition count 149
Iterating global reduction 4 with 11 rules applied. Total rules applied 550 place count 107 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 551 place count 107 transition count 148
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 560 place count 98 transition count 139
Iterating global reduction 5 with 9 rules applied. Total rules applied 569 place count 98 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 572 place count 98 transition count 136
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 579 place count 91 transition count 129
Iterating global reduction 6 with 7 rules applied. Total rules applied 586 place count 91 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 589 place count 91 transition count 126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 590 place count 90 transition count 124
Iterating global reduction 7 with 1 rules applied. Total rules applied 591 place count 90 transition count 124
Applied a total of 591 rules in 101 ms. Remains 90 /347 variables (removed 257) and now considering 124/672 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 90/347 places, 124/672 transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-21 12:58:23] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[10, 1741, 10]
RANDOM walk for 1000000 steps (229677 resets) in 977 ms. (1022 steps per ms)
BEST_FIRST walk for 3000002 steps (295614 resets) in 1392 ms. (2153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[10, 1741, 10]
[2024-05-21 12:58:26] [INFO ] Invariant cache hit.
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:58:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 12:58:26] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:58:26] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-21 12:58:26] [INFO ] Computed and/alt/rep : 34/77/34 causal constraints (skipped 89 transitions) in 7 ms.
[2024-05-21 12:58:26] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 12:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-21 12:58:26] [INFO ] Added : 10 causal constraints over 3 iterations in 120 ms. Result :sat
Minimization took 34 ms.
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Real]Added 49 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:58:26] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:58:26] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-21 12:58:26] [INFO ] Computed and/alt/rep : 34/77/34 causal constraints (skipped 89 transitions) in 8 ms.
[2024-05-21 12:58:26] [INFO ] Added : 10 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 1741, 10]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1741, 10]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 124/124 transitions.
Graph (complete) has 286 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 89 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 118
Applied a total of 8 rules in 11 ms. Remains 88 /90 variables (removed 2) and now considering 118/124 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 88/90 places, 118/124 transitions.
// Phase 1: matrix 118 rows 88 cols
[2024-05-21 12:58:26] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1741, 10]
RANDOM walk for 1000000 steps (229966 resets) in 874 ms. (1142 steps per ms)
BEST_FIRST walk for 2000001 steps (196890 resets) in 828 ms. (2412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1741, 10]
[2024-05-21 12:58:28] [INFO ] Invariant cache hit.
[2024-05-21 12:58:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:58:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:58:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:58:28] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:58:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:58:28] [INFO ] [Nat]Added 43 Read/Feed constraints in 16 ms returned sat
[2024-05-21 12:58:28] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 8 ms.
[2024-05-21 12:58:28] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 35 ms.
[2024-05-21 12:58:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:58:28] [INFO ] [Real]Added 43 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:58:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:58:29] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:58:29] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 7 ms.
[2024-05-21 12:58:29] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1741, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1741, 10]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 88/88 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 12:58:29] [INFO ] Invariant cache hit.
[2024-05-21 12:58:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 12:58:29] [INFO ] Invariant cache hit.
[2024-05-21 12:58:29] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:58:29] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-21 12:58:29] [INFO ] Redundant transitions in 3 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 12:58:29] [INFO ] Invariant cache hit.
[2024-05-21 12:58:29] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 133 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2280 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 117/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4658 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 7115ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7372 ms. Remains : 88/88 places, 118/118 transitions.
RANDOM walk for 40000 steps (9206 resets) in 906 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3803 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3917 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3935 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3890 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1065547 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :2 out of 4
Probabilistic random walk after 1065547 steps, saw 400824 distinct states, run finished after 3004 ms. (steps per millisecond=354 ) properties seen :2
[2024-05-21 12:58:40] [INFO ] Invariant cache hit.
[2024-05-21 12:58:40] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 93/104 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 7/162 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 12 (OVERLAPS) 44/206 variables, 36/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 27/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 12:58:40] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 206/206 variables, and 134 constraints, problems are : Problem set: 2 solved, 0 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 178ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1741, 10]
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1741]
[2024-05-21 12:58:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 10000 steps (2276 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (970 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2024-05-21 12:58:40] [INFO ] Invariant cache hit.
[2024-05-21 12:58:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:40] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:58:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:58:40] [INFO ] [Real]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:58:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:58:40] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:58:40] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 6 ms.
[2024-05-21 12:58:40] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 84 transition count 108
Applied a total of 10 rules in 11 ms. Remains 84 /88 variables (removed 4) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 84/88 places, 108/118 transitions.
// Phase 1: matrix 108 rows 84 cols
[2024-05-21 12:58:40] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1741]
RANDOM walk for 1000000 steps (229752 resets) in 852 ms. (1172 steps per ms)
BEST_FIRST walk for 1000001 steps (98958 resets) in 402 ms. (2481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1741]
[2024-05-21 12:58:41] [INFO ] Invariant cache hit.
[2024-05-21 12:58:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:41] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:58:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:58:41] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:58:41] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:58:41] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:58:41] [INFO ] Computed and/alt/rep : 29/65/29 causal constraints (skipped 78 transitions) in 6 ms.
[2024-05-21 12:58:41] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1741]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1741]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 12:58:41] [INFO ] Invariant cache hit.
[2024-05-21 12:58:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 12:58:42] [INFO ] Invariant cache hit.
[2024-05-21 12:58:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:58:42] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 12:58:42] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 12:58:42] [INFO ] Invariant cache hit.
[2024-05-21 12:58:42] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 122 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1835 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/192 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 229 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4822 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6771ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6772ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6981 ms. Remains : 84/84 places, 108/108 transitions.
RANDOM walk for 40000 steps (9263 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3994 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3992 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3152395 steps, run timeout after 3001 ms. (steps per millisecond=1050 ) properties seen :1 out of 2
Probabilistic random walk after 3152395 steps, saw 1231904 distinct states, run finished after 3001 ms. (steps per millisecond=1050 ) properties seen :1
[2024-05-21 12:58:52] [INFO ] Invariant cache hit.
[2024-05-21 12:58:52] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/134 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/192 variables, and 93 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 7/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1741]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02 in 11860 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 118 rows 88 cols
[2024-05-21 12:58:52] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2314 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (992 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-21 12:58:52] [INFO ] Invariant cache hit.
[2024-05-21 12:58:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:58:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:58:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:58:52] [INFO ] [Real]Added 43 Read/Feed constraints in 10 ms returned sat
[2024-05-21 12:58:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 12:58:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 10 ms returned sat
[2024-05-21 12:58:52] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 87 transitions) in 7 ms.
[2024-05-21 12:58:52] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 109
Applied a total of 5 rules in 9 ms. Remains 86 /88 variables (removed 2) and now considering 109/118 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/88 places, 109/118 transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 12:58:52] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (229606 resets) in 785 ms. (1272 steps per ms)
BEST_FIRST walk for 1000000 steps (98386 resets) in 385 ms. (2590 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2024-05-21 12:58:53] [INFO ] Invariant cache hit.
[2024-05-21 12:58:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:58:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:58:53] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:58:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:58:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:58:53] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 7 ms.
[2024-05-21 12:58:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 12:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-21 12:58:53] [INFO ] Added : 17 causal constraints over 5 iterations in 118 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 12:58:53] [INFO ] Invariant cache hit.
[2024-05-21 12:58:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 12:58:53] [INFO ] Invariant cache hit.
[2024-05-21 12:58:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:58:54] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 12:58:54] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 12:58:54] [INFO ] Invariant cache hit.
[2024-05-21 12:58:54] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2140 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4599 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6843ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7046 ms. Remains : 86/86 places, 109/109 transitions.
RANDOM walk for 40000 steps (9175 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3911 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3962 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3093673 steps, run timeout after 3001 ms. (steps per millisecond=1030 ) properties seen :1 out of 2
Probabilistic random walk after 3093673 steps, saw 1207966 distinct states, run finished after 3001 ms. (steps per millisecond=1030 ) properties seen :1
[2024-05-21 12:59:03] [INFO ] Invariant cache hit.
[2024-05-21 12:59:03] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/90 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/192 variables, 75/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:59:04] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/195 variables, and 120 constraints, problems are : Problem set: 1 solved, 0 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 0/2 constraints, State Equation: 83/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 141ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-05 in 12024 ms.
[2024-05-21 12:59:04] [INFO ] Flatten gal took : 35 ms
[2024-05-21 12:59:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 12:59:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 88 places, 118 transitions and 464 arcs took 4 ms.
Total runtime 46968 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DBSingleClientW-PT-d1m10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 88
TRANSITIONS: 118
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 718
MODEL NAME: /home/mcc/execution/412/model
88 places, 118 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-05 7 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716296350938
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="DBSingleClientW-PT-d1m10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d1m10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187900541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m10.tgz
mv DBSingleClientW-PT-d1m10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;