fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r421-tajo-167905975200437
Last Updated
May 14, 2023

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m64

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6533.044 1570635.00 1597888.00 530.00 0 0 0 61 0 0 1 0 1 0 1 0 0 1 0 0 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975200437.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d1m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679179829257

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m64
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-18 22:50:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:50:30] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-18 22:50:30] [INFO ] Transformed 1295 places.
[2023-03-18 22:50:30] [INFO ] Transformed 749 transitions.
[2023-03-18 22:50:30] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-18 22:50:31] [INFO ] Computed 6 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1026 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
[2023-03-18 22:50:31] [INFO ] Invariant cache hit.
[2023-03-18 22:50:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 22:50:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:31] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-18 22:50:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:31] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-18 22:50:31] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-18 22:50:31] [INFO ] [Nat]Added 587 Read/Feed constraints in 85 ms returned sat
[2023-03-18 22:50:32] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 164 ms.
[2023-03-18 22:50:32] [INFO ] Added : 12 causal constraints over 3 iterations in 373 ms. Result :sat
Minimization took 387 ms.
[2023-03-18 22:50:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:33] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-18 22:50:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:50:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:33] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-18 22:50:33] [INFO ] [Nat]Added 587 Read/Feed constraints in 139 ms returned sat
[2023-03-18 22:50:33] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 3 ms to minimize.
[2023-03-18 22:50:33] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 1 ms to minimize.
[2023-03-18 22:50:33] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 1 ms to minimize.
[2023-03-18 22:50:33] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2023-03-18 22:50:33] [INFO ] Deduced a trap composed of 95 places in 43 ms of which 1 ms to minimize.
[2023-03-18 22:50:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 456 ms
[2023-03-18 22:50:33] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 89 ms.
[2023-03-18 22:50:34] [INFO ] Added : 23 causal constraints over 5 iterations in 353 ms. Result :sat
Minimization took 229 ms.
[2023-03-18 22:50:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 22:50:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:34] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-18 22:50:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-18 22:50:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:34] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-18 22:50:34] [INFO ] [Nat]Added 587 Read/Feed constraints in 83 ms returned sat
[2023-03-18 22:50:35] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2023-03-18 22:50:35] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 1 ms to minimize.
[2023-03-18 22:50:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-18 22:50:35] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 61 ms.
[2023-03-18 22:50:35] [INFO ] Deduced a trap composed of 152 places in 93 ms of which 8 ms to minimize.
[2023-03-18 22:50:35] [INFO ] Deduced a trap composed of 138 places in 93 ms of which 1 ms to minimize.
[2023-03-18 22:50:35] [INFO ] Deduced a trap composed of 137 places in 60 ms of which 1 ms to minimize.
[2023-03-18 22:50:35] [INFO ] Deduced a trap composed of 141 places in 73 ms of which 1 ms to minimize.
[2023-03-18 22:50:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 481 ms
[2023-03-18 22:50:36] [INFO ] Added : 28 causal constraints over 7 iterations in 823 ms. Result :sat
Minimization took 126 ms.
[2023-03-18 22:50:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-18 22:50:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:36] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-18 22:50:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:36] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-18 22:50:36] [INFO ] [Nat]Added 587 Read/Feed constraints in 94 ms returned sat
[2023-03-18 22:50:36] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2023-03-18 22:50:36] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2023-03-18 22:50:37] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2023-03-18 22:50:37] [INFO ] Deduced a trap composed of 67 places in 33 ms of which 0 ms to minimize.
[2023-03-18 22:50:37] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 0 ms to minimize.
[2023-03-18 22:50:37] [INFO ] Deduced a trap composed of 95 places in 39 ms of which 0 ms to minimize.
[2023-03-18 22:50:37] [INFO ] Deduced a trap composed of 95 places in 44 ms of which 1 ms to minimize.
[2023-03-18 22:50:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 685 ms
[2023-03-18 22:50:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 48 ms.
[2023-03-18 22:50:37] [INFO ] Added : 26 causal constraints over 6 iterations in 290 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [91, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 301 place count 183 transition count 247
Iterating global reduction 1 with 58 rules applied. Total rules applied 359 place count 183 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 365 place count 183 transition count 241
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 408 place count 140 transition count 198
Iterating global reduction 2 with 43 rules applied. Total rules applied 451 place count 140 transition count 198
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 466 place count 140 transition count 183
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 490 place count 116 transition count 157
Iterating global reduction 3 with 24 rules applied. Total rules applied 514 place count 116 transition count 157
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 534 place count 116 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 540 place count 110 transition count 129
Iterating global reduction 4 with 6 rules applied. Total rules applied 546 place count 110 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 552 place count 104 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 558 place count 104 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 560 place count 102 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 562 place count 102 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 564 place count 100 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 566 place count 100 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 568 place count 98 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 570 place count 98 transition count 116
Applied a total of 570 rules in 112 ms. Remains 98 /259 variables (removed 161) and now considering 116/749 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 98/259 places, 116/749 transitions.
// Phase 1: matrix 116 rows 98 cols
[2023-03-18 22:50:38] [INFO ] Computed 4 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 223999 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103762 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103855 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103424 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103514 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 4) seen :0
[2023-03-18 22:50:41] [INFO ] Invariant cache hit.
[2023-03-18 22:50:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:50:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:41] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-18 22:50:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:41] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:50:41] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:41] [INFO ] [Nat]Added 52 Read/Feed constraints in 17 ms returned sat
[2023-03-18 22:50:41] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-18 22:50:41] [INFO ] Added : 13 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 57 ms.
[2023-03-18 22:50:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 22:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-18 22:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Added 52 Read/Feed constraints in 16 ms returned sat
[2023-03-18 22:50:42] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 9 ms.
[2023-03-18 22:50:42] [INFO ] Added : 14 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 23 ms.
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-18 22:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Added 52 Read/Feed constraints in 12 ms returned sat
[2023-03-18 22:50:42] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-18 22:50:42] [INFO ] Added : 19 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 21 ms.
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:42] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-18 22:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:42] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-18 22:50:42] [INFO ] [Nat]Added 52 Read/Feed constraints in 15 ms returned sat
[2023-03-18 22:50:42] [INFO ] Deduced a trap composed of 38 places in 24 ms of which 0 ms to minimize.
[2023-03-18 22:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-18 22:50:42] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-18 22:50:42] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [64, 10, 1, 10] Max seen :[0, 0, 0, 0]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-18 22:50:42] [INFO ] Invariant cache hit.
[2023-03-18 22:50:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 22:50:42] [INFO ] Invariant cache hit.
[2023-03-18 22:50:42] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:43] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-18 22:50:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:50:43] [INFO ] Invariant cache hit.
[2023-03-18 22:50:43] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 98/98 places, 116/116 transitions.
[2023-03-18 22:50:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224439 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103175 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103428 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103779 resets, run finished after 471 ms. (steps per millisecond=2123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103860 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 4) seen :0
[2023-03-18 22:50:46] [INFO ] Invariant cache hit.
[2023-03-18 22:50:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-18 22:50:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-18 22:50:46] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:46] [INFO ] [Nat]Added 52 Read/Feed constraints in 12 ms returned sat
[2023-03-18 22:50:46] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-18 22:50:46] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 103 ms.
[2023-03-18 22:50:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-18 22:50:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-18 22:50:46] [INFO ] [Nat]Added 52 Read/Feed constraints in 17 ms returned sat
[2023-03-18 22:50:46] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-18 22:50:47] [INFO ] Added : 14 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 22 ms.
[2023-03-18 22:50:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-18 22:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Nat]Added 52 Read/Feed constraints in 12 ms returned sat
[2023-03-18 22:50:47] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 6 ms.
[2023-03-18 22:50:47] [INFO ] Added : 19 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 22 ms.
[2023-03-18 22:50:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:47] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-18 22:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:47] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:50:47] [INFO ] [Nat]Added 52 Read/Feed constraints in 15 ms returned sat
[2023-03-18 22:50:47] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
[2023-03-18 22:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-18 22:50:47] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 7 ms.
[2023-03-18 22:50:47] [INFO ] Added : 19 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [64, 10, 1, 10] Max seen :[1, 0, 0, 0]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-18 22:50:47] [INFO ] Invariant cache hit.
[2023-03-18 22:50:47] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-18 22:50:47] [INFO ] Invariant cache hit.
[2023-03-18 22:50:47] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:47] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-18 22:50:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:50:47] [INFO ] Invariant cache hit.
[2023-03-18 22:50:47] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 98/98 places, 116/116 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
[2023-03-18 22:50:48] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 998 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-18 22:50:48] [INFO ] Invariant cache hit.
[2023-03-18 22:50:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:48] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-18 22:50:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-18 22:50:48] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:48] [INFO ] [Nat]Added 52 Read/Feed constraints in 26 ms returned sat
[2023-03-18 22:50:48] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-18 22:50:48] [INFO ] Added : 13 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 92 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 89 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 87 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 85 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 83 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 36 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 77 transition count 81
Applied a total of 46 rules in 56 ms. Remains 77 /98 variables (removed 21) and now considering 81/116 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 77/98 places, 81/116 transitions.
// Phase 1: matrix 81 rows 77 cols
[2023-03-18 22:50:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224092 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103304 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 1) seen :0
[2023-03-18 22:50:49] [INFO ] Invariant cache hit.
[2023-03-18 22:50:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:49] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-18 22:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:50:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:50:49] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2023-03-18 22:50:49] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 60 transitions) in 4 ms.
[2023-03-18 22:50:49] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-18 22:50:49] [INFO ] Invariant cache hit.
[2023-03-18 22:50:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 22:50:49] [INFO ] Invariant cache hit.
[2023-03-18 22:50:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:50:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-18 22:50:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:50:49] [INFO ] Invariant cache hit.
[2023-03-18 22:50:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 77/77 places, 81/81 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 in 1796 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
// Phase 1: matrix 116 rows 98 cols
[2023-03-18 22:50:49] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1047 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-18 22:50:49] [INFO ] Invariant cache hit.
[2023-03-18 22:50:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:49] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:49] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:50:49] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:49] [INFO ] [Nat]Added 52 Read/Feed constraints in 16 ms returned sat
[2023-03-18 22:50:49] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-18 22:50:50] [INFO ] Added : 14 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 93 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 90 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 88 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 88 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 86 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 84 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 84 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 82 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 80 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Applied a total of 44 rules in 18 ms. Remains 78 /98 variables (removed 20) and now considering 82/116 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 78/98 places, 82/116 transitions.
// Phase 1: matrix 82 rows 78 cols
[2023-03-18 22:50:50] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224333 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103678 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :0
[2023-03-18 22:50:50] [INFO ] Invariant cache hit.
[2023-03-18 22:50:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-18 22:50:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:51] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:50:51] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:50:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 11 ms returned sat
[2023-03-18 22:50:51] [INFO ] Computed and/alt/rep : 20/47/20 causal constraints (skipped 61 transitions) in 4 ms.
[2023-03-18 22:50:51] [INFO ] Added : 16 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-18 22:50:51] [INFO ] Invariant cache hit.
[2023-03-18 22:50:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-18 22:50:51] [INFO ] Invariant cache hit.
[2023-03-18 22:50:51] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:50:51] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-18 22:50:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:50:51] [INFO ] Invariant cache hit.
[2023-03-18 22:50:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 78/78 places, 82/82 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 in 1608 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
// Phase 1: matrix 116 rows 98 cols
[2023-03-18 22:50:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 999 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-18 22:50:51] [INFO ] Invariant cache hit.
[2023-03-18 22:50:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:51] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-18 22:50:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:51] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-18 22:50:51] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:51] [INFO ] [Nat]Added 52 Read/Feed constraints in 12 ms returned sat
[2023-03-18 22:50:51] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-18 22:50:51] [INFO ] Added : 19 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 93 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 93 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 93 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 92 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 92 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 92 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 91 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 91 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 90 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 90 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 89 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 89 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 88 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 88 transition count 93
Applied a total of 25 rules in 22 ms. Remains 88 /98 variables (removed 10) and now considering 93/116 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 88/98 places, 93/116 transitions.
// Phase 1: matrix 93 rows 88 cols
[2023-03-18 22:50:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224241 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103388 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
[2023-03-18 22:50:53] [INFO ] Invariant cache hit.
[2023-03-18 22:50:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:53] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-18 22:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-18 22:50:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 22:50:53] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2023-03-18 22:50:53] [INFO ] Computed and/alt/rep : 24/53/24 causal constraints (skipped 68 transitions) in 6 ms.
[2023-03-18 22:50:53] [INFO ] Added : 20 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 88/88 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2023-03-18 22:50:53] [INFO ] Invariant cache hit.
[2023-03-18 22:50:53] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 22:50:53] [INFO ] Invariant cache hit.
[2023-03-18 22:50:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 22:50:53] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-18 22:50:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:50:53] [INFO ] Invariant cache hit.
[2023-03-18 22:50:53] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 88/88 places, 93/93 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 in 2242 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
// Phase 1: matrix 116 rows 98 cols
[2023-03-18 22:50:53] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-18 22:50:53] [INFO ] Invariant cache hit.
[2023-03-18 22:50:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:53] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-18 22:50:53] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:50:53] [INFO ] [Nat]Added 52 Read/Feed constraints in 16 ms returned sat
[2023-03-18 22:50:53] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2023-03-18 22:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-18 22:50:53] [INFO ] Computed and/alt/rep : 26/63/26 causal constraints (skipped 89 transitions) in 8 ms.
[2023-03-18 22:50:53] [INFO ] Added : 19 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 116/116 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 95 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 93 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 93 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 91 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 90 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 90 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 89 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 89 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 88 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 87 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 85 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 83 transition count 96
Applied a total of 33 rules in 33 ms. Remains 83 /98 variables (removed 15) and now considering 96/116 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 83/98 places, 96/116 transitions.
// Phase 1: matrix 96 rows 83 cols
[2023-03-18 22:50:54] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224204 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103722 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties (out of 1) seen :0
[2023-03-18 22:50:55] [INFO ] Invariant cache hit.
[2023-03-18 22:50:55] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:50:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 22:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:55] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-18 22:50:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:50:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:50:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:50:55] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:50:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-18 22:50:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2023-03-18 22:50:55] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 7 ms.
[2023-03-18 22:50:55] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-18 22:50:55] [INFO ] Invariant cache hit.
[2023-03-18 22:50:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 22:50:55] [INFO ] Invariant cache hit.
[2023-03-18 22:50:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-18 22:50:56] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-18 22:50:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:50:56] [INFO ] Invariant cache hit.
[2023-03-18 22:50:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 in 2445 ms.
[2023-03-18 22:50:56] [INFO ] Flatten gal took : 53 ms
[2023-03-18 22:50:56] [INFO ] Applying decomposition
[2023-03-18 22:50:56] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6878508816174860280.txt' '-o' '/tmp/graph6878508816174860280.bin' '-w' '/tmp/graph6878508816174860280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6878508816174860280.bin' '-l' '-1' '-v' '-w' '/tmp/graph6878508816174860280.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:50:56] [INFO ] Decomposing Gal with order
[2023-03-18 22:50:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:50:56] [INFO ] Removed a total of 99 redundant transitions.
[2023-03-18 22:50:56] [INFO ] Flatten gal took : 72 ms
[2023-03-18 22:50:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 20 ms.
[2023-03-18 22:50:56] [INFO ] Time to serialize gal into /tmp/UpperBounds14792737984547587847.gal : 20 ms
[2023-03-18 22:50:56] [INFO ] Time to serialize properties into /tmp/UpperBounds13786049792881289689.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14792737984547587847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13786049792881289689.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds13786049792881289689.prop.
Detected timeout of ITS tools.
[2023-03-18 23:11:04] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:11:04] [INFO ] Time to serialize gal into /tmp/UpperBounds15303967298210554790.gal : 1 ms
[2023-03-18 23:11:04] [INFO ] Time to serialize properties into /tmp/UpperBounds4466758750023487346.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15303967298210554790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4466758750023487346.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds4466758750023487346.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.54593e+17,334.218,3124960,2,76631,5,1.45854e+07,6,0,510,1.36355e+07,0
Total reachable state count : 254592894395514307

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 61
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 :0 <= l1206 <= 61
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 61 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-03,0,334.369,3124960,1,0,7,1.45854e+07,9,1,747,1.36355e+07,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 :0 <= l971 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-06,0,334.374,3124960,1,0,8,1.45854e+07,10,1,756,1.36355e+07,5
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 :0 <= l191 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-08,0,334.561,3124960,1,0,9,1.45854e+07,11,1,863,1.36355e+07,6
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 :0 <= l1190 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-13,0,334.564,3124960,1,0,10,1.45854e+07,12,1,886,1.36355e+07,7
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1568987 ms.

BK_STOP 1679181399892

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d1m64"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r421-tajo-167905975200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;