About the Execution of GreatSPN+red for FireWire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1076.147 | 137410.00 | 275806.00 | 206.80 | F | 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.r560-tall-171734905800148.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 FireWire-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 100K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717351753102
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:14] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 18:09:14] [INFO ] Transformed 130 places.
[2024-06-02 18:09:14] [INFO ] Transformed 408 transitions.
[2024-06-02 18:09:14] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:14] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 196 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2226 resets) in 1973 ms. (20 steps per ms) remains 58/120 properties
BEST_FIRST walk for 4003 steps (59 resets) in 66 ms. (59 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (54 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (70 resets) in 59 ms. (66 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (51 resets) in 59 ms. (66 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (58 resets) in 40 ms. (97 steps per ms) remains 52/58 properties
BEST_FIRST walk for 4003 steps (61 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (54 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (66 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (44 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (60 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (60 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (45 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (61 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (59 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (59 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (56 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (60 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (64 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (62 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (66 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (50 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (68 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (61 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (63 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (58 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (55 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (54 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (53 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (58 resets) in 28 ms. (137 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (73 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (59 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (63 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (50 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (58 resets) in 9 ms. (400 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (62 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (62 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (55 resets) in 9 ms. (400 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (58 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
[2024-06-02 18:09:15] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 18:09:15] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 18:09:15] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 73/124 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 73/130 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 4/128 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 319/447 variables, 128/264 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 44/308 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 2/449 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 1/450 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (OVERLAPS) 0/450 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 313 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2212 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 73/124 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 73/130 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 16 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 4/128 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 319/447 variables, 128/271 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 51/366 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 2/449 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 18 (OVERLAPS) 1/450 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:09:22] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 373 constraints, problems are : Problem set: 0 solved, 51 unsolved in 5011 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 9/9 constraints]
After SMT, in 7320ms problems are : Problem set: 0 solved, 51 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 128 transition count 345
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 128 transition count 343
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 126 transition count 347
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 126 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 126 transition count 335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 125 transition count 334
Applied a total of 26 rules in 65 ms. Remains 125 /130 variables (removed 5) and now considering 334/352 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 125/130 places, 334/352 transitions.
RANDOM walk for 4000000 steps (231741 resets) in 20523 ms. (194 steps per ms) remains 32/51 properties
BEST_FIRST walk for 400002 steps (5599 resets) in 497 ms. (803 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (5591 resets) in 512 ms. (779 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (5772 resets) in 487 ms. (819 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5558 resets) in 479 ms. (833 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (5531 resets) in 479 ms. (833 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (5568 resets) in 550 ms. (725 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (5732 resets) in 480 ms. (831 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5774 resets) in 484 ms. (824 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (5520 resets) in 483 ms. (826 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5675 resets) in 485 ms. (823 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5638 resets) in 485 ms. (823 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5589 resets) in 483 ms. (826 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5727 resets) in 470 ms. (849 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5843 resets) in 473 ms. (843 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (5736 resets) in 475 ms. (840 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5587 resets) in 472 ms. (845 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5458 resets) in 490 ms. (814 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (5744 resets) in 482 ms. (828 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400002 steps (5518 resets) in 478 ms. (835 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (5592 resets) in 485 ms. (823 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5628 resets) in 485 ms. (823 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5599 resets) in 492 ms. (811 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5575 resets) in 493 ms. (809 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5702 resets) in 493 ms. (809 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5667 resets) in 487 ms. (819 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5714 resets) in 485 ms. (823 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5589 resets) in 474 ms. (842 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (5641 resets) in 483 ms. (826 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5606 resets) in 472 ms. (845 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5757 resets) in 487 ms. (819 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5616 resets) in 477 ms. (836 steps per ms) remains 30/30 properties
[2024-06-02 18:09:33] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 125 cols
[2024-06-02 18:09:33] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:09:33] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 77/107 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 299/406 variables, 107/112 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 26/432 variables, 17/129 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/433 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/433 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 178 constraints, problems are : Problem set: 0 solved, 30 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 77/107 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 299/406 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 26/432 variables, 17/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 45/184 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 27/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 1/433 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (OVERLAPS) 0/433 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 213 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2099 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 3008ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 1008 ms.
Support contains 30 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 334/334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 336
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 124 transition count 333
Applied a total of 5 rules in 27 ms. Remains 124 /125 variables (removed 1) and now considering 333/334 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 124/125 places, 333/334 transitions.
RANDOM walk for 4000000 steps (232011 resets) in 17118 ms. (233 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5540 resets) in 511 ms. (781 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5642 resets) in 484 ms. (824 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5710 resets) in 493 ms. (809 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5685 resets) in 493 ms. (809 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5514 resets) in 481 ms. (829 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5768 resets) in 497 ms. (803 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5627 resets) in 475 ms. (840 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5717 resets) in 482 ms. (828 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5685 resets) in 480 ms. (831 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5688 resets) in 484 ms. (824 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5720 resets) in 480 ms. (831 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5605 resets) in 477 ms. (836 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5614 resets) in 481 ms. (829 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5538 resets) in 495 ms. (806 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5472 resets) in 480 ms. (831 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5553 resets) in 481 ms. (829 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5699 resets) in 475 ms. (840 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5629 resets) in 480 ms. (831 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5574 resets) in 474 ms. (842 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5702 resets) in 471 ms. (847 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5593 resets) in 489 ms. (816 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5889 resets) in 502 ms. (795 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5673 resets) in 549 ms. (727 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5738 resets) in 480 ms. (831 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5579 resets) in 472 ms. (845 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (5645 resets) in 479 ms. (833 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5702 resets) in 485 ms. (823 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5559 resets) in 480 ms. (831 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (5808 resets) in 467 ms. (854 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (5759 resets) in 465 ms. (858 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 5128427 steps, run timeout after 24001 ms. (steps per millisecond=213 ) properties seen :28 out of 30
Probabilistic random walk after 5128427 steps, saw 1090489 distinct states, run finished after 24008 ms. (steps per millisecond=213 ) properties seen :28
[2024-06-02 18:10:09] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
// Phase 1: matrix 305 rows 124 cols
[2024-06-02 18:10:09] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:10:09] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 81/109 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/149 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 185/334 variables, 48/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 23/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/335 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 90/425 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/429 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/28 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/109 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/149 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 185/334 variables, 48/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/334 variables, 23/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/334 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/335 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 90/425 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 22/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/429 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/429 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 333/333 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 329
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 109 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 109 transition count 297
Applied a total of 35 rules in 67 ms. Remains 109 /124 variables (removed 15) and now considering 297/333 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 109/124 places, 297/333 transitions.
RANDOM walk for 4000000 steps (231757 resets) in 6743 ms. (593 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (56069 resets) in 2028 ms. (1971 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (56406 resets) in 2040 ms. (1959 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2200159 steps, run timeout after 6001 ms. (steps per millisecond=366 ) properties seen :0 out of 2
Probabilistic random walk after 2200159 steps, saw 482793 distinct states, run finished after 6002 ms. (steps per millisecond=366 ) properties seen :0
[2024-06-02 18:10:19] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 18:10:19] [INFO ] Computed 8 invariants in 9 ms
[2024-06-02 18:10:19] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 72/98 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/125 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 157/282 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/283 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 90/373 variables, 44/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 22/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/377 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/377 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/377 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/377 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/98 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/125 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 157/282 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/283 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 90/373 variables, 44/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 22/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/377 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/377 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 18:10:19] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 18:10:19] [INFO ] Invariant cache hit.
[2024-06-02 18:10:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:10:19] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 18:10:19] [INFO ] Invariant cache hit.
[2024-06-02 18:10:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:10:19] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 236 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/109 places, 297/297 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 295
Applied a total of 4 rules in 11 ms. Remains 105 /107 variables (removed 2) and now considering 295/297 (removed 2) transitions.
[2024-06-02 18:10:19] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 18:10:19] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:10:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:10:19] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 18:10:19] [INFO ] Invariant cache hit.
[2024-06-02 18:10:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:10:19] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/109 places, 295/297 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 463 ms. Remains : 105/109 places, 295/297 transitions.
RANDOM walk for 4000000 steps (230876 resets) in 6599 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (56443 resets) in 2135 ms. (1872 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (56288 resets) in 2127 ms. (1879 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3695767 steps, run timeout after 9001 ms. (steps per millisecond=410 ) properties seen :0 out of 2
Probabilistic random walk after 3695767 steps, saw 789462 distinct states, run finished after 9002 ms. (steps per millisecond=410 ) properties seen :0
[2024-06-02 18:10:32] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 18:10:32] [INFO ] Invariant cache hit.
[2024-06-02 18:10:32] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 72/98 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/125 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 157/282 variables, 35/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/283 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 88/371 variables, 44/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 22/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/371 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/26 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/98 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/125 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 157/282 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/283 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 88/371 variables, 44/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 22/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/371 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/371 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 295/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/105 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 295/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-06-02 18:10:32] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 18:10:32] [INFO ] Invariant cache hit.
[2024-06-02 18:10:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:10:32] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 18:10:32] [INFO ] Invariant cache hit.
[2024-06-02 18:10:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:10:33] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 18:10:33] [INFO ] Redundant transitions in 13 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 18:10:33] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 18:10:33] [INFO ] Invariant cache hit.
[2024-06-02 18:10:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 7 ms to minimize.
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 8 ms to minimize.
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:10:35] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 266/370 variables, 104/117 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 1/371 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 158 constraints, problems are : Problem set: 0 solved, 293 unsolved in 10378 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 266/370 variables, 104/117 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 40/157 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 293/450 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:10:46] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:10:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:10:49] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 1/371 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 18:11:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/371 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 455 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 11/11 constraints]
After SMT, in 40602ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 40607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40831 ms. Remains : 105/105 places, 295/295 transitions.
RANDOM walk for 400000 steps (23286 resets) in 1943 ms. (205 steps per ms) remains 2/2 properties
Running SMT prover for 2 properties.
[2024-06-02 18:11:14] [INFO ] Flow matrix only has 266 transitions (discarded 29 similar events)
[2024-06-02 18:11:14] [INFO ] Invariant cache hit.
[2024-06-02 18:11:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 18:11:14] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-02 18:11:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:11:14] [INFO ] After 6ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 18:11:14] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 18:11:14] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 18:11:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 18:11:14] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 18:11:14] [INFO ] After 29ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 18:11:14] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 18:11:14] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (231856 resets) in 9249 ms. (432 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (56239 resets) in 2081 ms. (1921 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (56394 resets) in 2067 ms. (1934 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4703139 steps, run visited all 2 properties in 11099 ms. (steps per millisecond=423 )
Probabilistic random walk after 4703139 steps, saw 998178 distinct states, run finished after 11119 ms. (steps per millisecond=422 ) properties seen :2
Able to resolve query StableMarking after proving 121 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 136207 ms.
ITS solved all properties within timeout
BK_STOP 1717351890512
--------------------
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 StableMarking -timeout 180 -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="FireWire-PT-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 FireWire-PT-09, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905800148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;