About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 539.023 | 65667.00 | 96566.00 | 166.50 | 1 0 0 1 1 1 0 0 0 0 0 0 0 0 1 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187800501.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-d1m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187800501
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:52 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 432K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716290155058
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-d1m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:15:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 11:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:15:56] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-21 11:15:56] [INFO ] Transformed 1440 places.
[2024-05-21 11:15:56] [INFO ] Transformed 672 transitions.
[2024-05-21 11:15:56] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 11:15:56] [INFO ] Computed 6 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 1042, 7, 7, 5]
RANDOM walk for 10000 steps (2316 resets) in 145 ms. (68 steps per ms)
BEST_FIRST walk for 50003 steps (4768 resets) in 174 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 1042, 7, 7, 5]
[2024-05-21 11:15:56] [INFO ] Invariant cache hit.
[2024-05-21 11:15:57] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-21 11:15:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 11:15:57] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-21 11:15:57] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 11:15:57] [INFO ] [Real]Added 418 Read/Feed constraints in 84 ms returned sat
[2024-05-21 11:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:15:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:15:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:15:57] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-21 11:15:57] [INFO ] [Nat]Added 418 Read/Feed constraints in 92 ms returned sat
[2024-05-21 11:15:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 133 ms.
[2024-05-21 11:15:58] [INFO ] Added : 9 causal constraints over 2 iterations in 322 ms. Result :sat
Minimization took 527 ms.
[2024-05-21 11:15:58] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:15:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:15:59] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-21 11:15:59] [INFO ] [Real]Added 418 Read/Feed constraints in 97 ms returned sat
[2024-05-21 11:15:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:15:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 11:15:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:15:59] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-21 11:15:59] [INFO ] [Nat]Added 418 Read/Feed constraints in 80 ms returned sat
[2024-05-21 11:15:59] [INFO ] Deduced a trap composed of 103 places in 185 ms of which 32 ms to minimize.
[2024-05-21 11:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2024-05-21 11:15:59] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 77 ms.
[2024-05-21 11:16:00] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-21 11:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2024-05-21 11:16:00] [INFO ] Added : 11 causal constraints over 3 iterations in 564 ms. Result :sat
Minimization took 574 ms.
[2024-05-21 11:16:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:16:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:16:01] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-21 11:16:01] [INFO ] [Real]Added 418 Read/Feed constraints in 75 ms returned sat
[2024-05-21 11:16:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:16:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 11:16:01] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-21 11:16:01] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2024-05-21 11:16:01] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2024-05-21 11:16:01] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-21 11:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-21 11:16:02] [INFO ] Added : 16 causal constraints over 4 iterations in 608 ms. Result :sat
Minimization took 554 ms.
[2024-05-21 11:16:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:16:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 11:16:02] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-21 11:16:03] [INFO ] [Real]Added 418 Read/Feed constraints in 81 ms returned sat
[2024-05-21 11:16:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:16:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 11:16:03] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-21 11:16:03] [INFO ] [Nat]Added 418 Read/Feed constraints in 75 ms returned sat
[2024-05-21 11:16:03] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 55 ms.
[2024-05-21 11:16:03] [INFO ] Added : 5 causal constraints over 2 iterations in 168 ms. Result :sat
Minimization took 548 ms.
[2024-05-21 11:16:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:16:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 11:16:04] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-21 11:16:04] [INFO ] [Real]Added 418 Read/Feed constraints in 77 ms returned sat
[2024-05-21 11:16:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:16:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:16:04] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-21 11:16:04] [INFO ] [Nat]Added 418 Read/Feed constraints in 92 ms returned sat
[2024-05-21 11:16:04] [INFO ] Deduced a trap composed of 174 places in 141 ms of which 3 ms to minimize.
[2024-05-21 11:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-21 11:16:04] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 60 ms.
[2024-05-21 11:16:05] [INFO ] Added : 7 causal constraints over 2 iterations in 199 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 1042, 7, 7, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 1042, 7, 7, 5]
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 357 place count 157 transition count 251
Iterating global reduction 2 with 72 rules applied. Total rules applied 429 place count 157 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 435 place count 157 transition count 245
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 475 place count 117 transition count 181
Iterating global reduction 3 with 40 rules applied. Total rules applied 515 place count 117 transition count 181
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 537 place count 117 transition count 159
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 547 place count 107 transition count 143
Iterating global reduction 4 with 10 rules applied. Total rules applied 557 place count 107 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 559 place count 107 transition count 141
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 567 place count 99 transition count 133
Iterating global reduction 5 with 8 rules applied. Total rules applied 575 place count 99 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 578 place count 99 transition count 130
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 584 place count 93 transition count 124
Iterating global reduction 6 with 6 rules applied. Total rules applied 590 place count 93 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 593 place count 93 transition count 121
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 594 place count 92 transition count 119
Iterating global reduction 7 with 1 rules applied. Total rules applied 595 place count 92 transition count 119
Applied a total of 595 rules in 100 ms. Remains 92 /347 variables (removed 255) and now considering 119/672 (removed 553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 92/347 places, 119/672 transitions.
// Phase 1: matrix 119 rows 92 cols
[2024-05-21 11:16:05] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 1042, 7, 7, 5]
RANDOM walk for 1000000 steps (230207 resets) in 1051 ms. (950 steps per ms)
BEST_FIRST walk for 5000004 steps (492209 resets) in 2390 ms. (2091 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[7, 1042, 7, 7, 5]
[2024-05-21 11:16:09] [INFO ] Invariant cache hit.
[2024-05-21 11:16:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:16:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 11:16:09] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:09] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-21 11:16:09] [INFO ] Added : 7 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 43 ms.
[2024-05-21 11:16:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:16:09] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-21 11:16:09] [INFO ] Added : 11 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 48 ms.
[2024-05-21 11:16:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:16:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-05-21 11:16:09] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-21 11:16:09] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 11:16:09] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 11:16:10] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-21 11:16:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:16:10] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:16:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 360 ms
[2024-05-21 11:16:10] [INFO ] Added : 16 causal constraints over 5 iterations in 422 ms. Result :sat
Minimization took 49 ms.
[2024-05-21 11:16:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:10] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2024-05-21 11:16:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:16:10] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:16:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:10] [INFO ] Computed and/alt/rep : 32/71/32 causal constraints (skipped 86 transitions) in 7 ms.
[2024-05-21 11:16:10] [INFO ] Added : 12 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[7, 1042, 7, 1, 5]
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 1042, 7, 5]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 90 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 89 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 89 transition count 114
Applied a total of 7 rules in 14 ms. Remains 89 /92 variables (removed 3) and now considering 114/119 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 89/92 places, 114/119 transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 11:16:10] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 1042, 7, 5]
RANDOM walk for 1000000 steps (229107 resets) in 948 ms. (1053 steps per ms)
BEST_FIRST walk for 4000002 steps (393610 resets) in 1795 ms. (2227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 1042, 7, 5]
[2024-05-21 11:16:13] [INFO ] Invariant cache hit.
[2024-05-21 11:16:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:16:13] [INFO ] [Real]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:16:13] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 7 ms.
[2024-05-21 11:16:13] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 36 ms.
[2024-05-21 11:16:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:16:13] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 8 ms.
[2024-05-21 11:16:13] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 47 ms.
[2024-05-21 11:16:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:16:13] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-05-21 11:16:14] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 7 ms.
[2024-05-21 11:16:14] [INFO ] Added : 12 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 35 ms.
[2024-05-21 11:16:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:14] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:14] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:14] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:16:14] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:14] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 6 ms.
[2024-05-21 11:16:14] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 1042, 7, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 1042, 7, 5]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 8 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 89/89 places, 114/114 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-21 11:16:14] [INFO ] Invariant cache hit.
[2024-05-21 11:16:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 11:16:14] [INFO ] Invariant cache hit.
[2024-05-21 11:16:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:16:14] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-21 11:16:14] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-21 11:16:14] [INFO ] Invariant cache hit.
[2024-05-21 11:16:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 128 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2824 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 113/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 241 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4312 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 7358ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7652 ms. Remains : 89/89 places, 114/114 transitions.
RANDOM walk for 40000 steps (9226 resets) in 1523 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3919 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3994 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3980 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3878 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3823 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3965 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3931 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3930 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
Probably explored full state space saw : 75785 states, properties seen :4
Probabilistic random walk after 190694 steps, saw 75785 distinct states, run finished after 1156 ms. (steps per millisecond=164 ) properties seen :4
Explored full state space saw : 76073 states, properties seen :0
Exhaustive walk after 191362 steps, saw 76073 distinct states, run finished after 930 ms. (steps per millisecond=205 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 1042, 7, 5]
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-00
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]
[2024-05-21 11:16:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2267 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (1005 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 11:16:24] [INFO ] Invariant cache hit.
[2024-05-21 11:16:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:24] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 11:16:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:16:24] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 11:16:25] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:25] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 7 ms.
[2024-05-21 11:16:25] [INFO ] Added : 10 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 36 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 114/114 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 85 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 85 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 84 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 84 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 83 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 82 transition count 99
Applied a total of 15 rules in 24 ms. Remains 82 /89 variables (removed 7) and now considering 99/114 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 82/89 places, 99/114 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-21 11:16:25] [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 (229471 resets) in 837 ms. (1193 steps per ms)
BEST_FIRST walk for 1000001 steps (98456 resets) in 410 ms. (2433 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 11:16:26] [INFO ] Invariant cache hit.
[2024-05-21 11:16:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:16:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:16:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:16:26] [INFO ] [Real]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:16:26] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:26] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 7 ms.
[2024-05-21 11:16:26] [INFO ] Added : 10 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 34 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 11:16:26] [INFO ] Invariant cache hit.
[2024-05-21 11:16:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 11:16:26] [INFO ] Invariant cache hit.
[2024-05-21 11:16:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:16:26] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 11:16:26] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 11:16:26] [INFO ] Invariant cache hit.
[2024-05-21 11:16:26] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1861 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3495 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5464ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5694 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9196 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3911 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3977 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Probably explored full state space saw : 58887 states, properties seen :1
Probabilistic random walk after 142571 steps, saw 58887 distinct states, run finished after 148 ms. (steps per millisecond=963 ) properties seen :1
Explored full state space saw : 59225 states, properties seen :0
Exhaustive walk after 143343 steps, saw 59225 distinct states, run finished after 120 ms. (steps per millisecond=1194 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-00 in 7808 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-03
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:[1042]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1042]
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 11:16:32] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1042]
RANDOM walk for 10000 steps (2286 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (1001 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1042]
[2024-05-21 11:16:32] [INFO ] Invariant cache hit.
[2024-05-21 11:16:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:16:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:16:32] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:16:32] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:16:32] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 6 ms.
[2024-05-21 11:16:32] [INFO ] Added : 9 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1042]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1042]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 114/114 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 87 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 87 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 86 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 86 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 85 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 84 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 84 transition count 107
Applied a total of 10 rules in 9 ms. Remains 84 /89 variables (removed 5) and now considering 107/114 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 84/89 places, 107/114 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 11:16:32] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1042]
RANDOM walk for 1000000 steps (229692 resets) in 879 ms. (1136 steps per ms)
BEST_FIRST walk for 1000001 steps (97763 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1042]
[2024-05-21 11:16:34] [INFO ] Invariant cache hit.
[2024-05-21 11:16:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:16:34] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2024-05-21 11:16:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:34] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 11:16:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:16:34] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 6 ms.
[2024-05-21 11:16:34] [INFO ] Added : 9 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1042]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1042]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 11:16:34] [INFO ] Invariant cache hit.
[2024-05-21 11:16:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 11:16:34] [INFO ] Invariant cache hit.
[2024-05-21 11:16:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:16:34] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-21 11:16:34] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:16:34] [INFO ] Invariant cache hit.
[2024-05-21 11:16:34] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 11:16:36] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2577 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4744 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
After SMT, in 7410ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7597 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9151 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3888 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4058 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Probably explored full state space saw : 63625 states, properties seen :1
Probabilistic random walk after 158050 steps, saw 63625 distinct states, run finished after 181 ms. (steps per millisecond=873 ) properties seen :1
Explored full state space saw : 63933 states, properties seen :0
Exhaustive walk after 158735 steps, saw 63933 distinct states, run finished after 119 ms. (steps per millisecond=1333 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1042]
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-03 in 9769 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-04
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 114 rows 89 cols
[2024-05-21 11:16:42] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2300 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (1003 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 11:16:42] [INFO ] Invariant cache hit.
[2024-05-21 11:16:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:42] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:16:42] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:42] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:42] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2024-05-21 11:16:42] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 7 ms.
[2024-05-21 11:16:42] [INFO ] Added : 12 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 36 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 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 114/114 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 88 transition count 112
Applied a total of 3 rules in 6 ms. Remains 88 /89 variables (removed 1) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/89 places, 112/114 transitions.
// Phase 1: matrix 112 rows 88 cols
[2024-05-21 11:16:42] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229534 resets) in 868 ms. (1150 steps per ms)
BEST_FIRST walk for 1000001 steps (98395 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 11:16:44] [INFO ] Invariant cache hit.
[2024-05-21 11:16:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 11:16:44] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:16:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:16:44] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:16:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:16:44] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:16:44] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 80 transitions) in 6 ms.
[2024-05-21 11:16:44] [INFO ] Added : 12 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 42 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 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 88/88 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-21 11:16:44] [INFO ] Invariant cache hit.
[2024-05-21 11:16:44] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 11:16:44] [INFO ] Invariant cache hit.
[2024-05-21 11:16:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:16:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 11:16:44] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-21 11:16:44] [INFO ] Invariant cache hit.
[2024-05-21 11:16:44] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 126 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2045 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 111/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 237 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4907 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 7061ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 7063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7253 ms. Remains : 88/88 places, 112/112 transitions.
RANDOM walk for 40000 steps (9200 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3902 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4072 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Probably explored full state space saw : 73719 states, properties seen :1
Probabilistic random walk after 184758 steps, saw 73719 distinct states, run finished after 231 ms. (steps per millisecond=799 ) properties seen :1
Explored full state space saw : 73719 states, properties seen :0
Exhaustive walk after 184758 steps, saw 73719 distinct states, run finished after 125 ms. (steps per millisecond=1478 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-04 in 9442 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m05-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:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 11:16:51] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2269 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (967 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 11:16:51] [INFO ] Invariant cache hit.
[2024-05-21 11:16:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:16:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:16:52] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:16:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:16:52] [INFO ] [Nat]Added 37 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:16:52] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 82 transitions) in 5 ms.
[2024-05-21 11:16:52] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 114/114 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 85 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 85 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 84 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 84 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 83 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 82 transition count 99
Applied a total of 15 rules in 12 ms. Remains 82 /89 variables (removed 7) and now considering 99/114 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 82/89 places, 99/114 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-21 11:16:52] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229797 resets) in 786 ms. (1270 steps per ms)
BEST_FIRST walk for 1000000 steps (99414 resets) in 386 ms. (2583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 11:16:53] [INFO ] Invariant cache hit.
[2024-05-21 11:16:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 11:16:53] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:16:53] [INFO ] [Real]Added 29 Read/Feed constraints in 12 ms returned sat
[2024-05-21 11:16:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:16:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:16:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-21 11:16:53] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:16:53] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 6 ms.
[2024-05-21 11:16:53] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 11:16:53] [INFO ] Invariant cache hit.
[2024-05-21 11:16:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 11:16:53] [INFO ] Invariant cache hit.
[2024-05-21 11:16:53] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 11:16:53] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 11:16:53] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 11:16:53] [INFO ] Invariant cache hit.
[2024-05-21 11:16:53] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1928 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3495 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5511ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5703 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9169 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3933 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4087 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Probably explored full state space saw : 58887 states, properties seen :1
Probabilistic random walk after 142571 steps, saw 58887 distinct states, run finished after 164 ms. (steps per millisecond=869 ) properties seen :1
Explored full state space saw : 59225 states, properties seen :0
Exhaustive walk after 143343 steps, saw 59225 distinct states, run finished after 103 ms. (steps per millisecond=1391 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-14 in 7696 ms.
[2024-05-21 11:16:59] [INFO ] Flatten gal took : 36 ms
[2024-05-21 11:16:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 11:16:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 114 transitions and 449 arcs took 4 ms.
Total runtime 63562 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DBSingleClientW-PT-d1m05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/401/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 89
TRANSITIONS: 114
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/401/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 795
MODEL NAME: /home/mcc/execution/401/model
89 places, 114 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-d1m05-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716290220725
--------------------
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-d1m05"
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-d1m05, 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-171624187800501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m05.tgz
mv DBSingleClientW-PT-d1m05 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 ;