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-171734905900188.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-17, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 153K 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 1717352327180

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:18:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:18:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:18:48] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 18:18:48] [INFO ] Transformed 428 places.
[2024-06-02 18:18:48] [INFO ] Transformed 656 transitions.
[2024-06-02 18:18:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:18:48] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 182 ms.
Graph (trivial) has 356 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 10 ms
Free SCC test removed 16 places
Structural test allowed to assert that 99 places are NOT stable. Took 28 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (585 resets) in 2468 ms. (16 steps per ms) remains 223/329 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 223/223 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 223/223 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 223/223 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 223/223 properties
[2024-06-02 18:18:49] [INFO ] Flow matrix only has 637 transitions (discarded 2 similar events)
// Phase 1: matrix 637 rows 412 cols
[2024-06-02 18:18:49] [INFO ] Computed 9 invariants in 26 ms
[2024-06-02 18:18:49] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 135/358 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 135/365 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 5174ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Fused 223 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 223 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 639/639 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 406 transition count 561
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 76 rules applied. Total rules applied 155 place count 333 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 157 place count 331 transition count 558
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 157 place count 331 transition count 552
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 169 place count 325 transition count 552
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 180 place count 314 transition count 541
Iterating global reduction 3 with 11 rules applied. Total rules applied 191 place count 314 transition count 541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 314 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 314 transition count 538
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 313 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 312 transition count 518
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 312 transition count 518
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 241 place count 290 transition count 496
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 283 transition count 502
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 269 place count 283 transition count 488
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 284 place count 269 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 269 transition count 486
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 269 transition count 486
Applied a total of 287 rules in 159 ms. Remains 269 /412 variables (removed 143) and now considering 486/639 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 269/412 places, 486/639 transitions.
RANDOM walk for 4000000 steps (270330 resets) in 31052 ms. (128 steps per ms) remains 56/223 properties
BEST_FIRST walk for 400003 steps (6263 resets) in 665 ms. (600 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6271 resets) in 560 ms. (713 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6222 resets) in 572 ms. (698 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (6295 resets) in 561 ms. (711 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (6144 resets) in 566 ms. (705 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6191 resets) in 559 ms. (714 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6152 resets) in 558 ms. (715 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (6233 resets) in 568 ms. (702 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6261 resets) in 563 ms. (709 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6238 resets) in 566 ms. (705 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (6267 resets) in 558 ms. (715 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400003 steps (6120 resets) in 556 ms. (718 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (6251 resets) in 558 ms. (715 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (6212 resets) in 569 ms. (701 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (6106 resets) in 561 ms. (711 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (6219 resets) in 565 ms. (706 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (6271 resets) in 559 ms. (714 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (6325 resets) in 555 ms. (719 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (6279 resets) in 545 ms. (732 steps per ms) remains 52/55 properties
BEST_FIRST walk for 400004 steps (6244 resets) in 539 ms. (740 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (6188 resets) in 544 ms. (733 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6279 resets) in 549 ms. (727 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (6220 resets) in 550 ms. (725 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6186 resets) in 536 ms. (744 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6289 resets) in 540 ms. (739 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6272 resets) in 547 ms. (729 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6196 resets) in 554 ms. (720 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (6176 resets) in 548 ms. (728 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (6216 resets) in 549 ms. (727 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6193 resets) in 542 ms. (736 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6228 resets) in 541 ms. (738 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6192 resets) in 540 ms. (739 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (6170 resets) in 544 ms. (733 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6249 resets) in 534 ms. (747 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6215 resets) in 551 ms. (724 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (6253 resets) in 562 ms. (710 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6169 resets) in 544 ms. (733 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (6221 resets) in 542 ms. (736 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (6228 resets) in 540 ms. (739 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (6274 resets) in 536 ms. (744 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (6185 resets) in 550 ms. (725 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (6296 resets) in 557 ms. (716 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (6194 resets) in 552 ms. (723 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400002 steps (6247 resets) in 544 ms. (733 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (6241 resets) in 543 ms. (735 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (6228 resets) in 542 ms. (736 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (6193 resets) in 543 ms. (735 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (6263 resets) in 546 ms. (731 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400003 steps (6293 resets) in 543 ms. (735 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (6183 resets) in 537 ms. (743 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (6156 resets) in 532 ms. (750 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (6173 resets) in 536 ms. (744 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (6212 resets) in 534 ms. (747 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (6163 resets) in 534 ms. (747 steps per ms) remains 49/49 properties
// Phase 1: matrix 486 rows 269 cols
[2024-06-02 18:19:11] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:19:11] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 191/240 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 25/265 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 486/751 variables, 265/272 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 29/301 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 4/755 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/755 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 305 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 269/269 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 191/240 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 10 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 104 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 106 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 104 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 0 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 82 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:19:15] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:19:15] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:19:15] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:19:15] [INFO ] Deduced a trap composed of 96 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:19:15] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 25/265 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 486/751 variables, 265/287 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 29/316 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 49/365 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:19:16] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:19:17] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 4/755 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/755 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:19:20] [INFO ] Deduced a trap composed of 172 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:19:20] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/755 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/755 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 16 (OVERLAPS) 0/755 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 373 constraints, problems are : Problem set: 0 solved, 49 unsolved in 9216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 269/269 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 19/19 constraints]
After SMT, in 11378ms problems are : Problem set: 0 solved, 49 unsolved
Parikh walk visited 5 properties in 6917 ms.
Support contains 44 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 486/486 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 269 transition count 438
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 221 transition count 438
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 221 transition count 435
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 218 transition count 435
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 209 transition count 425
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 209 transition count 425
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 141 place count 209 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 141 place count 209 transition count 402
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 207 transition count 402
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 205 transition count 400
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 205 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 205 transition count 396
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 155 place count 203 transition count 396
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 201 place count 180 transition count 373
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 180 transition count 372
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 242 place count 160 transition count 439
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 252 place count 160 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 7 with 74 rules applied. Total rules applied 326 place count 160 transition count 355
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 332 place count 160 transition count 349
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 338 place count 154 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 340 place count 154 transition count 347
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 343 place count 154 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 346 place count 151 transition count 437
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 347 place count 151 transition count 437
Applied a total of 347 rules in 84 ms. Remains 151 /269 variables (removed 118) and now considering 437/486 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 151/269 places, 437/486 transitions.
RANDOM walk for 4000000 steps (171759 resets) in 18937 ms. (211 steps per ms) remains 26/44 properties
BEST_FIRST walk for 400003 steps (4796 resets) in 531 ms. (751 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (4849 resets) in 530 ms. (753 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (4822 resets) in 542 ms. (736 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (4849 resets) in 536 ms. (744 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (4829 resets) in 540 ms. (739 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (4843 resets) in 532 ms. (750 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (4848 resets) in 527 ms. (757 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (4845 resets) in 525 ms. (760 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400002 steps (4823 resets) in 522 ms. (764 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (4772 resets) in 519 ms. (769 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (4841 resets) in 531 ms. (751 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (4835 resets) in 523 ms. (763 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (4801 resets) in 516 ms. (773 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (4796 resets) in 523 ms. (763 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (4817 resets) in 512 ms. (779 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (4821 resets) in 510 ms. (782 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (4839 resets) in 517 ms. (772 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (4842 resets) in 513 ms. (778 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (4798 resets) in 529 ms. (754 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (4759 resets) in 523 ms. (763 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (4832 resets) in 531 ms. (751 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (4827 resets) in 532 ms. (750 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (4795 resets) in 527 ms. (757 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (4785 resets) in 527 ms. (757 steps per ms) remains 24/24 properties
[2024-06-02 18:19:39] [INFO ] Flow matrix only has 409 transitions (discarded 28 similar events)
// Phase 1: matrix 409 rows 151 cols
[2024-06-02 18:19:39] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:19:39] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 88/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 35/147 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 409/556 variables, 147/154 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 61/215 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 4/560 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/560 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 219 constraints, problems are : Problem set: 0 solved, 24 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 88/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 35/147 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:19:40] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:19:40] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:19:40] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 409/556 variables, 147/160 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 61/221 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 24/245 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 4/560 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 0/560 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 255 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 12/12 constraints]
After SMT, in 3888ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 2119 ms.
Support contains 24 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 437/437 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 149 transition count 435
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 147 transition count 433
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 147 transition count 433
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 137 transition count 423
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 135 transition count 421
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 135 transition count 421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 133 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 133 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 133 transition count 418
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 132 transition count 417
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 131 transition count 415
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 131 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 131 transition count 414
Applied a total of 45 rules in 38 ms. Remains 131 /151 variables (removed 20) and now considering 414/437 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 131/151 places, 414/437 transitions.
RANDOM walk for 4000000 steps (172369 resets) in 17094 ms. (233 steps per ms) remains 19/24 properties
BEST_FIRST walk for 400003 steps (4780 resets) in 546 ms. (731 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4859 resets) in 555 ms. (719 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (4743 resets) in 574 ms. (695 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (4788 resets) in 563 ms. (709 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4781 resets) in 564 ms. (707 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4834 resets) in 554 ms. (720 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4835 resets) in 556 ms. (718 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (4817 resets) in 559 ms. (714 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4831 resets) in 560 ms. (713 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4831 resets) in 539 ms. (740 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4812 resets) in 541 ms. (738 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (4823 resets) in 542 ms. (736 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (4863 resets) in 563 ms. (709 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (4835 resets) in 561 ms. (711 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (4844 resets) in 552 ms. (723 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (4853 resets) in 551 ms. (724 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (4830 resets) in 532 ms. (750 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4788 resets) in 538 ms. (742 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4811 resets) in 531 ms. (751 steps per ms) remains 19/19 properties
[2024-06-02 18:19:54] [INFO ] Flow matrix only has 386 transitions (discarded 28 similar events)
// Phase 1: matrix 386 rows 131 cols
[2024-06-02 18:19:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:19:54] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 81/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 27/127 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 386/513 variables, 127/134 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 61/195 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 4/517 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/517 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 199 constraints, problems are : Problem set: 0 solved, 19 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 81/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 27/127 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:19:54] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:19:54] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:19:54] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:19:54] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 2 ms to minimize.
[2024-06-02 18:19:54] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 386/513 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 61/200 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 19/219 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:19:55] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2024-06-02 18:19:55] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:19:55] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:19:55] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:19:55] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 4/517 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/517 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/517 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 228 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 10/10 constraints]
After SMT, in 2619ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 1264 ms.
Support contains 19 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 414/414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 406
Applied a total of 4 rules in 17 ms. Remains 129 /131 variables (removed 2) and now considering 406/414 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 129/131 places, 406/414 transitions.
RANDOM walk for 4000000 steps (171812 resets) in 17740 ms. (225 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4840 resets) in 545 ms. (732 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4806 resets) in 538 ms. (742 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4808 resets) in 542 ms. (736 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4841 resets) in 540 ms. (739 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (4813 resets) in 548 ms. (728 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4845 resets) in 554 ms. (720 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (4834 resets) in 552 ms. (723 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (4826 resets) in 511 ms. (781 steps per ms) remains 16/19 properties
BEST_FIRST walk for 400004 steps (4775 resets) in 494 ms. (808 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (4801 resets) in 502 ms. (795 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (4795 resets) in 509 ms. (784 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (4867 resets) in 514 ms. (776 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (4795 resets) in 514 ms. (776 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (4826 resets) in 510 ms. (782 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (4808 resets) in 509 ms. (784 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (4813 resets) in 508 ms. (785 steps per ms) remains 16/16 properties
[2024-06-02 18:20:05] [INFO ] Flow matrix only has 378 transitions (discarded 28 similar events)
// Phase 1: matrix 378 rows 129 cols
[2024-06-02 18:20:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:20:05] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 82/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 27/125 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 378/503 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 4/507 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/507 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 196 constraints, problems are : Problem set: 0 solved, 16 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 82/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 27/125 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 378/503 variables, 125/137 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 60/197 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:20:06] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 4/507 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/507 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 223 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2377 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 11/11 constraints]
After SMT, in 2881ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 797 ms.
Support contains 16 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 406/406 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 398
Applied a total of 4 rules in 9 ms. Remains 127 /129 variables (removed 2) and now considering 398/406 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 127/129 places, 398/406 transitions.
RANDOM walk for 4000000 steps (172091 resets) in 16429 ms. (243 steps per ms) remains 12/16 properties
BEST_FIRST walk for 4000003 steps (48155 resets) in 4226 ms. (946 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48067 resets) in 4156 ms. (962 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (48064 resets) in 4103 ms. (974 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (48179 resets) in 4101 ms. (975 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48010 resets) in 4150 ms. (963 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48064 resets) in 4127 ms. (968 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48053 resets) in 4106 ms. (973 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (48158 resets) in 4097 ms. (976 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48018 resets) in 4134 ms. (967 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48025 resets) in 4118 ms. (971 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48129 resets) in 4151 ms. (963 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (48067 resets) in 4155 ms. (962 steps per ms) remains 12/12 properties
[2024-06-02 18:20:29] [INFO ] Flow matrix only has 370 transitions (discarded 28 similar events)
// Phase 1: matrix 370 rows 127 cols
[2024-06-02 18:20:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:20:29] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 84/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 27/123 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 370/493 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 59/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 4/497 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/497 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 193 constraints, problems are : Problem set: 0 solved, 12 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 84/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 27/123 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 370/493 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 59/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 12/206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 4/497 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/497 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 212 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 5807 ms.
Support contains 12 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 398/398 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 397
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 397
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 396
Applied a total of 6 rules in 11 ms. Remains 124 /127 variables (removed 3) and now considering 396/398 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 124/127 places, 396/398 transitions.
RANDOM walk for 4000000 steps (171922 resets) in 13096 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (48133 resets) in 4218 ms. (948 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (48015 resets) in 4094 ms. (976 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000001 steps (48067 resets) in 4093 ms. (977 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (47981 resets) in 4075 ms. (981 steps per ms) remains 8/12 properties
BEST_FIRST walk for 4000002 steps (48213 resets) in 3446 ms. (1160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (48064 resets) in 3425 ms. (1167 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (48196 resets) in 3448 ms. (1159 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (48016 resets) in 6457 ms. (619 steps per ms) remains 8/8 properties
[2024-06-02 18:20:52] [INFO ] Flow matrix only has 368 transitions (discarded 28 similar events)
// Phase 1: matrix 368 rows 124 cols
[2024-06-02 18:20:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:20:52] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 27/120 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 368/488 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/492 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 190 constraints, problems are : Problem set: 0 solved, 8 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 85/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 27/120 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 368/488 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 59/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:20:53] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/492 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 206 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 1387ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1275 ms.
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 396/396 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 395
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 395
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 122 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 121 transition count 394
Applied a total of 6 rules in 11 ms. Remains 121 /124 variables (removed 3) and now considering 394/396 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 121/124 places, 394/396 transitions.
RANDOM walk for 4000000 steps (171970 resets) in 10858 ms. (368 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (48125 resets) in 3386 ms. (1180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (47948 resets) in 4278 ms. (934 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000004 steps (48229 resets) in 3505 ms. (1140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (48016 resets) in 3062 ms. (1305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (48177 resets) in 3055 ms. (1308 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (48091 resets) in 3081 ms. (1297 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (48242 resets) in 3155 ms. (1267 steps per ms) remains 6/6 properties
[2024-06-02 18:21:05] [INFO ] Flow matrix only has 366 transitions (discarded 28 similar events)
// Phase 1: matrix 366 rows 121 cols
[2024-06-02 18:21:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:21:05] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/117 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 366/483 variables, 117/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 59/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/487 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/487 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/117 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:21:05] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:21:05] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 366/483 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 59/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:21:05] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:21:05] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/487 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/487 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 197 constraints, problems are : Problem set: 0 solved, 6 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 946ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 858 ms.
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 394/394 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 119 transition count 392
Applied a total of 4 rules in 18 ms. Remains 119 /121 variables (removed 2) and now considering 392/394 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 119/121 places, 392/394 transitions.
RANDOM walk for 4000000 steps (171931 resets) in 9607 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (48090 resets) in 3243 ms. (1233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (47985 resets) in 3105 ms. (1287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (48162 resets) in 3154 ms. (1267 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (48098 resets) in 3121 ms. (1281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (48178 resets) in 3189 ms. (1253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (48196 resets) in 3153 ms. (1268 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 1272714 steps, run visited all 6 properties in 4458 ms. (steps per millisecond=285 )
Probabilistic random walk after 1272714 steps, saw 349322 distinct states, run finished after 4461 ms. (steps per millisecond=285 ) properties seen :6
Able to resolve query StableMarking after proving 331 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 150992 ms.
ITS solved all properties within timeout

BK_STOP 1717352479288

--------------------
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-17"
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-17, 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-171734905900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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