About the Execution of GreatSPN+red for DBSingleClientW-PT-d2m08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1329.600 | 155445.00 | 205632.00 | 358.90 | 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 1 | 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-171624188000581.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-d2m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188000581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 1.6M 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-d2m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716303717165
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-d2m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:01:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 15:01:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:01:58] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-21 15:01:58] [INFO ] Transformed 4763 places.
[2024-05-21 15:01:58] [INFO ] Transformed 2478 transitions.
[2024-05-21 15:01:58] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 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 2478 rows 1183 cols
[2024-05-21 15:01:58] [INFO ] Computed 6 invariants in 168 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
RANDOM walk for 10000 steps (2325 resets) in 350 ms. (28 steps per ms)
BEST_FIRST walk for 40003 steps (3718 resets) in 235 ms. (169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
[2024-05-21 15:01:59] [INFO ] Invariant cache hit.
[2024-05-21 15:01:59] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-21 15:01:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 15:02:00] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2024-05-21 15:02:00] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 15:02:01] [INFO ] [Real]Added 1588 Read/Feed constraints in 754 ms returned sat
[2024-05-21 15:02:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 15:02:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 15:02:02] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2024-05-21 15:02:03] [INFO ] [Nat]Added 1588 Read/Feed constraints in 964 ms returned sat
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 237 places in 691 ms of which 65 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 919 ms
[2024-05-21 15:02:05] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 660 ms.
[2024-05-21 15:02:06] [INFO ] Deduced a trap composed of 32 places in 675 ms of which 9 ms to minimize.
[2024-05-21 15:02:06] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 794 ms
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 15:02:06] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 15:02:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 15:02:07] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-05-21 15:02:08] [INFO ] [Real]Added 1588 Read/Feed constraints in 739 ms returned sat
[2024-05-21 15:02:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 15:02:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 15:02:09] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2024-05-21 15:02:10] [INFO ] [Nat]Added 1588 Read/Feed constraints in 891 ms returned sat
[2024-05-21 15:02:10] [INFO ] Deduced a trap composed of 243 places in 601 ms of which 7 ms to minimize.
[2024-05-21 15:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 768 ms
[2024-05-21 15:02:11] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 657 ms.
[2024-05-21 15:02:12] [INFO ] Added : 11 causal constraints over 3 iterations in 1245 ms. Result :sat
Minimization took 635 ms.
[2024-05-21 15:02:12] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 15:02:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 15:02:13] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-21 15:02:14] [INFO ] [Real]Added 1588 Read/Feed constraints in 809 ms returned sat
[2024-05-21 15:02:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 15:02:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 15:02:15] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2024-05-21 15:02:16] [INFO ] [Nat]Added 1588 Read/Feed constraints in 929 ms returned sat
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 194 places in 622 ms of which 8 ms to minimize.
[2024-05-21 15:02:17] [INFO ] Deduced a trap composed of 221 places in 602 ms of which 7 ms to minimize.
[2024-05-21 15:02:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1695 ms
[2024-05-21 15:02:18] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 371 ms.
[2024-05-21 15:02:18] [INFO ] Added : 10 causal constraints over 3 iterations in 924 ms. Result :sat
Minimization took 632 ms.
[2024-05-21 15:02:19] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 15:02:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-21 15:02:20] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2024-05-21 15:02:20] [INFO ] [Real]Added 1588 Read/Feed constraints in 745 ms returned sat
[2024-05-21 15:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-21 15:02:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 15:02:21] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2024-05-21 15:02:22] [INFO ] [Nat]Added 1588 Read/Feed constraints in 856 ms returned sat
[2024-05-21 15:02:22] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 360 ms.
[2024-05-21 15:02:24] [INFO ] Deduced a trap composed of 46 places in 675 ms of which 7 ms to minimize.
[2024-05-21 15:02:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 869 ms
[2024-05-21 15:02:24] [INFO ] Added : 16 causal constraints over 4 iterations in 2124 ms. Result :sat
Minimization took 638 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.9 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1317 place count 434 transition count 880
Iterating global reduction 2 with 314 rules applied. Total rules applied 1631 place count 434 transition count 880
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1643 place count 434 transition count 868
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1881 place count 196 transition count 529
Iterating global reduction 3 with 238 rules applied. Total rules applied 2119 place count 196 transition count 529
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2328 place count 196 transition count 320
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2353 place count 171 transition count 280
Iterating global reduction 4 with 25 rules applied. Total rules applied 2378 place count 171 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2384 place count 171 transition count 274
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2401 place count 154 transition count 257
Iterating global reduction 5 with 17 rules applied. Total rules applied 2418 place count 154 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2422 place count 154 transition count 253
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2436 place count 140 transition count 239
Iterating global reduction 6 with 14 rules applied. Total rules applied 2450 place count 140 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2463 place count 140 transition count 226
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2468 place count 135 transition count 204
Iterating global reduction 7 with 5 rules applied. Total rules applied 2473 place count 135 transition count 204
Applied a total of 2473 rules in 235 ms. Remains 135 /1183 variables (removed 1048) and now considering 204/2478 (removed 2274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 135/1183 places, 204/2478 transitions.
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 15:02:25] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
RANDOM walk for 1000000 steps (229834 resets) in 1383 ms. (722 steps per ms)
BEST_FIRST walk for 4000002 steps (382089 resets) in 2418 ms. (1653 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
[2024-05-21 15:02:29] [INFO ] Invariant cache hit.
[2024-05-21 15:02:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 15:02:29] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 15:02:29] [INFO ] [Real]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-21 15:02:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Nat]Added 77 Read/Feed constraints in 16 ms returned sat
[2024-05-21 15:02:29] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 15:02:29] [INFO ] Added : 17 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 108 ms.
[2024-05-21 15:02:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Real]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-21 15:02:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:02:29] [INFO ] [Nat]Added 77 Read/Feed constraints in 11 ms returned sat
[2024-05-21 15:02:30] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 11 ms.
[2024-05-21 15:02:30] [INFO ] Added : 12 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 95 ms.
[2024-05-21 15:02:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 15:02:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Nat]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 15:02:30] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 15 ms.
[2024-05-21 15:02:30] [INFO ] Added : 10 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 94 ms.
[2024-05-21 15:02:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 15:02:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 15:02:30] [INFO ] [Nat]Added 77 Read/Feed constraints in 16 ms returned sat
[2024-05-21 15:02:30] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 15:02:30] [INFO ] Added : 15 causal constraints over 4 iterations in 84 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 135/135 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 15:02:31] [INFO ] Invariant cache hit.
[2024-05-21 15:02:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 15:02:31] [INFO ] Invariant cache hit.
[2024-05-21 15:02:31] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 15:02:31] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-05-21 15:02:31] [INFO ] Redundant transitions in 6 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-21 15:02:31] [INFO ] Invariant cache hit.
[2024-05-21 15:02:31] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/339 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 214 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5821 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/339 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 203/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 417 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15641 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 21829ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22289 ms. Remains : 135/135 places, 204/204 transitions.
RANDOM walk for 40000 steps (9171 resets) in 1165 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3859 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3858 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3844 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3819 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3862 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3891 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3832 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3760 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 616027 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :4 out of 8
Probabilistic random walk after 616027 steps, saw 253861 distinct states, run finished after 3004 ms. (steps per millisecond=205 ) properties seen :4
[2024-05-21 15:02:57] [INFO ] Invariant cache hit.
[2024-05-21 15:02:57] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 139/234 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 330/339 variables, and 132 constraints, problems are : Problem set: 4 solved, 0 unsolved in 133 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/135 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m08-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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-21 15:02:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2300 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (958 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 15:02:57] [INFO ] Invariant cache hit.
[2024-05-21 15:02:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:02:57] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:02:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 15:02:57] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 15:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:02:57] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:02:57] [INFO ] [Nat]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-21 15:02:57] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 15:02:57] [INFO ] Added : 17 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 128 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 127 transition count 179
Applied a total of 19 rules in 21 ms. Remains 127 /135 variables (removed 8) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 127/135 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-21 15:02:57] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (230021 resets) in 1117 ms. (894 steps per ms)
BEST_FIRST walk for 1000001 steps (95967 resets) in 522 ms. (1912 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 15:02:59] [INFO ] Invariant cache hit.
[2024-05-21 15:02:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 15:02:59] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:02:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 15:02:59] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 15:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:02:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:02:59] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 15:02:59] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2024-05-21 15:02:59] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 18 ms.
[2024-05-21 15:02:59] [INFO ] Added : 12 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 15:02:59] [INFO ] Invariant cache hit.
[2024-05-21 15:02:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 15:02:59] [INFO ] Invariant cache hit.
[2024-05-21 15:02:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 15:03:00] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 15:03:00] [INFO ] Redundant transitions in 7 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 15:03:00] [INFO ] Invariant cache hit.
[2024-05-21 15:03:00] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5342 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12345 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 17916ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 17918ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18239 ms. Remains : 127/127 places, 179/179 transitions.
RANDOM walk for 40000 steps (9206 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3813 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3810 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2410185 steps, run timeout after 3001 ms. (steps per millisecond=803 ) properties seen :1 out of 2
Probabilistic random walk after 2410185 steps, saw 980748 distinct states, run finished after 3001 ms. (steps per millisecond=803 ) properties seen :1
[2024-05-21 15:03:21] [INFO ] Invariant cache hit.
[2024-05-21 15:03:21] [INFO ] State equation strengthened by 58 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) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms 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:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-05 in 23939 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 15:03:21] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2310 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (943 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 15:03:21] [INFO ] Invariant cache hit.
[2024-05-21 15:03:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:03:21] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:03:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 15:03:21] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 15:03:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:03:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:03:21] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:03:21] [INFO ] [Nat]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-21 15:03:21] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 14 ms.
[2024-05-21 15:03:21] [INFO ] Added : 12 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 128 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 127 transition count 179
Applied a total of 19 rules in 16 ms. Remains 127 /135 variables (removed 8) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 127/135 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-21 15:03:21] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (230163 resets) in 1135 ms. (880 steps per ms)
BEST_FIRST walk for 1000000 steps (95573 resets) in 525 ms. (1901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 15:03:23] [INFO ] Invariant cache hit.
[2024-05-21 15:03:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:03:23] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 15:03:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 15:03:23] [INFO ] [Real]Added 58 Read/Feed constraints in 18 ms returned sat
[2024-05-21 15:03:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:03:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:03:23] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:03:23] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 15:03:23] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 10 ms.
[2024-05-21 15:03:23] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:03:23] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:03:23] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:03:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2024-05-21 15:03:23] [INFO ] Added : 16 causal constraints over 4 iterations in 310 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 15:03:23] [INFO ] Invariant cache hit.
[2024-05-21 15:03:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 15:03:23] [INFO ] Invariant cache hit.
[2024-05-21 15:03:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 15:03:24] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-21 15:03:24] [INFO ] Redundant transitions in 8 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 15:03:24] [INFO ] Invariant cache hit.
[2024-05-21 15:03:24] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4501 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10467 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15191ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15195ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15562 ms. Remains : 127/127 places, 179/179 transitions.
RANDOM walk for 40000 steps (9275 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3984 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3784 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2479731 steps, run timeout after 3001 ms. (steps per millisecond=826 ) properties seen :1 out of 2
Probabilistic random walk after 2479731 steps, saw 1005580 distinct states, run finished after 3001 ms. (steps per millisecond=826 ) properties seen :1
[2024-05-21 15:03:42] [INFO ] Invariant cache hit.
[2024-05-21 15:03:42] [INFO ] State equation strengthened by 58 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) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms 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:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13 in 21451 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14
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:[2887]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2887]
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 15:03:42] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 10000 steps (2258 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (1009 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2024-05-21 15:03:42] [INFO ] Invariant cache hit.
[2024-05-21 15:03:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:03:42] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 15:03:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 15:03:42] [INFO ] [Real]Added 77 Read/Feed constraints in 15 ms returned sat
[2024-05-21 15:03:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:03:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:03:42] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 15:03:42] [INFO ] [Nat]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 15:03:42] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 15:03:42] [INFO ] Added : 10 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 129 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 129 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 129 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 126 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 126 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 125 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 125 transition count 177
Applied a total of 23 rules in 13 ms. Remains 125 /135 variables (removed 10) and now considering 177/204 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 125/135 places, 177/204 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-21 15:03:43] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 1000000 steps (229960 resets) in 1131 ms. (883 steps per ms)
BEST_FIRST walk for 1000001 steps (95643 resets) in 514 ms. (1941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2024-05-21 15:03:44] [INFO ] Invariant cache hit.
[2024-05-21 15:03:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:03:44] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 15:03:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 15:03:44] [INFO ] [Real]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-21 15:03:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:03:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:03:44] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 15:03:44] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-21 15:03:44] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 10 ms.
[2024-05-21 15:03:44] [INFO ] Added : 13 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 15:03:44] [INFO ] Invariant cache hit.
[2024-05-21 15:03:45] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 15:03:45] [INFO ] Invariant cache hit.
[2024-05-21 15:03:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 15:03:45] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-21 15:03:45] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-21 15:03:45] [INFO ] Invariant cache hit.
[2024-05-21 15:03:45] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6243 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10583 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 17022ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 17023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17328 ms. Remains : 125/125 places, 177/177 transitions.
RANDOM walk for 40000 steps (9147 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3903 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3828 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2507876 steps, run timeout after 3001 ms. (steps per millisecond=835 ) properties seen :1 out of 2
Probabilistic random walk after 2507876 steps, saw 1017818 distinct states, run finished after 3001 ms. (steps per millisecond=835 ) properties seen :1
[2024-05-21 15:04:05] [INFO ] Invariant cache hit.
[2024-05-21 15:04:05] [INFO ] State equation strengthened by 57 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/133 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/205 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/220 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 302/302 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 90 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms 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:[2887]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14 in 22884 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-15
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 15:04:05] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2329 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (925 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 15:04:05] [INFO ] Invariant cache hit.
[2024-05-21 15:04:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:04:05] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 15:04:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 15:04:05] [INFO ] [Real]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-21 15:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:04:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:04:05] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:04:05] [INFO ] [Nat]Added 77 Read/Feed constraints in 16 ms returned sat
[2024-05-21 15:04:05] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 14 ms.
[2024-05-21 15:04:05] [INFO ] Added : 15 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 128 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 128 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 126 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 126 transition count 180
Applied a total of 21 rules in 21 ms. Remains 126 /135 variables (removed 9) and now considering 180/204 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 126/135 places, 180/204 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-21 15:04:05] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229909 resets) in 1127 ms. (886 steps per ms)
BEST_FIRST walk for 1000000 steps (95793 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 15:04:07] [INFO ] Invariant cache hit.
[2024-05-21 15:04:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 15:04:07] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 15:04:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 15:04:07] [INFO ] [Real]Added 58 Read/Feed constraints in 8 ms returned sat
[2024-05-21 15:04:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:04:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 15:04:07] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 15:04:07] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 15:04:07] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-21 15:04:07] [INFO ] Added : 29 causal constraints over 7 iterations in 112 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 15:04:08] [INFO ] Invariant cache hit.
[2024-05-21 15:04:08] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 15:04:08] [INFO ] Invariant cache hit.
[2024-05-21 15:04:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 15:04:08] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 15:04:08] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 15:04:08] [INFO ] Invariant cache hit.
[2024-05-21 15:04:08] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4827 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10716 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15757ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15760ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16091 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9179 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3876 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3820 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2466936 steps, run timeout after 3001 ms. (steps per millisecond=822 ) properties seen :1 out of 2
Probabilistic random walk after 2466936 steps, saw 994556 distinct states, run finished after 3001 ms. (steps per millisecond=822 ) properties seen :1
[2024-05-21 15:04:27] [INFO ] Invariant cache hit.
[2024-05-21 15:04:27] [INFO ] State equation strengthened by 58 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) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms 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:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-15 in 21819 ms.
[2024-05-21 15:04:27] [INFO ] Flatten gal took : 42 ms
[2024-05-21 15:04:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 15:04:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 204 transitions and 805 arcs took 5 ms.
Total runtime 149225 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DBSingleClientW-PT-d2m08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 135
TRANSITIONS: 204
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 788
MODEL NAME: /home/mcc/execution/409/model
135 places, 204 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-d2m08-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716303872610
--------------------
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-d2m08"
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-d2m08, 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-171624188000581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m08.tgz
mv DBSingleClientW-PT-d2m08 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 ;