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.r498-tall-171640618100518.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HealthRecord-PT-17, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618100518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 175K May 18 16:42 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 1717194133137

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:22:14] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-31 22:22:14] [INFO ] Transformed 624 places.
[2024-05-31 22:22:14] [INFO ] Transformed 828 transitions.
[2024-05-31 22:22:14] [INFO ] Found NUPN structural information;
[2024-05-31 22:22:14] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 196 ms.
Graph (trivial) has 749 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 5 ms
Free SCC test removed 66 places
Structural test allowed to assert that 266 places are NOT stable. Took 26 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
RANDOM walk for 40000 steps (362 resets) in 2323 ms. (17 steps per ms) remains 310/358 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 27 ms. (14 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 401 steps (8 resets) in 22 ms. (17 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
[2024-05-31 22:22:15] [INFO ] Flow matrix only has 733 transitions (discarded 20 similar events)
// Phase 1: matrix 733 rows 558 cols
[2024-05-31 22:22:15] [INFO ] Computed 18 invariants in 18 ms
[2024-05-31 22:22:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "ParserException while parsing response: ((s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s44 (/ 1.0 2.0))
(s45 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/1291 variables, and 310 constraints, problems are : Problem set: 0 solved, 310 unsolved in 5050 ms.
Refiners :[Domain max(s): 310/558 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/558 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 48/358 variables, 10/320 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 48/368 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 18 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 90 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 90 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 90 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 110 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1291 variables, and 386 constraints, problems are : Problem set: 0 solved, 310 unsolved in 5008 ms.
Refiners :[Domain max(s): 358/558 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/558 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/310 constraints, Known Traps: 18/18 constraints]
After SMT, in 10208ms problems are : Problem set: 0 solved, 310 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 310 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 753/753 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 558 transition count 591
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 158 rules applied. Total rules applied 320 place count 417 transition count 574
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 329 place count 408 transition count 574
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 329 place count 408 transition count 564
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 349 place count 398 transition count 564
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 385 place count 380 transition count 546
Performed 7 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 399 place count 373 transition count 592
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 406 place count 373 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 426 place count 373 transition count 565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 428 place count 372 transition count 575
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 453 place count 372 transition count 550
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 478 place count 347 transition count 550
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 347 transition count 550
Applied a total of 487 rules in 125 ms. Remains 347 /558 variables (removed 211) and now considering 550/753 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 347/558 places, 550/753 transitions.
RANDOM walk for 4000000 steps (439166 resets) in 39191 ms. (102 steps per ms) remains 138/310 properties
BEST_FIRST walk for 40003 steps (597 resets) in 236 ms. (168 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (577 resets) in 126 ms. (314 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (590 resets) in 124 ms. (320 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (578 resets) in 128 ms. (310 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (594 resets) in 110 ms. (360 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (593 resets) in 99 ms. (400 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (601 resets) in 102 ms. (388 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (593 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (597 resets) in 99 ms. (400 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (579 resets) in 88 ms. (449 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (595 resets) in 78 ms. (506 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (576 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (584 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (590 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (577 resets) in 63 ms. (625 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (578 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (598 resets) in 61 ms. (645 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (582 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (585 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (600 resets) in 64 ms. (615 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (599 resets) in 66 ms. (597 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (606 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (592 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (597 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (600 resets) in 61 ms. (645 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (591 resets) in 61 ms. (645 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (592 resets) in 65 ms. (606 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (600 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (587 resets) in 63 ms. (625 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (601 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (607 resets) in 63 ms. (625 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (589 resets) in 61 ms. (645 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (595 resets) in 65 ms. (606 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (591 resets) in 63 ms. (625 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (582 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (584 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (582 resets) in 62 ms. (634 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (580 resets) in 59 ms. (666 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (602 resets) in 64 ms. (615 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (588 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (582 resets) in 63 ms. (625 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (576 resets) in 64 ms. (615 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (585 resets) in 60 ms. (655 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (593 resets) in 61 ms. (645 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (585 resets) in 65 ms. (606 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (579 resets) in 61 ms. (645 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (587 resets) in 63 ms. (625 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (586 resets) in 64 ms. (615 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (583 resets) in 64 ms. (615 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (586 resets) in 64 ms. (615 steps per ms) remains 138/138 properties
// Phase 1: matrix 550 rows 347 cols
[2024-05-31 22:22:36] [INFO ] Computed 18 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 102/240 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 102/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 107/347 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 107/365 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 550/897 variables, 347/712 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/897 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/897 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 897/897 variables, and 712 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8078 ms.
Refiners :[Domain max(s): 347/347 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 102/240 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 102/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 19/269 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 3 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 76 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:22:47] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:49] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 107/347 variables, 8/285 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 107/392 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 3 ms to minimize.
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 3 ms to minimize.
[2024-05-31 22:22:50] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:22:53] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 3 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 1 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 13/473 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:23:01] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:23:01] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:23:02] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:23:02] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 1 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:23:03] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:23:06] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/347 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 20 (OVERLAPS) 550/897 variables, 347/836 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/897 variables, 138/974 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 3 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/897 variables, 2/976 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:23:19] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:23:19] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:23:20] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/897 variables, 14/990 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/897 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/897 variables, and 990 constraints, problems are : Problem set: 0 solved, 138 unsolved in 45023 ms.
Refiners :[Domain max(s): 347/347 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 140/140 constraints]
After SMT, in 53130ms problems are : Problem set: 0 solved, 138 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 550/550 transitions.
Graph (complete) has 1004 edges and 347 vertex of which 338 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 338 transition count 485
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 76 rules applied. Total rules applied 142 place count 273 transition count 474
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 147 place count 268 transition count 474
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 147 place count 268 transition count 470
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 155 place count 264 transition count 470
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 202 place count 217 transition count 360
Iterating global reduction 3 with 47 rules applied. Total rules applied 249 place count 217 transition count 360
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 212 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 212 transition count 350
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 268 place count 212 transition count 341
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 292 place count 200 transition count 329
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 314 place count 189 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 189 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 317 place count 189 transition count 376
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 189 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 321 place count 187 transition count 374
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 331 place count 187 transition count 374
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 339 place count 187 transition count 374
Applied a total of 339 rules in 82 ms. Remains 187 /347 variables (removed 160) and now considering 374/550 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 187/347 places, 374/550 transitions.
RANDOM walk for 4000000 steps (425146 resets) in 34882 ms. (114 steps per ms) remains 14/138 properties
BEST_FIRST walk for 4000004 steps (46267 resets) in 2683 ms. (1490 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (46290 resets) in 2877 ms. (1389 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4000004 steps (46425 resets) in 2591 ms. (1543 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (46478 resets) in 2690 ms. (1486 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (46127 resets) in 2560 ms. (1561 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (46208 resets) in 2497 ms. (1601 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (46213 resets) in 2518 ms. (1587 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (46303 resets) in 2547 ms. (1569 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (46269 resets) in 2518 ms. (1587 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (46408 resets) in 2508 ms. (1594 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (46316 resets) in 2513 ms. (1591 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (46226 resets) in 2471 ms. (1618 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (46350 resets) in 2463 ms. (1623 steps per ms) remains 11/11 properties
[2024-05-31 22:23:50] [INFO ] Flow matrix only has 351 transitions (discarded 23 similar events)
// Phase 1: matrix 351 rows 187 cols
[2024-05-31 22:23:50] [INFO ] Computed 9 invariants in 2 ms
[2024-05-31 22:23:50] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 157/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 351/538 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 203 constraints, problems are : Problem set: 0 solved, 11 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 157/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 351/538 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 11/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/538 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 214 constraints, problems are : Problem set: 0 solved, 11 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 11 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 374/374 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 187 transition count 284
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 195 place count 97 transition count 269
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 219 place count 73 transition count 221
Iterating global reduction 2 with 24 rules applied. Total rules applied 243 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 247 place count 69 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 251 place count 69 transition count 213
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 254 place count 66 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 257 place count 66 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 260 place count 63 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 263 place count 63 transition count 198
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 281 place count 63 transition count 180
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 60 transition count 177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 293 place count 57 transition count 195
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 294 place count 57 transition count 194
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 57 transition count 194
Applied a total of 295 rules in 22 ms. Remains 57 /187 variables (removed 130) and now considering 194/374 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 57/187 places, 194/374 transitions.
RANDOM walk for 4000000 steps (418158 resets) in 14529 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47921 resets) in 2432 ms. (1644 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47975 resets) in 2436 ms. (1641 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (47896 resets) in 2431 ms. (1644 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47997 resets) in 2428 ms. (1646 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (48098 resets) in 2423 ms. (1650 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (48025 resets) in 2474 ms. (1616 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47939 resets) in 2485 ms. (1609 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (48015 resets) in 2441 ms. (1638 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (48042 resets) in 2417 ms. (1654 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (48014 resets) in 2444 ms. (1635 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (47926 resets) in 2423 ms. (1650 steps per ms) remains 11/11 properties
Finished probabilistic random walk after 3304 steps, run visited all 11 properties in 53 ms. (steps per millisecond=62 )
Probabilistic random walk after 3304 steps, saw 1248 distinct states, run finished after 56 ms. (steps per millisecond=59 ) properties seen :11
Able to resolve query StableMarking after proving 360 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 108373 ms.
ITS solved all properties within timeout

BK_STOP 1717194242694

--------------------
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="HealthRecord-PT-17"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-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 r498-tall-171640618100518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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