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.r553-tall-171734901400318.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 FireWire-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357924189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:52:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:52:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:52:05] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-02 19:52:05] [INFO ] Transformed 602 places.
[2024-06-02 19:52:05] [INFO ] Transformed 944 transitions.
[2024-06-02 19:52:05] [INFO ] Found NUPN structural information;
[2024-06-02 19:52:05] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (12 resets) in 1239 ms. (32 steps per ms) remains 12/15 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (12 resets) in 388 ms. (102 steps per ms) remains 11/12 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (12 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (13 resets) in 140 ms. (283 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (20 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (17 resets) in 343 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (17 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (16 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (13 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (22 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (18 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
// Phase 1: matrix 944 rows 602 cols
[2024-06-02 19:52:06] [INFO ] Computed 13 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 509/602 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 509/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 944/1546 variables, 602/1217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1546/1546 variables, and 1217 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1262 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 509/602 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 509/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:52:08] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 19 ms to minimize.
[2024-06-02 19:52:08] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:52:08] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:52:08] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 3 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 3 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 11/626 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 944/1546 variables, 602/1228 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1546 variables, 10/1238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:52:10] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:52:11] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 4 ms to minimize.
[2024-06-02 19:52:11] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 3 ms to minimize.
[2024-06-02 19:52:11] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 3 ms to minimize.
[2024-06-02 19:52:11] [INFO ] Deduced a trap composed of 187 places in 188 ms of which 3 ms to minimize.
[2024-06-02 19:52:12] [INFO ] Deduced a trap composed of 180 places in 190 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1546 variables, 6/1244 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:52:13] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1546/1546 variables, and 1245 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5012 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 18/18 constraints]
After SMT, in 6385ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 366 edges and 602 vertex of which 4 / 602 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1601 edges and 599 vertex of which 590 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 (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 590 transition count 815
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 125 rules applied. Total rules applied 252 place count 468 transition count 812
Reduce places removed 2 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 19 rules applied. Total rules applied 271 place count 466 transition count 795
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 288 place count 449 transition count 795
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 288 place count 449 transition count 780
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 318 place count 434 transition count 780
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 366 place count 386 transition count 731
Iterating global reduction 4 with 48 rules applied. Total rules applied 414 place count 386 transition count 731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 415 place count 386 transition count 730
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 415 place count 386 transition count 722
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 431 place count 378 transition count 722
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 437 place count 372 transition count 655
Iterating global reduction 5 with 6 rules applied. Total rules applied 443 place count 372 transition count 655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 446 place count 372 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 447 place count 371 transition count 652
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 527 place count 331 transition count 612
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 581 place count 304 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 588 place count 304 transition count 675
Free-agglomeration rule applied 32 times.
Iterating global reduction 7 with 32 rules applied. Total rules applied 620 place count 304 transition count 643
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 653 place count 272 transition count 642
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 667 place count 272 transition count 628
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 673 place count 272 transition count 628
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 675 place count 272 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 676 place count 271 transition count 627
Applied a total of 676 rules in 245 ms. Remains 271 /602 variables (removed 331) and now considering 627/944 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 271/602 places, 627/944 transitions.
RANDOM walk for 40000 steps (690 resets) in 342 ms. (116 steps per ms) remains 7/10 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (120 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (124 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (113 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (141 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (136 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (141 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
[2024-06-02 19:52:13] [INFO ] Flow matrix only has 617 transitions (discarded 10 similar events)
// Phase 1: matrix 617 rows 271 cols
[2024-06-02 19:52:13] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:52:13] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 188/259 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 615/874 variables, 259/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 11/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 13/887 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/887 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/888 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/888 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/888 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 888/888 variables, and 292 constraints, problems are : Problem set: 0 solved, 7 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 271/271 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 188/259 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:52:14] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:52:14] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:52:14] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:52:14] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:52:15] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:52:15] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 615/874 variables, 259/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 11/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 13/887 variables, 11/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/887 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/887 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/888 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/888 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:52:16] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/888 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:52:16] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:52:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/888 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/888 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/888 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/888 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 888/888 variables, and 309 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3241 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 271/271 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 3943ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3275 ms.
Support contains 68 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 627/627 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 271 transition count 621
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 265 transition count 619
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 263 transition count 619
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 263 transition count 616
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 22 place count 260 transition count 616
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 259 transition count 615
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 259 transition count 615
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 34 place count 254 transition count 610
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
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 40 place count 251 transition count 615
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 251 transition count 607
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 55 place count 251 transition count 600
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 73 place count 244 transition count 589
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 244 transition count 583
Applied a total of 79 rules in 83 ms. Remains 244 /271 variables (removed 27) and now considering 583/627 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 244/271 places, 583/627 transitions.
RANDOM walk for 40000 steps (616 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (132 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (102 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (132 resets) in 109 ms. (363 steps per ms) remains 4/5 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 19:52:21] [INFO ] Flow matrix only has 577 transitions (discarded 6 similar events)
// Phase 1: matrix 577 rows 244 cols
[2024-06-02 19:52:21] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:52:21] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/229 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 571/800 variables, 229/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 59/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/819 variables, 13/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/819 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/821 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/821 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 244/244 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/229 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:52:21] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 571/800 variables, 229/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 59/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/800 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/800 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 19/819 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/819 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:52:23] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/819 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:52:23] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/819 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/819 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/821 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:52:23] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/821 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/821 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/821 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 326 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 244/244 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 2394ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1138 ms.
Support contains 39 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 583/583 transitions.
Graph (trivial) has 55 edges and 244 vertex of which 4 / 244 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 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 0 with 9 rules applied. Total rules applied 10 place count 242 transition count 570
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 233 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 231 transition count 568
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 23 place count 231 transition count 565
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 29 place count 228 transition count 565
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 45 place count 220 transition count 557
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 220 transition count 556
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 219 transition count 553
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 219 transition count 553
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 52 place count 217 transition count 563
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 114 place count 217 transition count 501
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 119 place count 217 transition count 496
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 124 place count 212 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 212 transition count 495
Applied a total of 125 rules in 51 ms. Remains 212 /244 variables (removed 32) and now considering 495/583 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 212/244 places, 495/583 transitions.
RANDOM walk for 40000 steps (913 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (181 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (186 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 724733 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :1 out of 4
Probabilistic random walk after 724733 steps, saw 175279 distinct states, run finished after 3004 ms. (steps per millisecond=241 ) properties seen :1
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:52:28] [INFO ] Flow matrix only has 449 transitions (discarded 46 similar events)
// Phase 1: matrix 449 rows 212 cols
[2024-06-02 19:52:28] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:52:28] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 167/180 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/200 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 442/642 variables, 200/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 59/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/653 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/656 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/656 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/658 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/658 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/660 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/660 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/660 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/661 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/661 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/661 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 283 constraints, problems are : Problem set: 0 solved, 3 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 167/180 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:52:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 20/200 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:52:28] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 442/642 variables, 200/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 59/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/653 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/653 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/653 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/656 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/656 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/658 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/658 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/660 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/660 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/660 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/661 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/661 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/661 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 288 constraints, problems are : Problem set: 0 solved, 3 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 189 ms.
Support contains 13 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 495/495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 212 transition count 489
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 206 transition count 489
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 206 transition count 485
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 202 transition count 485
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 200 transition count 482
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 200 transition count 482
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 200 transition count 481
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 199 transition count 481
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 46 place count 189 transition count 471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 187 transition count 467
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 187 transition count 467
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 185 transition count 470
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 185 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 185 transition count 464
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 185 transition count 459
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 71 place count 180 transition count 458
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 180 transition count 458
Applied a total of 72 rules in 67 ms. Remains 180 /212 variables (removed 32) and now considering 458/495 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 180/212 places, 458/495 transitions.
RANDOM walk for 40000 steps (1208 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (261 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (270 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (147 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 794184 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :1 out of 3
Probabilistic random walk after 794184 steps, saw 197258 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :1
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:52:32] [INFO ] Flow matrix only has 410 transitions (discarded 48 similar events)
// Phase 1: matrix 410 rows 180 cols
[2024-06-02 19:52:32] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:52:32] [INFO ] State equation strengthened by 86 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 148/159 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/173 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 408/581 variables, 173/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 86/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/590 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/590 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 148/159 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:52:33] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 3 ms to minimize.
[2024-06-02 19:52:33] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/173 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 408/581 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 86/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:52:33] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:52:33] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:52:33] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/590 variables, 7/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/590 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 283 constraints, problems are : Problem set: 0 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 952ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 11 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 458/458 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 179 transition count 457
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 179 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 178 transition count 456
Applied a total of 4 rules in 18 ms. Remains 178 /180 variables (removed 2) and now considering 456/458 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 178/180 places, 456/458 transitions.
RANDOM walk for 40000 steps (1216 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (260 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (193 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 738291 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 2
Probabilistic random walk after 738291 steps, saw 181756 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2024-06-02 19:52:36] [INFO ] Flow matrix only has 408 transitions (discarded 48 similar events)
// Phase 1: matrix 408 rows 178 cols
[2024-06-02 19:52:36] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:52:36] [INFO ] State equation strengthened by 87 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/172 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 407/579 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 86/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/585 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/586 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/586 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/172 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 407/579 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 86/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/585 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/586 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/586 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 280 constraints, problems are : Problem set: 0 solved, 2 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 297 ms.
Support contains 11 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 456/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 178/178 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 456/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-02 19:52:37] [INFO ] Flow matrix only has 408 transitions (discarded 48 similar events)
[2024-06-02 19:52:37] [INFO ] Invariant cache hit.
[2024-06-02 19:52:38] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:52:38] [INFO ] Flow matrix only has 408 transitions (discarded 48 similar events)
[2024-06-02 19:52:38] [INFO ] Invariant cache hit.
[2024-06-02 19:52:38] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 19:52:38] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-06-02 19:52:38] [INFO ] Redundant transitions in 52 ms returned [129, 134, 359, 371, 372]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 446 sub problems to find dead transitions.
[2024-06-02 19:52:38] [INFO ] Flow matrix only has 403 transitions (discarded 48 similar events)
// Phase 1: matrix 403 rows 178 cols
[2024-06-02 19:52:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:52:38] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 3/178 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:52:41] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 3 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:52:42] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 8 ms to minimize.
[2024-06-02 19:52:43] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:52:43] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:52:44] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:52:46] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:52:46] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (OVERLAPS) 403/581 variables, 178/203 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 87/290 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/581 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/581 variables, and 291 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (OVERLAPS) 3/178 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (OVERLAPS) 403/581 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 87/291 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 446/737 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:53:37] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 738 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 17/17 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 178/178 places, 451/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61048 ms. Remains : 178/178 places, 451/456 transitions.
RANDOM walk for 40000 steps (1213 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (258 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (204 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 707435 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 707435 steps, saw 174376 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2024-06-02 19:53:42] [INFO ] Flow matrix only has 403 transitions (discarded 48 similar events)
[2024-06-02 19:53:42] [INFO ] Invariant cache hit.
[2024-06-02 19:53:42] [INFO ] State equation strengthened by 87 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/172 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 402/574 variables, 172/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 86/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/580 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/581 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/581 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:53:42] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:53:42] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/172 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:53:42] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 402/574 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 86/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/580 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/580 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/581 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/581 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 280 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 757ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 299 ms.
Support contains 11 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 451/451 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 178/178 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 451/451 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 19:53:43] [INFO ] Flow matrix only has 403 transitions (discarded 48 similar events)
[2024-06-02 19:53:43] [INFO ] Invariant cache hit.
[2024-06-02 19:53:43] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 19:53:43] [INFO ] Flow matrix only has 403 transitions (discarded 48 similar events)
[2024-06-02 19:53:43] [INFO ] Invariant cache hit.
[2024-06-02 19:53:43] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 19:53:43] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-06-02 19:53:43] [INFO ] Redundant transitions in 14 ms returned []
Running 446 sub problems to find dead transitions.
[2024-06-02 19:53:43] [INFO ] Flow matrix only has 403 transitions (discarded 48 similar events)
[2024-06-02 19:53:43] [INFO ] Invariant cache hit.
[2024-06-02 19:53:43] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 3/178 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:53:47] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:53:48] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:53:48] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:53:48] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:53:48] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:53:48] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 403/581 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 87/291 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:54:00] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/581 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 10 (OVERLAPS) 0/581 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 292 constraints, problems are : Problem set: 0 solved, 446 unsolved in 27720 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (OVERLAPS) 3/178 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (OVERLAPS) 403/581 variables, 178/205 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 87/292 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 446/738 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-02 19:54:26] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:54:26] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 740 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 19/19 constraints]
After SMT, in 58030ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 58034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58675 ms. Remains : 178/178 places, 451/451 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 178 vertex of which 24 / 178 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 119 transitions.
Graph (complete) has 632 edges and 158 vertex of which 155 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 155 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 155 transition count 330
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 154 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 149 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 149 transition count 325
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 149 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 148 transition count 320
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 146 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 146 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 146 transition count 296
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 51 place count 146 transition count 293
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 57 place count 143 transition count 293
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 63 place count 140 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 140 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 139 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 138 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 138 transition count 248
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 80 place count 138 transition count 240
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 89 place count 130 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 130 transition count 235
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 130 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 97 place count 128 transition count 233
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 101 place count 128 transition count 233
Applied a total of 101 rules in 60 ms. Remains 128 /178 variables (removed 50) and now considering 233/451 (removed 218) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:54:41] [INFO ] Flow matrix only has 232 transitions (discarded 1 similar events)
// Phase 1: matrix 232 rows 128 cols
[2024-06-02 19:54:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:54:41] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:54:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:54:42] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 19:54:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 19:54:42] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:54:42] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:54:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-06-02 19:54:42] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:54:42] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 380 ms.
[2024-06-02 19:54:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-02 19:54:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 451 transitions and 1738 arcs took 7 ms.
[2024-06-02 19:54:42] [INFO ] Flatten gal took : 63 ms
Total runtime 157220 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-19-ReachabilityCardinality-2024-00
Could not compute solution for formula : FireWire-PT-19-ReachabilityCardinality-2024-04

BK_STOP 1717358082753

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-19-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/867/inv_0_
rfs formula name FireWire-PT-19-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/867/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-19, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901400318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;