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-171734901300265.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-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717355577210

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:12:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:12:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:12:58] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 19:12:58] [INFO ] Transformed 205 places.
[2024-06-02 19:12:58] [INFO ] Transformed 610 transitions.
[2024-06-02 19:12:58] [INFO ] Found NUPN structural information;
[2024-06-02 19:12:58] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Support contains 80 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 204 transition count 540
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 540
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 204 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 204 transition count 533
Applied a total of 9 rules in 40 ms. Remains 204 /205 variables (removed 1) and now considering 533/542 (removed 9) transitions.
[2024-06-02 19:12:58] [INFO ] Flow matrix only has 501 transitions (discarded 32 similar events)
// Phase 1: matrix 501 rows 204 cols
[2024-06-02 19:12:58] [INFO ] Computed 10 invariants in 33 ms
[2024-06-02 19:12:58] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-02 19:12:58] [INFO ] Flow matrix only has 501 transitions (discarded 32 similar events)
[2024-06-02 19:12:58] [INFO ] Invariant cache hit.
[2024-06-02 19:12:59] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 19:12:59] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [85, 148]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 627 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/205 places, 533/542 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 688 ms. Remains : 202/205 places, 533/542 transitions.
Support contains 80 out of 202 places after structural reductions.
[2024-06-02 19:12:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:12:59] [INFO ] Flatten gal took : 66 ms
FORMULA FireWire-PT-13-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:12:59] [INFO ] Flatten gal took : 39 ms
[2024-06-02 19:12:59] [INFO ] Input system was already deterministic with 533 transitions.
Support contains 76 out of 202 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (1181 resets) in 1488 ms. (26 steps per ms) remains 20/52 properties
BEST_FIRST walk for 4004 steps (33 resets) in 69 ms. (57 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (25 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (24 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (23 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (23 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (20 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (21 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (22 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (22 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
[2024-06-02 19:13:00] [INFO ] Flow matrix only has 501 transitions (discarded 32 similar events)
// Phase 1: matrix 501 rows 202 cols
[2024-06-02 19:13:00] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 19:13:00] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 140/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 15/192 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 493/685 variables, 192/200 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 70/270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 19:13:01] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 17/702 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 1/703 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/703 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/703 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 284 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 202/202 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 140/177 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:13:02] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:13:02] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 15/192 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 493/685 variables, 192/203 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 70/273 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 14/287 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/685 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 17/702 variables, 10/297 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 2/299 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/702 variables, 4/303 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:13:03] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/702 variables, 1/304 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:13:04] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/702 variables, 1/305 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/702 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 1/703 variables, 1/306 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:13:04] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/703 variables, 1/307 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/703 variables, 0/307 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 0/703 variables, 0/307 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 703/703 variables, and 307 constraints, problems are : Problem set: 2 solved, 18 unsolved in 3766 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 202/202 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 18/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 5583ms problems are : Problem set: 2 solved, 18 unsolved
Parikh walk visited 0 properties in 897 ms.
Support contains 24 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 533/533 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 202 transition count 530
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 202 transition count 527
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 199 transition count 527
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 196 transition count 521
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 196 transition count 521
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 196 transition count 519
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 195 transition count 516
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 195 transition count 516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 194 transition count 514
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 194 transition count 514
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 193 transition count 511
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 193 transition count 511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 192 transition count 509
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 192 transition count 509
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 191 transition count 506
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 191 transition count 506
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 190 transition count 504
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 190 transition count 504
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 187 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 185 transition count 505
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 185 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 185 transition count 499
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 185 transition count 501
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 184 transition count 499
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 184 transition count 497
Applied a total of 51 rules in 145 ms. Remains 184 /202 variables (removed 18) and now considering 497/533 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 184/202 places, 497/533 transitions.
RANDOM walk for 40000 steps (1292 resets) in 734 ms. (54 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (28 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (20 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 471508 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :7 out of 17
Probabilistic random walk after 471508 steps, saw 114622 distinct states, run finished after 3005 ms. (steps per millisecond=156 ) properties seen :7
[2024-06-02 19:13:10] [INFO ] Flow matrix only has 464 transitions (discarded 33 similar events)
// Phase 1: matrix 464 rows 184 cols
[2024-06-02 19:13:10] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:13:10] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 144/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:13:10] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:13:10] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/177 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 460/637 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 69/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 11/648 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/648 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 265 constraints, problems are : Problem set: 0 solved, 10 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 184/184 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 144/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 18/177 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:13:11] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:13:11] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:13:11] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-06-02 19:13:11] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 460/637 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 69/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 11/648 variables, 7/275 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 279 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 184/184 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 1858ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 1461 ms.
Support contains 15 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 497/497 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 183 transition count 496
Applied a total of 1 rules in 21 ms. Remains 183 /184 variables (removed 1) and now considering 496/497 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 183/184 places, 496/497 transitions.
RANDOM walk for 40000 steps (1271 resets) in 349 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (270 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (260 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (267 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (272 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (250 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (262 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (299 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (276 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (269 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (267 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 529903 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 10
Probabilistic random walk after 529903 steps, saw 128484 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-06-02 19:13:17] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
// Phase 1: matrix 463 rows 183 cols
[2024-06-02 19:13:17] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:13:17] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 143/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:13:17] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:13:17] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 446/604 variables, 158/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 40/644 variables, 23/188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 68/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/645 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/645 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/646 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 261 constraints, problems are : Problem set: 0 solved, 10 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 183/183 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 143/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 446/604 variables, 158/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 40/644 variables, 23/188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 68/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:13:18] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:13:18] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/644 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/645 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/645 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/645 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/645 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/646 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/646 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 273 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 183/183 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 2128ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 1 properties in 1357 ms.
Support contains 14 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 496/496 transitions.
Applied a total of 0 rules in 24 ms. Remains 183 /183 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 183/183 places, 496/496 transitions.
RANDOM walk for 40000 steps (1307 resets) in 544 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (265 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (266 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (285 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (278 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (266 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (268 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (284 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (261 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (274 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 469941 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 9
Probabilistic random walk after 469941 steps, saw 114319 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2024-06-02 19:13:24] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
[2024-06-02 19:13:24] [INFO ] Invariant cache hit.
[2024-06-02 19:13:24] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 141/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 444/599 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 44/643 variables, 25/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 68/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/644 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/644 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/646 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 259 constraints, problems are : Problem set: 0 solved, 9 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 183/183 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 141/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:13:24] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 444/599 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 44/643 variables, 25/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 68/256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:13:25] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/644 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/644 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/644 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/644 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/646 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/646 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/646 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 270 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 183/183 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 1793ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 1235 ms.
Support contains 14 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 496/496 transitions.
Applied a total of 0 rules in 25 ms. Remains 183 /183 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 183/183 places, 496/496 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 496/496 transitions.
Applied a total of 0 rules in 8 ms. Remains 183 /183 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-06-02 19:13:27] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
[2024-06-02 19:13:27] [INFO ] Invariant cache hit.
[2024-06-02 19:13:27] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-02 19:13:27] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
[2024-06-02 19:13:27] [INFO ] Invariant cache hit.
[2024-06-02 19:13:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 19:13:27] [INFO ] Implicit Places using invariants and state equation in 333 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 616 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/183 places, 496/496 transitions.
Applied a total of 0 rules in 13 ms. Remains 182 /182 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 638 ms. Remains : 182/183 places, 496/496 transitions.
RANDOM walk for 40000 steps (1295 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (286 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (274 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (283 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (282 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (275 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (285 resets) in 36 ms. (1081 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (283 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (262 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (261 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 514547 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 9
Probabilistic random walk after 514547 steps, saw 125286 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2024-06-02 19:13:31] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
// Phase 1: matrix 463 rows 182 cols
[2024-06-02 19:13:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:13:31] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 141/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 444/599 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 43/642 variables, 24/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 68/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/643 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/645 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/645 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/645 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 257 constraints, problems are : Problem set: 0 solved, 9 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 141/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:13:31] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 444/599 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 43/642 variables, 24/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 68/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/643 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/643 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/643 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/643 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/645 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/645 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/645 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 270 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1984ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1388 ms.
Support contains 14 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 496/496 transitions.
Applied a total of 0 rules in 10 ms. Remains 182 /182 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 182/182 places, 496/496 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 496/496 transitions.
Applied a total of 0 rules in 23 ms. Remains 182 /182 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2024-06-02 19:13:34] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
[2024-06-02 19:13:34] [INFO ] Invariant cache hit.
[2024-06-02 19:13:34] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-02 19:13:34] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
[2024-06-02 19:13:34] [INFO ] Invariant cache hit.
[2024-06-02 19:13:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 19:13:35] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-06-02 19:13:35] [INFO ] Redundant transitions in 29 ms returned []
Running 490 sub problems to find dead transitions.
[2024-06-02 19:13:35] [INFO ] Flow matrix only has 463 transitions (discarded 33 similar events)
[2024-06-02 19:13:35] [INFO ] Invariant cache hit.
[2024-06-02 19:13:35] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:13:37] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:13:37] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:13:37] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:13:37] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:13:38] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:13:38] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:13:39] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:13:39] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:13:40] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (OVERLAPS) 463/645 variables, 182/198 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 68/266 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:13:48] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:13:50] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:13:50] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:13:53] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:13:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 271 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (OVERLAPS) 463/645 variables, 182/203 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 68/271 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 490/761 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:14:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:14:12] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 2/763 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-02 19:14:25] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 764 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 17/17 constraints]
After SMT, in 60634ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61248 ms. Remains : 182/182 places, 496/496 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 182 vertex of which 27 / 182 are part of one of the 6 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 130 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 3 place count 160 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 160 transition count 347
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 23 place count 160 transition count 345
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 158 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 158 transition count 344
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 27 place count 157 transition count 344
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 29 place count 156 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 156 transition count 341
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 33 place count 155 transition count 340
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 154 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 154 transition count 286
Free-agglomeration rule applied 8 times with reduction of 4 identical transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 154 transition count 274
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 54 place count 146 transition count 271
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 146 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 146 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 144 transition count 267
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 144 transition count 267
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 144 transition count 267
Applied a total of 66 rules in 52 ms. Remains 144 /182 variables (removed 38) and now considering 267/496 (removed 229) transitions.
Running SMT prover for 9 properties.
[2024-06-02 19:14:35] [INFO ] Flow matrix only has 266 transitions (discarded 1 similar events)
// Phase 1: matrix 266 rows 144 cols
[2024-06-02 19:14:35] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:14:35] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 19:14:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:14:36] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-06-02 19:14:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:14:36] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:14:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2024-06-02 19:14:36] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-06-02 19:14:36] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-06-02 19:14:36] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 852 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-06-02 19:14:36] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:14:36] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:14:36] [INFO ] Input system was already deterministic with 533 transitions.
Computed a total of 59 stabilizing places and 136 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 188 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 182 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 182 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 179 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 179 transition count 476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 176 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 176 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 173 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 173 transition count 461
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 170 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 170 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 167 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 167 transition count 446
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 164 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 164 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 161 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 161 transition count 434
Applied a total of 84 rules in 35 ms. Remains 161 /202 variables (removed 41) and now considering 434/533 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 161/202 places, 434/533 transitions.
[2024-06-02 19:14:36] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:14:36] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:14:36] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 525
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 525
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 198 transition count 524
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 195 transition count 515
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 195 transition count 515
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 192 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 192 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 186 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 186 transition count 494
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 184 transition count 488
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 183 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 183 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 182 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 181 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 181 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 180 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 180 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 179 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 179 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 178 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 178 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 177 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 177 transition count 472
Applied a total of 51 rules in 29 ms. Remains 177 /202 variables (removed 25) and now considering 472/533 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 177/202 places, 472/533 transitions.
[2024-06-02 19:14:36] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 188 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 182 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 182 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 179 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 179 transition count 476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 176 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 176 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 173 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 173 transition count 461
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 170 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 170 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 167 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 167 transition count 446
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 164 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 164 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 161 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 161 transition count 434
Applied a total of 84 rules in 31 ms. Remains 161 /202 variables (removed 41) and now considering 434/533 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 161/202 places, 434/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 525
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 198 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 196 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 196 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 194 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 194 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 192 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 192 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 190 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 186 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 182 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 180 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 176 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 176 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 174 transition count 465
Applied a total of 58 rules in 50 ms. Remains 174 /202 variables (removed 28) and now considering 465/533 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 174/202 places, 465/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 529
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 529
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 193 transition count 519
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 193 transition count 519
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 193 transition count 517
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 508
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 508
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 502
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 184 transition count 493
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 184 transition count 493
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 181 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 181 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 178 transition count 478
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 178 transition count 478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 175 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 175 transition count 472
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 172 transition count 463
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 172 transition count 463
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 169 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 169 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 166 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 166 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 163 transition count 442
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 163 transition count 442
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 160 transition count 436
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 160 transition count 436
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 157 transition count 430
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 157 transition count 430
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 1 with 6 rules applied. Total rules applied 96 place count 154 transition count 427
Applied a total of 96 rules in 118 ms. Remains 154 /202 variables (removed 48) and now considering 427/533 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 124 ms. Remains : 154/202 places, 427/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 188 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 182 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 182 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 179 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 179 transition count 476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 176 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 176 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 174 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 174 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 172 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 172 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 170 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 170 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 168 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 168 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 166 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 166 transition count 445
Applied a total of 74 rules in 31 ms. Remains 166 /202 variables (removed 36) and now considering 445/533 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 166/202 places, 445/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 525
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 198 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 196 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 196 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 194 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 194 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 192 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 192 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 190 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 186 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 186 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 185 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 184 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 183 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 183 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 182 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 181 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 181 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 180 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 180 transition count 479
Applied a total of 46 rules in 33 ms. Remains 180 /202 variables (removed 22) and now considering 479/533 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 180/202 places, 479/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 479 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 188 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 182 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 182 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 179 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 179 transition count 476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 176 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 176 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 173 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 173 transition count 461
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 170 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 170 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 167 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 167 transition count 446
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 164 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 164 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 161 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 161 transition count 434
Applied a total of 84 rules in 23 ms. Remains 161 /202 variables (removed 41) and now considering 434/533 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 161/202 places, 434/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 529
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 529
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 194 transition count 521
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 194 transition count 521
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 194 transition count 519
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 192 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 192 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 190 transition count 509
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 190 transition count 509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 188 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 188 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 186 transition count 499
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 186 transition count 499
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 184 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 184 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 182 transition count 489
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 182 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 180 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 180 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 179 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 179 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 178 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 178 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 177 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 177 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 176 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 176 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 175 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 175 transition count 472
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 172 transition count 469
Applied a total of 60 rules in 85 ms. Remains 172 /202 variables (removed 30) and now considering 469/533 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 172/202 places, 469/533 transitions.
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:37] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 525
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 198 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 196 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 196 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 194 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 194 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 192 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 192 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 190 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 186 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 182 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 180 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 176 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 176 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 174 transition count 465
Applied a total of 58 rules in 33 ms. Remains 174 /202 variables (removed 28) and now considering 465/533 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 174/202 places, 465/533 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:14:38] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 192 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 192 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 190 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 188 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 188 transition count 498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 186 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 186 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 184 transition count 488
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 184 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 182 transition count 482
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 182 transition count 482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 180 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 180 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 178 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 177 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 176 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 176 transition count 468
Applied a total of 54 rules in 31 ms. Remains 176 /202 variables (removed 26) and now considering 468/533 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 176/202 places, 468/533 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:14:38] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 192 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 192 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 190 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 188 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 188 transition count 498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 186 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 186 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 184 transition count 488
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 184 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 182 transition count 482
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 180 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 180 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 177 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 177 transition count 471
Applied a total of 52 rules in 32 ms. Remains 177 /202 variables (removed 25) and now considering 471/533 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 177/202 places, 471/533 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:38] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 197 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 194 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 188 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 188 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 185 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 181 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 181 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 179 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 179 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 177 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 177 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 175 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 175 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 173 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 173 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 171 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 171 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 169 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 169 transition count 453
Applied a total of 68 rules in 32 ms. Remains 169 /202 variables (removed 33) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 169/202 places, 453/533 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:14:38] [INFO ] Input system was already deterministic with 453 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 201 transition count 529
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 198 transition count 529
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 194 transition count 521
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 194 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 194 transition count 520
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 191 transition count 511
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 191 transition count 511
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 188 transition count 505
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 188 transition count 505
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 185 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 185 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 182 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 182 transition count 490
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 179 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 179 transition count 481
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 176 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 176 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 173 transition count 466
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 173 transition count 466
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 170 transition count 460
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 170 transition count 460
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 167 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 167 transition count 451
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 164 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 164 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 161 transition count 439
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 161 transition count 439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 158 transition count 433
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 158 transition count 433
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 1 with 6 rules applied. Total rules applied 93 place count 155 transition count 430
Applied a total of 93 rules in 40 ms. Remains 155 /202 variables (removed 47) and now considering 430/533 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 155/202 places, 430/533 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:14:38] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 533/533 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 525
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 525
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 198 transition count 524
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 195 transition count 515
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 195 transition count 515
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 192 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 192 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 186 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 186 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 183 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 181 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 181 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 179 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 179 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 177 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 177 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 175 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 175 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 173 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 173 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 171 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 171 transition count 457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 170 transition count 455
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 170 transition count 455
Applied a total of 65 rules in 16 ms. Remains 170 /202 variables (removed 32) and now considering 455/533 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 170/202 places, 455/533 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:38] [INFO ] Input system was already deterministic with 455 transitions.
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:38] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:38] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 19:14:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 533 transitions and 1991 arcs took 4 ms.
Total runtime 100322 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-13-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-02
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-04
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-05
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-09
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-11
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-12
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-13
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-14
Could not compute solution for formula : FireWire-PT-13-CTLCardinality-2024-15

BK_STOP 1717355679012

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-13-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/712/ctl_0_
ctl formula name FireWire-PT-13-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/712/ctl_1_
ctl formula name FireWire-PT-13-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/712/ctl_2_
ctl formula name FireWire-PT-13-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/712/ctl_3_
ctl formula name FireWire-PT-13-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/712/ctl_4_
ctl formula name FireWire-PT-13-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/712/ctl_5_
ctl formula name FireWire-PT-13-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/712/ctl_6_
ctl formula name FireWire-PT-13-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/712/ctl_7_
ctl formula name FireWire-PT-13-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/712/ctl_8_
ctl formula name FireWire-PT-13-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/712/ctl_9_
ctl formula name FireWire-PT-13-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/712/ctl_10_
ctl formula name FireWire-PT-13-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/712/ctl_11_
ctl formula name FireWire-PT-13-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/712/ctl_12_
ctl formula name FireWire-PT-13-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/712/ctl_13_
ctl formula name FireWire-PT-13-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/712/ctl_14_
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-13"
export BK_EXAMINATION="CTLCardinality"
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-13, examination is CTLCardinality"
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-171734901300265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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