About the Execution of GreatSPN+red for SafeBus-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2031.035 | 374741.00 | 466690.00 | 1042.70 | 1 1 5 5 6 1 6 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078400421.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 SafeBus-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078400421
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K 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 SafeBus-PT-06-UpperBounds-00
FORMULA_NAME SafeBus-PT-06-UpperBounds-01
FORMULA_NAME SafeBus-PT-06-UpperBounds-02
FORMULA_NAME SafeBus-PT-06-UpperBounds-03
FORMULA_NAME SafeBus-PT-06-UpperBounds-04
FORMULA_NAME SafeBus-PT-06-UpperBounds-05
FORMULA_NAME SafeBus-PT-06-UpperBounds-06
FORMULA_NAME SafeBus-PT-06-UpperBounds-07
FORMULA_NAME SafeBus-PT-06-UpperBounds-08
FORMULA_NAME SafeBus-PT-06-UpperBounds-09
FORMULA_NAME SafeBus-PT-06-UpperBounds-10
FORMULA_NAME SafeBus-PT-06-UpperBounds-11
FORMULA_NAME SafeBus-PT-06-UpperBounds-12
FORMULA_NAME SafeBus-PT-06-UpperBounds-13
FORMULA_NAME SafeBus-PT-06-UpperBounds-14
FORMULA_NAME SafeBus-PT-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716856319191
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:32:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 00:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:32:00] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-28 00:32:00] [INFO ] Transformed 144 places.
[2024-05-28 00:32:00] [INFO ] Transformed 451 transitions.
[2024-05-28 00:32:00] [INFO ] Found NUPN structural information;
[2024-05-28 00:32:00] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 6, 0, 1, 0, 0, 1, 0, 0, 1] Max Struct:[1, 6, 6, 6, 6, 6, 30, 1, 1, 1, 1, 1, 1, 1]
FORMULA SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 6, 30, 1, 1, 1, 1]
[2024-05-28 00:32:00] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:32:00] [INFO ] Computed 29 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 6, 30, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 74 ms. (133 steps per ms)
FORMULA SafeBus-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 93 ms. (425 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 1, 1] Max Struct:[6, 6, 6, 30]
[2024-05-28 00:32:00] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-28 00:32:00] [INFO ] Invariant cache hit.
[2024-05-28 00:32:01] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-28 00:32:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:32:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-28 00:32:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:32:01] [INFO ] [Nat]Added 43 Read/Feed constraints in 61 ms returned sat
[2024-05-28 00:32:01] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 44 ms.
[2024-05-28 00:32:01] [INFO ] Added : 2 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 113 ms.
[2024-05-28 00:32:01] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 00:32:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:32:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-28 00:32:01] [INFO ] [Nat]Added 43 Read/Feed constraints in 39 ms returned sat
[2024-05-28 00:32:01] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 35 ms.
[2024-05-28 00:32:01] [INFO ] Added : 1 causal constraints over 1 iterations in 64 ms. Result :sat
Minimization took 102 ms.
[2024-05-28 00:32:02] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned unsat
[2024-05-28 00:32:02] [INFO ] [Real]Absence check using 14 positive place invariants in 51 ms returned sat
[2024-05-28 00:32:02] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 1, 1] Max Struct:[6, 6, 1, 1]
FORMULA SafeBus-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 49 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 138/138 places, 451/451 transitions.
[2024-05-28 00:32:02] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-28 00:32:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2462 ms. (406 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1742 ms. (1147 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-28 00:32:06] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-28 00:32:06] [INFO ] Invariant cache hit.
[2024-05-28 00:32:06] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 00:32:06] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:32:06] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-28 00:32:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:32:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 00:32:06] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:32:06] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-28 00:32:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:32:07] [INFO ] [Nat]Added 43 Read/Feed constraints in 57 ms returned sat
[2024-05-28 00:32:07] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 24 ms.
[2024-05-28 00:32:07] [INFO ] Added : 2 causal constraints over 1 iterations in 64 ms. Result :sat
Minimization took 110 ms.
[2024-05-28 00:32:07] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 00:32:07] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:32:07] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 00:32:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:32:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 00:32:07] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:32:07] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-28 00:32:07] [INFO ] [Nat]Added 43 Read/Feed constraints in 38 ms returned sat
[2024-05-28 00:32:07] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 39 ms.
[2024-05-28 00:32:07] [INFO ] Added : 1 causal constraints over 1 iterations in 83 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 30 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 34 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-28 00:32:07] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-28 00:32:07] [INFO ] Invariant cache hit.
[2024-05-28 00:32:08] [INFO ] Implicit Places using invariants in 294 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 298 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 75 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2024-05-28 00:32:08] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-28 00:32:08] [INFO ] Computed 23 invariants in 14 ms
[2024-05-28 00:32:08] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-28 00:32:08] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-28 00:32:08] [INFO ] Invariant cache hit.
[2024-05-28 00:32:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:32:08] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1154 ms. Remains : 126/138 places, 565/451 transitions.
[2024-05-28 00:32:09] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-28 00:32:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3232 ms. (309 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 2091 ms. (956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-28 00:32:14] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-28 00:32:14] [INFO ] Invariant cache hit.
[2024-05-28 00:32:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:32:14] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:32:14] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-28 00:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:32:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-28 00:32:14] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 00:32:14] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-28 00:32:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:32:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 67 ms returned sat
[2024-05-28 00:32:14] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 48 ms.
[2024-05-28 00:32:14] [INFO ] Added : 7 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 552 ms.
[2024-05-28 00:32:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:32:15] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:32:15] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-28 00:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:32:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:32:15] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:32:15] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 00:32:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 111 ms returned sat
[2024-05-28 00:32:15] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 42 ms.
[2024-05-28 00:32:15] [INFO ] Added : 0 causal constraints over 0 iterations in 71 ms. Result :sat
Minimization took 675 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 24 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 89 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-05-28 00:32:16] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-28 00:32:16] [INFO ] Invariant cache hit.
[2024-05-28 00:32:16] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-28 00:32:16] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-28 00:32:16] [INFO ] Invariant cache hit.
[2024-05-28 00:32:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:32:17] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-28 00:32:17] [INFO ] Redundant transitions in 28 ms returned []
Running 559 sub problems to find dead transitions.
[2024-05-28 00:32:17] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-28 00:32:17] [INFO ] Invariant cache hit.
[2024-05-28 00:32:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-28 00:32:21] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 18 ms to minimize.
[2024-05-28 00:32:21] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-28 00:32:22] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:32:23] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:32:23] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-28 00:32:23] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 5 ms to minimize.
[2024-05-28 00:32:23] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:32:23] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 00:32:23] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-28 00:32:26] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:32:26] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:32:26] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:32:27] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:32:27] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:32:27] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/170 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-28 00:32:29] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:32:29] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-28 00:32:29] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-28 00:32:29] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-28 00:32:29] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:32:29] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-28 00:32:30] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:32:30] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 8/178 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-28 00:32:32] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:32:32] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2024-05-28 00:32:32] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 3/181 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/181 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/307 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/350 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/350 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 350 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30044 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 36 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 32/181 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-28 00:32:53] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/182 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30036 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/559 constraints, Known Traps: 33/33 constraints]
After SMT, in 61797ms problems are : Problem set: 36 solved, 523 unsolved
Search for dead transitions found 36 dead transitions in 61821ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 20 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-28 00:33:19] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62764 ms. Remains : 126/126 places, 529/565 transitions.
[2024-05-28 00:33:19] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-28 00:33:19] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3105 ms. (321 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2009 ms. (995 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-28 00:33:24] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:33:24] [INFO ] Invariant cache hit.
[2024-05-28 00:33:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:33:24] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:33:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-28 00:33:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:33:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:33:24] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:33:24] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 00:33:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:33:24] [INFO ] [Nat]Added 43 Read/Feed constraints in 99 ms returned sat
[2024-05-28 00:33:24] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 37 ms.
[2024-05-28 00:33:24] [INFO ] Added : 6 causal constraints over 2 iterations in 104 ms. Result :sat
Minimization took 377 ms.
[2024-05-28 00:33:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:33:25] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:33:25] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-28 00:33:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:33:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:33:25] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:33:25] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-28 00:33:25] [INFO ] [Nat]Added 43 Read/Feed constraints in 57 ms returned sat
[2024-05-28 00:33:25] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 29 ms.
[2024-05-28 00:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 371 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-28 00:33:26] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:33:26] [INFO ] Invariant cache hit.
[2024-05-28 00:33:26] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-28 00:33:26] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:33:26] [INFO ] Invariant cache hit.
[2024-05-28 00:33:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:33:27] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2024-05-28 00:33:27] [INFO ] Redundant transitions in 8 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-28 00:33:27] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:33:27] [INFO ] Invariant cache hit.
[2024-05-28 00:33:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:33:29] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 00:33:29] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 00:33:30] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 00:33:30] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:33:30] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:33:30] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:33:31] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:33:32] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:33:32] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:33:35] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:33:35] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:33:35] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-28 00:33:35] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-28 00:33:35] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:33:35] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-05-28 00:33:36] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-28 00:33:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:33:36] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
[2024-05-28 00:33:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:33:36] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:33:38] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:33:40] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30020 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:34:02] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:34:02] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:34:02] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:34:02] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:34:03] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30015 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61273ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62169 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 1282 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 323607 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 4
Probabilistic random walk after 323607 steps, saw 145984 distinct states, run finished after 3004 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-28 00:34:32] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:34:32] [INFO ] Invariant cache hit.
[2024-05-28 00:34:32] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 65/77 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/117 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 40/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 4 unsolved in 440 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 65/77 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/117 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 40/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 4/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-28 00:34:33] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-28 00:34:34] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-28 00:34:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 10/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/482 variables, 2/328 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 2/330 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 1/332 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/482 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/482 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 332 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1670 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 2124ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 561536 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 2
Probabilistic random walk after 561536 steps, saw 245829 distinct states, run finished after 3004 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-28 00:34:37] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:34:37] [INFO ] Invariant cache hit.
[2024-05-28 00:34:37] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 311 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-28 00:34:38] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:34:38] [INFO ] Invariant cache hit.
[2024-05-28 00:34:38] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-28 00:34:38] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:34:38] [INFO ] Invariant cache hit.
[2024-05-28 00:34:38] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:34:39] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2024-05-28 00:34:39] [INFO ] Redundant transitions in 4 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-28 00:34:39] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:34:39] [INFO ] Invariant cache hit.
[2024-05-28 00:34:39] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:34:41] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:34:41] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:34:41] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:34:42] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:34:42] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:34:42] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 5 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:34:43] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:34:44] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-28 00:34:44] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:34:47] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:34:50] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:34:52] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30022 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:35:14] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:35:14] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:35:14] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:35:14] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:35:15] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30013 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61118ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61894 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 197 place count 102 transition count 332
Iterating global reduction 1 with 24 rules applied. Total rules applied 221 place count 102 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 100 transition count 331
Graph (trivial) has 19 edges and 100 vertex of which 8 / 100 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 225 place count 93 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 388 place count 93 transition count 168
Applied a total of 388 rules in 30 ms. Remains 93 /126 variables (removed 33) and now considering 168/529 (removed 361) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 168 rows 93 cols
[2024-05-28 00:35:40] [INFO ] Computed 22 invariants in 4 ms
[2024-05-28 00:35:40] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-28 00:35:40] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-28 00:35:40] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 00:35:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-28 00:35:40] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-28 00:35:40] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 00:35:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 00:35:40] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 00:35:40] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 00:35:40] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
FORMULA SafeBus-PT-06-UpperBounds-03 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5] Max Struct:[6]
Starting property specific reduction for SafeBus-PT-06-UpperBounds-02
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-28 00:35:40] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-28 00:35:40] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-28 00:35:40] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:35:40] [INFO ] Invariant cache hit.
[2024-05-28 00:35:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:35:40] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:35:40] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-28 00:35:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:35:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-05-28 00:35:40] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:35:40] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-28 00:35:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:35:41] [INFO ] [Nat]Added 43 Read/Feed constraints in 94 ms returned sat
[2024-05-28 00:35:41] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 22 ms.
[2024-05-28 00:35:41] [INFO ] Added : 6 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 377 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 29 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 126/126 places, 529/529 transitions.
[2024-05-28 00:35:41] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:35:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2939 ms. (340 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1058 ms. (944 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-28 00:35:45] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:35:45] [INFO ] Invariant cache hit.
[2024-05-28 00:35:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:35:45] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:35:45] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-28 00:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:35:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-28 00:35:45] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:35:45] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-28 00:35:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:35:46] [INFO ] [Nat]Added 43 Read/Feed constraints in 97 ms returned sat
[2024-05-28 00:35:46] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 29 ms.
[2024-05-28 00:35:46] [INFO ] Added : 6 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 383 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-28 00:35:46] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:35:46] [INFO ] Invariant cache hit.
[2024-05-28 00:35:47] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-28 00:35:47] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:35:47] [INFO ] Invariant cache hit.
[2024-05-28 00:35:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:35:47] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2024-05-28 00:35:47] [INFO ] Redundant transitions in 2 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-28 00:35:47] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:35:47] [INFO ] Invariant cache hit.
[2024-05-28 00:35:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:35:50] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:35:50] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:35:50] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:35:51] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:35:51] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:35:51] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:35:51] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:35:51] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:35:51] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:35:52] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-28 00:35:52] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:35:52] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:35:52] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:35:52] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:35:52] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:35:58] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:36:01] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30027 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:36:22] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:36:23] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-28 00:36:23] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-28 00:36:23] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-28 00:36:23] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30024 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61163ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62080 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 494770 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 2
Probabilistic random walk after 494770 steps, saw 217992 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2024-05-28 00:36:51] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:36:51] [INFO ] Invariant cache hit.
[2024-05-28 00:36:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 345 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 517105 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 517105 steps, saw 227341 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-28 00:36:55] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:36:55] [INFO ] Invariant cache hit.
[2024-05-28 00:36:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/482 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/482 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 303 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 70/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/117 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 41/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/119 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 355/479 variables, 124/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/479 variables, 42/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/482 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/482 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 320 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 604ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-28 00:36:56] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:36:56] [INFO ] Invariant cache hit.
[2024-05-28 00:36:56] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-28 00:36:56] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:36:56] [INFO ] Invariant cache hit.
[2024-05-28 00:36:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:36:57] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-05-28 00:36:57] [INFO ] Redundant transitions in 5 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-28 00:36:57] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-28 00:36:57] [INFO ] Invariant cache hit.
[2024-05-28 00:36:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:37:05] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:37:05] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:37:05] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-28 00:37:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:37:08] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:37:10] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (OVERLAPS) 356/482 variables, 126/303 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 43/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 346 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30015 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 28/177 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-28 00:37:32] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:37:32] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:37:32] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2024-05-28 00:37:33] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-05-28 00:37:33] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/308 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/351 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/874 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 874 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30022 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 33/33 constraints]
After SMT, in 61214ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62016 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 197 place count 102 transition count 332
Iterating global reduction 1 with 24 rules applied. Total rules applied 221 place count 102 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 100 transition count 331
Graph (trivial) has 19 edges and 100 vertex of which 8 / 100 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 225 place count 93 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 388 place count 93 transition count 168
Applied a total of 388 rules in 14 ms. Remains 93 /126 variables (removed 33) and now considering 168/529 (removed 361) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 168 rows 93 cols
[2024-05-28 00:37:58] [INFO ] Computed 22 invariants in 2 ms
[2024-05-28 00:37:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-28 00:37:58] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-28 00:37:58] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 00:37:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-28 00:37:58] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-28 00:37:58] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 00:37:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 00:37:58] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 00:37:58] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 00:37:58] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 286 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[6]
Ending property specific reduction for SafeBus-PT-06-UpperBounds-02 in 138348 ms.
[2024-05-28 00:37:59] [INFO ] Flatten gal took : 92 ms
[2024-05-28 00:37:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-28 00:37:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 529 transitions and 3754 arcs took 9 ms.
Total runtime 358840 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SafeBus-PT-06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 126
TRANSITIONS: 529
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1296
MODEL NAME: /home/mcc/execution/413/model
126 places, 529 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SafeBus-PT-06-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716856693932
--------------------
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
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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r333-tall-171679078400421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;