fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r377-smll-171683809800141
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d2m96

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11379.044 1249589.00 3657273.00 2016.60 0 0 0 0 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.r377-smll-171683809800141.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 SieveSingleMsgMbox-PT-d2m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809800141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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-d2m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716932904976

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 21:48:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 21:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:48:27] [INFO ] Load time of PNML (sax parser for PT used): 499 ms
[2024-05-28 21:48:27] [INFO ] Transformed 2398 places.
[2024-05-28 21:48:28] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:48:28] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 765 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 1984 places in 31 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 21:48:28] [INFO ] Computed 6 invariants in 109 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
RANDOM walk for 10000 steps (2187 resets) in 465 ms. (21 steps per ms)
BEST_FIRST walk for 30002 steps (2734 resets) in 383 ms. (78 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
[2024-05-28 21:48:29] [INFO ] Invariant cache hit.
[2024-05-28 21:48:29] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-28 21:48:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 16 ms returned sat
[2024-05-28 21:48:30] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2024-05-28 21:48:31] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 21:48:31] [INFO ] [Real]Added 1674 Read/Feed constraints in 588 ms returned sat
[2024-05-28 21:48:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 21:48:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 21:48:32] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-28 21:48:33] [INFO ] [Nat]Added 1674 Read/Feed constraints in 652 ms returned sat
[2024-05-28 21:48:33] [INFO ] Deduced a trap composed of 89 places in 534 ms of which 48 ms to minimize.
[2024-05-28 21:48:34] [INFO ] Deduced a trap composed of 111 places in 222 ms of which 18 ms to minimize.
[2024-05-28 21:48:34] [INFO ] Deduced a trap composed of 105 places in 235 ms of which 5 ms to minimize.
[2024-05-28 21:48:34] [INFO ] Deduced a trap composed of 155 places in 275 ms of which 14 ms to minimize.
[2024-05-28 21:48:35] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 2353 ms
[2024-05-28 21:48:35] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-28 21:48:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-28 21:48:36] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2024-05-28 21:48:37] [INFO ] [Real]Added 1674 Read/Feed constraints in 772 ms returned sat
[2024-05-28 21:48:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 21:48:37] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 21:48:38] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2024-05-28 21:48:38] [INFO ] [Nat]Added 1674 Read/Feed constraints in 571 ms returned sat
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 175 places in 356 ms of which 5 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 285 places in 390 ms of which 5 ms to minimize.
[2024-05-28 21:48:40] [INFO ] Deduced a trap composed of 256 places in 476 ms of which 5 ms to minimize.
[2024-05-28 21:48:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2049 ms
[2024-05-28 21:48:41] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 495 ms.
[2024-05-28 21:48:42] [INFO ] Added : 12 causal constraints over 3 iterations in 1089 ms. Result :sat
Minimization took 400 ms.
[2024-05-28 21:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 21:48:42] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 21:48:43] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2024-05-28 21:48:43] [INFO ] [Real]Added 1674 Read/Feed constraints in 509 ms returned sat
[2024-05-28 21:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 21:48:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 21:48:44] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2024-05-28 21:48:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 21:48:45] [INFO ] [Nat]Added 1674 Read/Feed constraints in 1016 ms returned sat
[2024-05-28 21:48:46] [INFO ] Deduced a trap composed of 45 places in 471 ms of which 5 ms to minimize.
[2024-05-28 21:48:46] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 4 ms to minimize.
[2024-05-28 21:48:46] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 3 ms to minimize.
[2024-05-28 21:48:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1570 ms
[2024-05-28 21:48:47] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 234 ms.
[2024-05-28 21:48:48] [INFO ] Added : 35 causal constraints over 8 iterations in 1553 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.8 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 389
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 389
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 379
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1169 place count 178 transition count 287
Iterating global reduction 2 with 92 rules applied. Total rules applied 1261 place count 178 transition count 287
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1297 place count 178 transition count 251
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1335 place count 140 transition count 199
Iterating global reduction 3 with 38 rules applied. Total rules applied 1373 place count 140 transition count 199
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1400 place count 140 transition count 172
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1409 place count 131 transition count 158
Iterating global reduction 4 with 9 rules applied. Total rules applied 1418 place count 131 transition count 158
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1426 place count 123 transition count 150
Iterating global reduction 4 with 8 rules applied. Total rules applied 1434 place count 123 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1438 place count 119 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 1442 place count 119 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1444 place count 119 transition count 144
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1448 place count 115 transition count 140
Iterating global reduction 5 with 4 rules applied. Total rules applied 1452 place count 115 transition count 140
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1455 place count 112 transition count 137
Iterating global reduction 5 with 3 rules applied. Total rules applied 1458 place count 112 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1459 place count 111 transition count 134
Iterating global reduction 5 with 1 rules applied. Total rules applied 1460 place count 111 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1461 place count 110 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 1462 place count 110 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1463 place count 109 transition count 132
Iterating global reduction 5 with 1 rules applied. Total rules applied 1464 place count 109 transition count 132
Applied a total of 1464 rules in 176 ms. Remains 109 /414 variables (removed 305) and now considering 132/1954 (removed 1822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 109/414 places, 132/1954 transitions.
// Phase 1: matrix 132 rows 109 cols
[2024-05-28 21:48:49] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
RANDOM walk for 1000000 steps (223830 resets) in 1314 ms. (760 steps per ms)
BEST_FIRST walk for 3000002 steps (310119 resets) in 2015 ms. (1488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
[2024-05-28 21:48:52] [INFO ] Invariant cache hit.
[2024-05-28 21:48:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:48:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:48:52] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 21:48:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:48:52] [INFO ] [Real]Added 57 Read/Feed constraints in 41 ms returned sat
[2024-05-28 21:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-28 21:48:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-28 21:48:52] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Nat]Added 57 Read/Feed constraints in 44 ms returned sat
[2024-05-28 21:48:53] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 14 ms to minimize.
[2024-05-28 21:48:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-28 21:48:53] [INFO ] Computed and/alt/rep : 29/76/29 causal constraints (skipped 102 transitions) in 29 ms.
[2024-05-28 21:48:53] [INFO ] Added : 17 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 76 ms.
[2024-05-28 21:48:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Real]Added 57 Read/Feed constraints in 26 ms returned sat
[2024-05-28 21:48:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Nat]Added 57 Read/Feed constraints in 29 ms returned sat
[2024-05-28 21:48:53] [INFO ] Computed and/alt/rep : 29/76/29 causal constraints (skipped 102 transitions) in 18 ms.
[2024-05-28 21:48:53] [INFO ] Added : 10 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 118 ms.
[2024-05-28 21:48:54] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:48:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:48:54] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-28 21:48:54] [INFO ] [Real]Added 57 Read/Feed constraints in 31 ms returned sat
[2024-05-28 21:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 21:48:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:48:54] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-28 21:48:54] [INFO ] [Nat]Added 57 Read/Feed constraints in 38 ms returned sat
[2024-05-28 21:48:54] [INFO ] Computed and/alt/rep : 29/76/29 causal constraints (skipped 102 transitions) in 19 ms.
[2024-05-28 21:48:54] [INFO ] Added : 19 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 132/132 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 109/109 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 132/132 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 21:48:54] [INFO ] Invariant cache hit.
[2024-05-28 21:48:54] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-28 21:48:55] [INFO ] Invariant cache hit.
[2024-05-28 21:48:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:48:55] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-28 21:48:55] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 21:48:55] [INFO ] Invariant cache hit.
[2024-05-28 21:48:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/241 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 57/170 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 170 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 132/241 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 57/170 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 131/301 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 21:49:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 1/302 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 302 constraints, problems are : Problem set: 3 solved, 128 unsolved in 11364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
After SMT, in 16182ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 16195ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/109 places, 129/132 transitions.
Graph (complete) has 311 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 106 /109 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 106 cols
[2024-05-28 21:49:11] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 21:49:11] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 21:49:11] [INFO ] Invariant cache hit.
[2024-05-28 21:49:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:49:12] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/109 places, 129/132 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17300 ms. Remains : 106/109 places, 129/132 transitions.
[2024-05-28 21:49:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
RANDOM walk for 1000000 steps (224611 resets) in 1193 ms. (837 steps per ms)
BEST_FIRST walk for 3000001 steps (309230 resets) in 1827 ms. (1641 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
[2024-05-28 21:49:15] [INFO ] Invariant cache hit.
[2024-05-28 21:49:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 21:49:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:49:15] [INFO ] [Real]Added 56 Read/Feed constraints in 18 ms returned sat
[2024-05-28 21:49:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Nat]Added 56 Read/Feed constraints in 18 ms returned sat
[2024-05-28 21:49:15] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:49:15] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:49:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2024-05-28 21:49:15] [INFO ] Computed and/alt/rep : 28/71/28 causal constraints (skipped 100 transitions) in 13 ms.
[2024-05-28 21:49:15] [INFO ] Added : 17 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 81 ms.
[2024-05-28 21:49:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2024-05-28 21:49:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-28 21:49:15] [INFO ] [Nat]Added 56 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:49:15] [INFO ] Computed and/alt/rep : 28/71/28 causal constraints (skipped 100 transitions) in 14 ms.
[2024-05-28 21:49:15] [INFO ] Added : 12 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 69 ms.
[2024-05-28 21:49:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:16] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 21:49:16] [INFO ] [Real]Added 56 Read/Feed constraints in 22 ms returned sat
[2024-05-28 21:49:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:16] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-28 21:49:16] [INFO ] [Nat]Added 56 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:49:16] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:49:16] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:49:16] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 2 ms to minimize.
[2024-05-28 21:49:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
[2024-05-28 21:49:16] [INFO ] Computed and/alt/rep : 28/71/28 causal constraints (skipped 100 transitions) in 11 ms.
[2024-05-28 21:49:16] [INFO ] Added : 20 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 106/106 places, 129/129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-28 21:49:16] [INFO ] Invariant cache hit.
[2024-05-28 21:49:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 21:49:16] [INFO ] Invariant cache hit.
[2024-05-28 21:49:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:49:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-05-28 21:49:17] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-28 21:49:17] [INFO ] Invariant cache hit.
[2024-05-28 21:49:17] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 4 (OVERLAPS) 129/235 variables, 106/109 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 56/165 constraints. Problems are: Problem set: 3 solved, 125 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 165 constraints, problems are : Problem set: 3 solved, 125 unsolved in 4675 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 128/231 variables, 103/106 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 15/176 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 4/235 variables, 3/179 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 110/290 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 21:49:28] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 1/291 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/235 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 291 constraints, problems are : Problem set: 3 solved, 125 unsolved in 17491 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 1/1 constraints]
After SMT, in 22532ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 22536ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/106 places, 126/129 transitions.
Graph (complete) has 302 edges and 106 vertex of which 103 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 103 /106 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 103 cols
[2024-05-28 21:49:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:49:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 21:49:39] [INFO ] Invariant cache hit.
[2024-05-28 21:49:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:49:40] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/106 places, 126/129 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23399 ms. Remains : 103/106 places, 126/129 transitions.
[2024-05-28 21:49:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
RANDOM walk for 1000000 steps (224504 resets) in 1165 ms. (857 steps per ms)
BEST_FIRST walk for 3000003 steps (310502 resets) in 1850 ms. (1620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
[2024-05-28 21:49:43] [INFO ] Invariant cache hit.
[2024-05-28 21:49:43] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 21:49:43] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:49:43] [INFO ] [Real]Added 55 Read/Feed constraints in 23 ms returned sat
[2024-05-28 21:49:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Nat]Added 55 Read/Feed constraints in 17 ms returned sat
[2024-05-28 21:49:43] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-28 21:49:43] [INFO ] Added : 13 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 65 ms.
[2024-05-28 21:49:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Real]Added 55 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:49:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Nat]Added 55 Read/Feed constraints in 15 ms returned sat
[2024-05-28 21:49:43] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-28 21:49:43] [INFO ] Added : 14 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 62 ms.
[2024-05-28 21:49:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Real]Added 55 Read/Feed constraints in 21 ms returned sat
[2024-05-28 21:49:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:49:43] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 21:49:44] [INFO ] [Nat]Added 55 Read/Feed constraints in 23 ms returned sat
[2024-05-28 21:49:44] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-28 21:49:44] [INFO ] Added : 20 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 12]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-28 21:49:44] [INFO ] Invariant cache hit.
[2024-05-28 21:49:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 21:49:44] [INFO ] Invariant cache hit.
[2024-05-28 21:49:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:49:44] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-28 21:49:44] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-28 21:49:44] [INFO ] Invariant cache hit.
[2024-05-28 21:49:44] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/229 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 55/161 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 161 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3721 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/229 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 55/161 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 125/286 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 286 constraints, problems are : Problem set: 0 solved, 125 unsolved in 8231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 12103ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 12105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12494 ms. Remains : 103/103 places, 126/126 transitions.
RANDOM walk for 40000 steps (8981 resets) in 1468 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4146 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4141 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4156 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (4145 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4070 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (4120 resets) in 136 ms. (292 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 636945 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :4 out of 6
Probabilistic random walk after 636945 steps, saw 284760 distinct states, run finished after 3006 ms. (steps per millisecond=211 ) properties seen :4
[2024-05-28 21:50:00] [INFO ] Invariant cache hit.
[2024-05-28 21:50:00] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 98/115 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 107/222 variables, 79/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 28/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
After SMT solving in domain Real declared 229/229 variables, and 154 constraints, problems are : Problem set: 2 solved, 0 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/103 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0] Max Struct:[12, 12]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
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:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
[2024-05-28 21:50:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2282 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (1018 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 21:50:00] [INFO ] Invariant cache hit.
[2024-05-28 21:50:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:00] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-28 21:50:00] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:50:00] [INFO ] [Real]Added 55 Read/Feed constraints in 24 ms returned sat
[2024-05-28 21:50:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 21:50:01] [INFO ] [Nat]Added 55 Read/Feed constraints in 20 ms returned sat
[2024-05-28 21:50:01] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 98 transitions) in 14 ms.
[2024-05-28 21:50:01] [INFO ] Added : 13 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 126/126 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 113
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 99 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 97 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 97 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 95 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 95 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 93 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 93 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 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 24 place count 92 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 91 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 91 transition count 99
Applied a total of 26 rules in 28 ms. Remains 91 /103 variables (removed 12) and now considering 99/126 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 91/103 places, 99/126 transitions.
// Phase 1: matrix 99 rows 91 cols
[2024-05-28 21:50:01] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224612 resets) in 1126 ms. (887 steps per ms)
BEST_FIRST walk for 1000000 steps (103070 resets) in 491 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 21:50:02] [INFO ] Invariant cache hit.
[2024-05-28 21:50:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:03] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:50:03] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-28 21:50:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 21:50:03] [INFO ] [Real]Added 37 Read/Feed constraints in 19 ms returned sat
[2024-05-28 21:50:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:50:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:03] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:50:03] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-28 21:50:03] [INFO ] [Nat]Added 37 Read/Feed constraints in 19 ms returned sat
[2024-05-28 21:50:03] [INFO ] Computed and/alt/rep : 23/56/23 causal constraints (skipped 75 transitions) in 9 ms.
[2024-05-28 21:50:03] [INFO ] Added : 18 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/91 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 21:50:03] [INFO ] Invariant cache hit.
[2024-05-28 21:50:03] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 21:50:03] [INFO ] Invariant cache hit.
[2024-05-28 21:50:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 21:50:03] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-28 21:50:03] [INFO ] Redundant transitions in 4 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-28 21:50:03] [INFO ] Invariant cache hit.
[2024-05-28 21:50:03] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/190 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 131 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3919 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 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/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/190 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 98/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 229 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 10710ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10713ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11238 ms. Remains : 91/91 places, 99/99 transitions.
RANDOM walk for 40000 steps (8932 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4193 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4067 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2306587 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :1 out of 2
Probabilistic random walk after 2306587 steps, saw 1075503 distinct states, run finished after 3001 ms. (steps per millisecond=768 ) properties seen :1
[2024-05-28 21:50:17] [INFO ] Invariant cache hit.
[2024-05-28 21:50:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/78 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 106/184 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 26/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/190 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 190/190 variables, and 125 constraints, problems are : Problem set: 1 solved, 0 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-06 in 17023 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
// Phase 1: matrix 126 rows 103 cols
[2024-05-28 21:50:17] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2213 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1026 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 21:50:17] [INFO ] Invariant cache hit.
[2024-05-28 21:50:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:18] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-28 21:50:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 21:50:18] [INFO ] [Real]Added 55 Read/Feed constraints in 33 ms returned sat
[2024-05-28 21:50:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:50:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:50:18] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-28 21:50:18] [INFO ] [Nat]Added 55 Read/Feed constraints in 37 ms returned sat
[2024-05-28 21:50:18] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 98 transitions) in 16 ms.
[2024-05-28 21:50:18] [INFO ] Added : 20 causal constraints over 4 iterations in 119 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 126/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 99 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 99 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 98 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 98 transition count 120
Applied a total of 10 rules in 23 ms. Remains 98 /103 variables (removed 5) and now considering 120/126 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 98/103 places, 120/126 transitions.
// Phase 1: matrix 120 rows 98 cols
[2024-05-28 21:50:18] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (225110 resets) in 1398 ms. (714 steps per ms)
BEST_FIRST walk for 1000000 steps (103452 resets) in 542 ms. (1841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-05-28 21:50:20] [INFO ] Invariant cache hit.
[2024-05-28 21:50:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:20] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-28 21:50:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 21:50:20] [INFO ] [Real]Added 53 Read/Feed constraints in 19 ms returned sat
[2024-05-28 21:50:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:50:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:50:20] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-28 21:50:20] [INFO ] [Nat]Added 53 Read/Feed constraints in 35 ms returned sat
[2024-05-28 21:50:20] [INFO ] Computed and/alt/rep : 25/63/25 causal constraints (skipped 94 transitions) in 14 ms.
[2024-05-28 21:50:20] [INFO ] Added : 16 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/98 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 120/120 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 21:50:21] [INFO ] Invariant cache hit.
[2024-05-28 21:50:21] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 21:50:21] [INFO ] Invariant cache hit.
[2024-05-28 21:50:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 21:50:21] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-28 21:50:21] [INFO ] Redundant transitions in 6 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 21:50:21] [INFO ] Invariant cache hit.
[2024-05-28 21:50:21] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/218 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5520 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/218 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 119/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 273 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8910 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 14571ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 14573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15035 ms. Remains : 98/98 places, 120/120 transitions.
RANDOM walk for 40000 steps (8956 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4189 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4086 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1821270 steps, run timeout after 3001 ms. (steps per millisecond=606 ) properties seen :1 out of 2
Probabilistic random walk after 1821270 steps, saw 797607 distinct states, run finished after 3001 ms. (steps per millisecond=606 ) properties seen :1
[2024-05-28 21:50:39] [INFO ] Invariant cache hit.
[2024-05-28 21:50:39] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/108 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/212 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 218/218 variables, and 148 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-15 in 21448 ms.
[2024-05-28 21:50:39] [INFO ] Flatten gal took : 60 ms
[2024-05-28 21:50:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-28 21:50:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 126 transitions and 498 arcs took 6 ms.
Total runtime 132423 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m96

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 103
TRANSITIONS: 126
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/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: 827
MODEL NAME: /home/mcc/execution/414/model
103 places, 126 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716934154565

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-d2m96"
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 SieveSingleMsgMbox-PT-d2m96, 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 r377-smll-171683809800141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m96.tgz
mv SieveSingleMsgMbox-PT-d2m96 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 ;