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.r189-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 itstools
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 r189-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 1716474742173

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 14:32:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 14:32:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:32:23] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-23 14:32:23] [INFO ] Transformed 624 places.
[2024-05-23 14:32:23] [INFO ] Transformed 828 transitions.
[2024-05-23 14:32:23] [INFO ] Found NUPN structural information;
[2024-05-23 14:32:23] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 200 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 25 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
[2024-05-23 14:32:24] [INFO ] Flatten gal took : 154 ms
[2024-05-23 14:32:24] [INFO ] Flatten gal took : 72 ms
[2024-05-23 14:32:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13404445737497791005.gal : 42 ms
[2024-05-23 14:32:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2014296701817940951.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13404445737497791005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2014296701817940951.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (363 resets) in 2968 ms. (13 steps per ms) remains 310/358 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 310/310 properties
Loading property file /tmp/ReachabilityCardinality2014296701817940951.prop.
BEST_FIRST walk for 403 steps (8 resets) in 45 ms. (8 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 41 ms. (9 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 30 ms. (13 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 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 404 steps (8 resets) in 50 ms. (7 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 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 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 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 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 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 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 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 403 steps (8 resets) in 20 ms. (19 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 404 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 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 403 steps (8 resets) in 14 ms. (26 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 402 steps (8 resets) in 8 ms. (44 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 4 ms. (80 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 4 ms. (80 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 8 ms. (44 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 402 steps (8 resets) in 7 ms. (50 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 402 steps (8 resets) in 8 ms. (44 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 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 310/310 properties
[2024-05-23 14:32:24] [INFO ] Flow matrix only has 733 transitions (discarded 20 similar events)
// Phase 1: matrix 733 rows 558 cols
SDD proceeding with computation,358 properties remain. new max is 4
SDD size :1 after 5
[2024-05-23 14:32:24] [INFO ] Computed 18 invariants in 22 ms
[2024-05-23 14:32:24] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,358 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,358 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,358 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,358 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,358 properties remain. new max is 128
SDD size :27 after 41
SDD proceeding with computation,358 properties remain. new max is 256
SDD size :41 after 461
SDD proceeding with computation,358 properties remain. new max is 512
SDD size :461 after 2.79368e+08
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 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s54 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s88 (/ 1.0 2.0)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 5191 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-23 14:32:32] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 21 ms to minimize.
[2024-05-23 14:32:32] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2024-05-23 14:32:32] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2024-05-23 14:32:32] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 3 ms to minimize.
[2024-05-23 14:32:32] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:32:33] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 1 ms to minimize.
[2024-05-23 14:32:34] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-23 14:32:34] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1291 variables, and 376 constraints, problems are : Problem set: 0 solved, 310 unsolved in 5038 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: 8/8 constraints]
After SMT, in 10390ms 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 0 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 1 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 1 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 208 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 215 ms. Remains : 347/558 places, 550/753 transitions.
RANDOM walk for 4000000 steps (439446 resets) in 62376 ms. (64 steps per ms) remains 138/310 properties
BEST_FIRST walk for 40003 steps (603 resets) in 172 ms. (231 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (589 resets) in 127 ms. (312 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (584 resets) in 169 ms. (235 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (588 resets) in 127 ms. (312 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (606 resets) in 149 ms. (266 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (568 resets) in 122 ms. (325 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (595 resets) in 124 ms. (320 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (586 resets) in 106 ms. (373 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (592 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (599 resets) in 94 ms. (421 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (581 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (594 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (586 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (607 resets) in 85 ms. (465 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (585 resets) in 78 ms. (506 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40001 steps (602 resets) in 76 ms. (519 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (585 resets) in 79 ms. (500 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (599 resets) in 79 ms. (500 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (585 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (603 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (583 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (595 resets) in 129 ms. (307 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (579 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (582 resets) in 88 ms. (449 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (578 resets) in 109 ms. (363 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (589 resets) in 116 ms. (341 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (585 resets) in 85 ms. (465 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (589 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (593 resets) in 104 ms. (380 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (582 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (589 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (592 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (608 resets) in 87 ms. (454 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (611 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (588 resets) in 92 ms. (430 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (577 resets) in 117 ms. (339 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (590 resets) in 75 ms. (526 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (602 resets) in 122 ms. (325 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (603 resets) in 103 ms. (384 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (600 resets) in 79 ms. (500 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (591 resets) in 93 ms. (425 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (591 resets) in 140 ms. (283 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (591 resets) in 87 ms. (454 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (592 resets) in 75 ms. (526 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (590 resets) in 73 ms. (540 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (598 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (600 resets) in 80 ms. (493 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (592 resets) in 91 ms. (434 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (584 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (592 resets) in 75 ms. (526 steps per ms) remains 138/138 properties
// Phase 1: matrix 550 rows 347 cols
[2024-05-23 14:32:54] [INFO ] Computed 18 invariants in 3 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 8270 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-23 14:33:03] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 9 ms to minimize.
[2024-05-23 14:33:03] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:33:03] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:33:03] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:33:03] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 75 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:33:04] [INFO ] Deduced a trap composed of 72 places in 65 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-23 14:33:05] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:33:05] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:33:05] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:33:05] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:33:05] [INFO ] Deduced a trap composed of 76 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:33:05] [INFO ] Deduced a trap composed of 76 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:33:05] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 2 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-23 14:33:06] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 4 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-23 14:33:07] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-23 14:33:07] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 4 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 1 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-23 14:33:08] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 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-23 14:33:09] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:33:09] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 8 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 1 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 2 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:33:10] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 2 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-23 14:33:11] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-05-23 14:33:11] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 1 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:33:12] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-05-23 14:33:13] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 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-23 14:33:14] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-23 14:33:14] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-23 14:33:14] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-23 14:33:14] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-23 14:33:14] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-23 14:33:14] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-23 14:33:14] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 2 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:33:15] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-23 14:33:16] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 1 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2024-05-23 14:33:17] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2024-05-23 14:33:18] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-23 14:33:18] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:18] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:33:18] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-23 14:33:18] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:18] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:19] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:19] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:19] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:33:19] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-05-23 14:33:20] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-23 14:33:20] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:33:20] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 2 ms to minimize.
[2024-05-23 14:33:20] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:20] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 2 ms to minimize.
[2024-05-23 14:33:21] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:33:21] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 2 ms to minimize.
[2024-05-23 14:33:21] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 1 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-23 14:33:22] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 13/513 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:23] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-05-23 14:33:24] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:24] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-23 14:33:24] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-23 14:33:24] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:33:24] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:25] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 2 ms to minimize.
[2024-05-23 14:33:25] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:26] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:26] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:33:27] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:33:27] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 0 ms to minimize.
[2024-05-23 14:33:27] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:33:27] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:33:28] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-23 14:33:28] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-23 14:33:28] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/347 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:29] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/347 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:30] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/347 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:32] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-05-23 14:33:32] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:33:32] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-23 14:33:33] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/347 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/347 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 24 (OVERLAPS) 550/897 variables, 347/883 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/897 variables, 138/1021 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:36] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:33:36] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:37] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:33:38] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:33:39] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:33:39] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/897 variables, 7/1028 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 2 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 2 ms to minimize.
[2024-05-23 14:33:46] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2024-05-23 14:33:47] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/897 variables, and 1037 constraints, problems are : Problem set: 0 solved, 138 unsolved in 45027 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: 187/187 constraints]
After SMT, in 53368ms 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 1 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 82 ms. Remains : 187/347 places, 374/550 transitions.
RANDOM walk for 4000000 steps (425873 resets) in 40678 ms. (98 steps per ms) remains 21/138 properties
BEST_FIRST walk for 400004 steps (4628 resets) in 546 ms. (731 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4646 resets) in 567 ms. (704 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (4604 resets) in 549 ms. (727 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4646 resets) in 420 ms. (950 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4644 resets) in 544 ms. (733 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4605 resets) in 548 ms. (728 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4653 resets) in 442 ms. (902 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4667 resets) in 552 ms. (723 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4552 resets) in 435 ms. (917 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4657 resets) in 542 ms. (736 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4593 resets) in 444 ms. (898 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4650 resets) in 530 ms. (753 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4671 resets) in 564 ms. (707 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4647 resets) in 573 ms. (696 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (4662 resets) in 449 ms. (888 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (4604 resets) in 537 ms. (743 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4654 resets) in 560 ms. (713 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4636 resets) in 448 ms. (890 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4673 resets) in 486 ms. (821 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4638 resets) in 539 ms. (740 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4659 resets) in 434 ms. (919 steps per ms) remains 21/21 properties
[2024-05-23 14:34:03] [INFO ] Flow matrix only has 351 transitions (discarded 23 similar events)
// Phase 1: matrix 351 rows 187 cols
[2024-05-23 14:34:03] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 14:34:03] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 147/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 351/538 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 203 constraints, problems are : Problem set: 0 solved, 21 unsolved in 481 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: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 147/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 351/538 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 21/224 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:03] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-23 14:34:04] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:05] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-05-23 14:34:05] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:34:05] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:34:05] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:05] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:34:05] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/538 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:06] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/538 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:06] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:34:06] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:34:06] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:06] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 14:34:07] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/538 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (OVERLAPS) 0/538 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 244 constraints, problems are : Problem set: 0 solved, 21 unsolved in 4115 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: 21/21 constraints, Known Traps: 20/20 constraints]
After SMT, in 4608ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 14 different solutions.
Parikh walk visited 8 properties in 2650 ms.
Support contains 13 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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 187 transition count 286
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 190 place count 99 transition count 272
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 213 place count 76 transition count 226
Iterating global reduction 2 with 23 rules applied. Total rules applied 236 place count 76 transition count 226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 240 place count 72 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 244 place count 72 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 246 place count 70 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 248 place count 70 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 250 place count 68 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 68 transition count 208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 68 transition count 196
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 270 place count 65 transition count 193
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
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 276 place count 62 transition count 212
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 277 place count 62 transition count 211
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 278 place count 62 transition count 211
Applied a total of 278 rules in 31 ms. Remains 62 /187 variables (removed 125) and now considering 211/374 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 62/187 places, 211/374 transitions.
RANDOM walk for 4000000 steps (421852 resets) in 20602 ms. (194 steps per ms) remains 0/13 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 360 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 114396 ms.

BK_STOP 1716474857781

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="itstools"
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 itstools"
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 r189-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 ;