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.r524-tall-171679080300437.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 ltsminxred
Input is SafeBus-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080300437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 28K Apr 12 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 202K Apr 12 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 961K Apr 12 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 12 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Apr 12 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 488K Apr 12 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 378K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 3.5M 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-15-UpperBounds-00
FORMULA_NAME SafeBus-PT-15-UpperBounds-01
FORMULA_NAME SafeBus-PT-15-UpperBounds-02
FORMULA_NAME SafeBus-PT-15-UpperBounds-03
FORMULA_NAME SafeBus-PT-15-UpperBounds-04
FORMULA_NAME SafeBus-PT-15-UpperBounds-05
FORMULA_NAME SafeBus-PT-15-UpperBounds-06
FORMULA_NAME SafeBus-PT-15-UpperBounds-07
FORMULA_NAME SafeBus-PT-15-UpperBounds-08
FORMULA_NAME SafeBus-PT-15-UpperBounds-09
FORMULA_NAME SafeBus-PT-15-UpperBounds-10
FORMULA_NAME SafeBus-PT-15-UpperBounds-11
FORMULA_NAME SafeBus-PT-15-UpperBounds-12
FORMULA_NAME SafeBus-PT-15-UpperBounds-13
FORMULA_NAME SafeBus-PT-15-UpperBounds-14
FORMULA_NAME SafeBus-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717227210215

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:33:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:33:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:33:31] [INFO ] Load time of PNML (sax parser for PT used): 288 ms
[2024-06-01 07:33:31] [INFO ] Transformed 621 places.
[2024-06-01 07:33:31] [INFO ] Transformed 4771 transitions.
[2024-06-01 07:33:31] [INFO ] Found NUPN structural information;
[2024-06-01 07:33:31] [INFO ] Parsed PT model containing 621 places and 4771 transitions and 34549 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 15 places and 0 transitions.
FORMULA SafeBus-PT-15-UpperBounds-01 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0] Max Struct:[15, 1, 1, 15, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SafeBus-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 15, 1, 15, 1, 1, 1, 1, 1, 1]
[2024-06-01 07:33:31] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-06-01 07:33:32] [INFO ] Computed 65 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 15, 1, 15, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 329 ms. (30 steps per ms)
FORMULA SafeBus-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 68 ms. (289 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 1] Max Struct:[15, 15]
[2024-06-01 07:33:32] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-06-01 07:33:32] [INFO ] Invariant cache hit.
[2024-06-01 07:33:32] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2024-06-01 07:33:32] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-01 07:33:33] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2024-06-01 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:33:33] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2024-06-01 07:33:33] [INFO ] [Nat]Absence check using 32 positive and 33 generalized place invariants in 18 ms returned sat
[2024-06-01 07:33:34] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2024-06-01 07:33:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:33:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 07:33:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 1080 ms returned unknown
[2024-06-01 07:33:36] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned sat
[2024-06-01 07:33:36] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[8, 1] Max Struct:[15, 1]
FORMULA SafeBus-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[15]
Support contains 15 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 606 transition count 4756
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 30 place count 591 transition count 4756
Applied a total of 30 rules in 2277 ms. Remains 591 /606 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2290 ms. Remains : 591/606 places, 4756/4771 transitions.
[2024-06-01 07:33:38] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 591 cols
[2024-06-01 07:33:38] [INFO ] Computed 65 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 15825 ms. (63 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 3060 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[15]
[2024-06-01 07:33:57] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:33:57] [INFO ] Invariant cache hit.
[2024-06-01 07:33:57] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2024-06-01 07:33:57] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 16 ms returned sat
[2024-06-01 07:33:57] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-06-01 07:33:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:33:58] [INFO ] [Real]Added 241 Read/Feed constraints in 261 ms returned sat
[2024-06-01 07:33:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:33:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2024-06-01 07:33:58] [INFO ] [Nat]Absence check using 32 positive and 33 generalized place invariants in 14 ms returned sat
[2024-06-01 07:33:58] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-06-01 07:33:59] [INFO ] [Nat]Added 241 Read/Feed constraints in 1032 ms returned sat
[2024-06-01 07:34:00] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 354 ms.
[2024-06-01 07:34:00] [INFO ] Added : 0 causal constraints over 0 iterations in 589 ms. Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 1036 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 921 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:34:06] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:34:06] [INFO ] Invariant cache hit.
[2024-06-01 07:34:12] [INFO ] Implicit Places using invariants in 5158 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 5186 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 576/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 1063 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7172 ms. Remains : 576/591 places, 4756/4756 transitions.
[2024-06-01 07:34:13] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-06-01 07:34:13] [INFO ] Computed 50 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 14389 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2685 ms. (372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-06-01 07:34:30] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:34:30] [INFO ] Invariant cache hit.
[2024-06-01 07:34:30] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 07:34:30] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2024-06-01 07:34:30] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-06-01 07:34:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:34:31] [INFO ] [Real]Added 241 Read/Feed constraints in 379 ms returned sat
[2024-06-01 07:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:34:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-06-01 07:34:31] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-06-01 07:34:31] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-06-01 07:34:33] [INFO ] [Nat]Added 241 Read/Feed constraints in 1493 ms returned sat
[2024-06-01 07:34:33] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 211 ms.
[2024-06-01 07:34:33] [INFO ] Added : 0 causal constraints over 0 iterations in 362 ms. Result :sat
Minimization took 4514 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 876 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 878 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 867 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:34:39] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:34:39] [INFO ] Invariant cache hit.
[2024-06-01 07:34:43] [INFO ] Implicit Places using invariants in 3588 ms returned []
[2024-06-01 07:34:43] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:34:43] [INFO ] Invariant cache hit.
[2024-06-01 07:34:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:34:52] [INFO ] Implicit Places using invariants and state equation in 8712 ms returned []
Implicit Place search using SMT with State Equation took 12302 ms to find 0 implicit places.
[2024-06-01 07:34:52] [INFO ] Redundant transitions in 347 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 07:34:52] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:34:52] [INFO ] Invariant cache hit.
[2024-06-01 07:34:52] [INFO ] State equation strengthened by 241 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 58302ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 58368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71932 ms. Remains : 576/576 places, 4756/4756 transitions.
[2024-06-01 07:35:51] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:35:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 14367 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2641 ms. (378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-06-01 07:36:08] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:36:08] [INFO ] Invariant cache hit.
[2024-06-01 07:36:08] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 07:36:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-06-01 07:36:08] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-06-01 07:36:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:36:08] [INFO ] [Real]Added 241 Read/Feed constraints in 325 ms returned sat
[2024-06-01 07:36:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:36:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-06-01 07:36:09] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned sat
[2024-06-01 07:36:09] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-06-01 07:36:10] [INFO ] [Nat]Added 241 Read/Feed constraints in 1570 ms returned sat
[2024-06-01 07:36:11] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 156 ms.
[2024-06-01 07:36:11] [INFO ] Added : 0 causal constraints over 0 iterations in 289 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1021 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1021 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1032 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:36:17] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:36:17] [INFO ] Invariant cache hit.
[2024-06-01 07:36:21] [INFO ] Implicit Places using invariants in 3623 ms returned []
[2024-06-01 07:36:21] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:36:21] [INFO ] Invariant cache hit.
[2024-06-01 07:36:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:36:29] [INFO ] Implicit Places using invariants and state equation in 8423 ms returned []
Implicit Place search using SMT with State Equation took 12050 ms to find 0 implicit places.
[2024-06-01 07:36:30] [INFO ] Redundant transitions in 319 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 07:36:30] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:36:30] [INFO ] Invariant cache hit.
[2024-06-01 07:36:30] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 60429ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73899 ms. Remains : 576/576 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 1245 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 101230 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 101230 steps, saw 65568 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 07:37:34] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:37:34] [INFO ] Invariant cache hit.
[2024-06-01 07:37:34] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 287 places in 422 ms of which 37 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/572 variables, 31/560 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 60/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/574 variables, 2/622 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 2/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1396/1970 variables, 574/1198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 240/1438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 0/1438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 3/1973 variables, 2/1440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 2/1442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 1/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 0/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1973 variables, 0/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 1444 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1582 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 313 places in 400 ms of which 4 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 313 places in 372 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 2/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/572 variables, 31/562 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 60/622 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:37:37] [INFO ] Deduced a trap composed of 61 places in 650 ms of which 5 ms to minimize.
[2024-06-01 07:37:38] [INFO ] Deduced a trap composed of 61 places in 636 ms of which 4 ms to minimize.
[2024-06-01 07:37:38] [INFO ] Deduced a trap composed of 74 places in 676 ms of which 4 ms to minimize.
[2024-06-01 07:37:39] [INFO ] Deduced a trap composed of 61 places in 635 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 4/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/574 variables, 2/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1396/1970 variables, 574/1204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 240/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1970 variables, 1/1445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1970 variables, 0/1445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1973 variables, 2/1447 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 2/1449 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1973 variables, 1/1450 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 1451 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5012 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6669ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 994 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 995 ms. Remains : 576/576 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 784 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 122204 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 122204 steps, saw 78467 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 07:37:45] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:37:45] [INFO ] Invariant cache hit.
[2024-06-01 07:37:45] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/572 variables, 31/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 60/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/574 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1396/1970 variables, 574/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 240/1437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1973 variables, 2/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 2/1441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 1/1442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1973 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 1443 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1127 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:37:47] [INFO ] Deduced a trap composed of 313 places in 369 ms of which 3 ms to minimize.
[2024-06-01 07:37:47] [INFO ] Deduced a trap composed of 339 places in 369 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/572 variables, 31/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 60/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:37:48] [INFO ] Deduced a trap composed of 74 places in 640 ms of which 4 ms to minimize.
[2024-06-01 07:37:48] [INFO ] Deduced a trap composed of 61 places in 642 ms of which 4 ms to minimize.
[2024-06-01 07:37:49] [INFO ] Deduced a trap composed of 61 places in 624 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/574 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1396/1970 variables, 574/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 240/1442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1970 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1973 variables, 2/1445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 2/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 1/1448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1973 variables, 1/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1973 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1973 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 1449 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4235 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 5411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 687 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 929 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 929 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 917 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:37:53] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:37:53] [INFO ] Invariant cache hit.
[2024-06-01 07:37:56] [INFO ] Implicit Places using invariants in 3576 ms returned []
[2024-06-01 07:37:56] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:37:56] [INFO ] Invariant cache hit.
[2024-06-01 07:37:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:38:06] [INFO ] Implicit Places using invariants and state equation in 9133 ms returned []
Implicit Place search using SMT with State Equation took 12713 ms to find 0 implicit places.
[2024-06-01 07:38:06] [INFO ] Redundant transitions in 189 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 07:38:06] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:38:06] [INFO ] Invariant cache hit.
[2024-06-01 07:38:06] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 61571ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 61619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75470 ms. Remains : 576/576 places, 4756/4756 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3359 transitions
Reduce isomorphic transitions removed 3359 transitions.
Iterating post reduction 0 with 3359 rules applied. Total rules applied 3359 place count 576 transition count 1397
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 3554 place count 381 transition count 1202
Iterating global reduction 1 with 195 rules applied. Total rules applied 3749 place count 381 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3752 place count 379 transition count 1201
Graph (trivial) has 46 edges and 379 vertex of which 17 / 379 are part of one of the 1 SCC in 2 ms
Free SCC test removed 16 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 3753 place count 363 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 3994 place count 363 transition count 960
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 4024 place count 348 transition count 945
Applied a total of 4024 rules in 133 ms. Remains 348 /576 variables (removed 228) and now considering 945/4756 (removed 3811) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 348 cols
[2024-06-01 07:39:08] [INFO ] Computed 49 invariants in 19 ms
[2024-06-01 07:39:08] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 07:39:08] [INFO ] [Real]Absence check using 18 positive and 31 generalized place invariants in 14 ms returned sat
[2024-06-01 07:39:08] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:39:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 07:39:08] [INFO ] [Nat]Absence check using 18 positive and 31 generalized place invariants in 13 ms returned sat
[2024-06-01 07:39:08] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:39:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 07:39:08] [INFO ] After 52ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:39:08] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:39:08] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1009 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[15]
Starting property specific reduction for SafeBus-PT-15-UpperBounds-00
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[15]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[15]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[15]
[2024-06-01 07:39:08] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-06-01 07:39:08] [INFO ] Computed 50 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[15]
RANDOM walk for 10000 steps (2 resets) in 148 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[15]
[2024-06-01 07:39:09] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:39:09] [INFO ] Invariant cache hit.
[2024-06-01 07:39:09] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-06-01 07:39:09] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned sat
[2024-06-01 07:39:09] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-06-01 07:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:39:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-06-01 07:39:09] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-06-01 07:39:10] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2024-06-01 07:39:10] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:39:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 07:39:11] [INFO ] [Nat]Added 241 Read/Feed constraints in 919 ms returned sat
[2024-06-01 07:39:11] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 168 ms.
[2024-06-01 07:39:11] [INFO ] Added : 0 causal constraints over 0 iterations in 287 ms. Result :sat
Minimization took 552 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 949 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 951 ms. Remains : 576/576 places, 4756/4756 transitions.
[2024-06-01 07:39:13] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:39:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 15357 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2843 ms. (351 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-06-01 07:39:31] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:39:31] [INFO ] Invariant cache hit.
[2024-06-01 07:39:31] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 07:39:31] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned sat
[2024-06-01 07:39:31] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2024-06-01 07:39:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:39:32] [INFO ] [Real]Added 241 Read/Feed constraints in 334 ms returned sat
[2024-06-01 07:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:39:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 07:39:32] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-06-01 07:39:32] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-06-01 07:39:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 1411 ms returned sat
[2024-06-01 07:39:34] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 194 ms.
[2024-06-01 07:39:34] [INFO ] Added : 0 causal constraints over 0 iterations in 312 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1048 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1028 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:39:41] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:39:41] [INFO ] Invariant cache hit.
[2024-06-01 07:39:44] [INFO ] Implicit Places using invariants in 3566 ms returned []
[2024-06-01 07:39:44] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:39:44] [INFO ] Invariant cache hit.
[2024-06-01 07:39:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:39:53] [INFO ] Implicit Places using invariants and state equation in 8553 ms returned []
Implicit Place search using SMT with State Equation took 12122 ms to find 0 implicit places.
[2024-06-01 07:39:53] [INFO ] Redundant transitions in 203 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 07:39:53] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:39:53] [INFO ] Invariant cache hit.
[2024-06-01 07:39:53] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 61639ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 61688ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75059 ms. Remains : 576/576 places, 4756/4756 transitions.
[2024-06-01 07:40:55] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:40:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 15140 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2765 ms. (361 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-06-01 07:41:12] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:41:12] [INFO ] Invariant cache hit.
[2024-06-01 07:41:13] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 07:41:13] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-06-01 07:41:13] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2024-06-01 07:41:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:41:13] [INFO ] [Real]Added 241 Read/Feed constraints in 352 ms returned sat
[2024-06-01 07:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:41:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 07:41:14] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-06-01 07:41:14] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2024-06-01 07:41:15] [INFO ] [Nat]Added 241 Read/Feed constraints in 1499 ms returned sat
[2024-06-01 07:41:16] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 152 ms.
[2024-06-01 07:41:16] [INFO ] Added : 0 causal constraints over 0 iterations in 289 ms. Result :sat
Minimization took 4505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 961 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1018 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:41:22] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:41:22] [INFO ] Invariant cache hit.
[2024-06-01 07:41:26] [INFO ] Implicit Places using invariants in 3804 ms returned []
[2024-06-01 07:41:26] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:41:26] [INFO ] Invariant cache hit.
[2024-06-01 07:41:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:41:35] [INFO ] Implicit Places using invariants and state equation in 8987 ms returned []
Implicit Place search using SMT with State Equation took 12794 ms to find 0 implicit places.
[2024-06-01 07:41:35] [INFO ] Redundant transitions in 199 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 07:41:35] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:41:35] [INFO ] Invariant cache hit.
[2024-06-01 07:41:35] [INFO ] State equation strengthened by 241 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 62588ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 62638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76670 ms. Remains : 576/576 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 826 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 100118 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 100118 steps, saw 64843 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 07:42:41] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:42:41] [INFO ] Invariant cache hit.
[2024-06-01 07:42:41] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:42:42] [INFO ] Deduced a trap composed of 287 places in 367 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/572 variables, 31/560 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 60/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/574 variables, 2/622 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 2/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1396/1970 variables, 574/1198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 240/1438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 0/1438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 3/1973 variables, 2/1440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 2/1442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 1/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 0/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1973 variables, 0/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 1444 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1615 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 313 places in 402 ms of which 3 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 313 places in 402 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 2/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/572 variables, 31/562 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 60/622 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 61 places in 632 ms of which 3 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 61 places in 632 ms of which 4 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 74 places in 651 ms of which 3 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 61 places in 657 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 4/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/574 variables, 2/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1396/1970 variables, 574/1204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 240/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1970 variables, 1/1445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1970 variables, 0/1445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1973 variables, 2/1447 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 1449 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5016 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 240/241 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6677ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1013 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1015 ms. Remains : 576/576 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 794 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 121261 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 121261 steps, saw 77918 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 07:42:52] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:42:52] [INFO ] Invariant cache hit.
[2024-06-01 07:42:52] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/572 variables, 31/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 60/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/574 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1396/1970 variables, 574/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 240/1437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1973 variables, 2/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 2/1441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 1/1442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1973 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 1443 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1164 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 313 places in 395 ms of which 3 ms to minimize.
[2024-06-01 07:42:54] [INFO ] Deduced a trap composed of 339 places in 372 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/572 variables, 31/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 60/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:42:55] [INFO ] Deduced a trap composed of 74 places in 616 ms of which 4 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 61 places in 635 ms of which 3 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 61 places in 642 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/574 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1396/1970 variables, 574/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 240/1442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1970 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1973 variables, 2/1445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 2/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 1/1448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1973 variables, 1/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1973 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1973 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 1449 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4266 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 5475ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 719 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1009 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1009 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1057 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-06-01 07:43:01] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:43:01] [INFO ] Invariant cache hit.
[2024-06-01 07:43:04] [INFO ] Implicit Places using invariants in 3692 ms returned []
[2024-06-01 07:43:04] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:43:04] [INFO ] Invariant cache hit.
[2024-06-01 07:43:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 07:43:13] [INFO ] Implicit Places using invariants and state equation in 9032 ms returned []
Implicit Place search using SMT with State Equation took 12728 ms to find 0 implicit places.
[2024-06-01 07:43:13] [INFO ] Redundant transitions in 215 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-06-01 07:43:14] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-06-01 07:43:14] [INFO ] Invariant cache hit.
[2024-06-01 07:43:14] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 62083ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 62126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76149 ms. Remains : 576/576 places, 4756/4756 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3359 transitions
Reduce isomorphic transitions removed 3359 transitions.
Iterating post reduction 0 with 3359 rules applied. Total rules applied 3359 place count 576 transition count 1397
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 3554 place count 381 transition count 1202
Iterating global reduction 1 with 195 rules applied. Total rules applied 3749 place count 381 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3752 place count 379 transition count 1201
Graph (trivial) has 46 edges and 379 vertex of which 17 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 3753 place count 363 transition count 1201
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 3994 place count 363 transition count 960
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 4024 place count 348 transition count 945
Applied a total of 4024 rules in 52 ms. Remains 348 /576 variables (removed 228) and now considering 945/4756 (removed 3811) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 945 rows 348 cols
[2024-06-01 07:44:16] [INFO ] Computed 49 invariants in 16 ms
[2024-06-01 07:44:16] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 07:44:16] [INFO ] [Real]Absence check using 18 positive and 31 generalized place invariants in 15 ms returned sat
[2024-06-01 07:44:16] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:44:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 07:44:16] [INFO ] [Nat]Absence check using 18 positive and 31 generalized place invariants in 16 ms returned sat
[2024-06-01 07:44:16] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:44:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 07:44:16] [INFO ] After 53ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:44:17] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:44:17] [INFO ] After 784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 967 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[15]
Ending property specific reduction for SafeBus-PT-15-UpperBounds-00 in 308211 ms.
[2024-06-01 07:44:17] [INFO ] Flatten gal took : 429 ms
[2024-06-01 07:44:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 07:44:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 576 places, 4756 transitions and 33424 arcs took 30 ms.
Total runtime 646437 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SafeBus-PT-15-UpperBounds-00

BK_STOP 1717227858064

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name SafeBus-PT-15-UpperBounds-00
ub formula formula --maxsum=/tmp/807/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SafeBus-PT-15, 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 r524-tall-171679080300437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-15.tgz
mv SafeBus-PT-15 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;