fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r549-tall-171734898100218
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FireWire-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1004.556 281510.00 426416.00 686.20 FFTTTFFFFFFFTTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366192178

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:09:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:09:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:09:53] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 22:09:53] [INFO ] Transformed 126 places.
[2024-06-02 22:09:53] [INFO ] Transformed 396 transitions.
[2024-06-02 22:09:53] [INFO ] Found NUPN structural information;
[2024-06-02 22:09:53] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 73 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 338
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 11 place count 124 transition count 332
Applied a total of 11 rules in 33 ms. Remains 124 /126 variables (removed 2) and now considering 332/343 (removed 11) transitions.
[2024-06-02 22:09:53] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
// Phase 1: matrix 306 rows 124 cols
[2024-06-02 22:09:53] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 22:09:53] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-02 22:09:53] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 22:09:53] [INFO ] Invariant cache hit.
[2024-06-02 22:09:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:09:54] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-06-02 22:09:54] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 22:09:54] [INFO ] Invariant cache hit.
[2024-06-02 22:09:54] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 12 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 305/429 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 1/430 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (OVERLAPS) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 184 constraints, problems are : Problem set: 0 solved, 331 unsolved in 14001 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 305/429 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 44/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 331/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 1/430 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-06-02 22:10:26] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/430 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 516 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 8/8 constraints]
After SMT, in 44344ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 44361ms
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 332/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44875 ms. Remains : 124/126 places, 332/343 transitions.
Support contains 73 out of 124 places after structural reductions.
[2024-06-02 22:10:38] [INFO ] Flatten gal took : 95 ms
[2024-06-02 22:10:38] [INFO ] Flatten gal took : 63 ms
[2024-06-02 22:10:39] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (2233 resets) in 2623 ms. (15 steps per ms) remains 37/69 properties
BEST_FIRST walk for 4003 steps (20 resets) in 50 ms. (78 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (61 resets) in 58 ms. (67 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (105 resets) in 43 ms. (91 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (142 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (70 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (59 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (102 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (59 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (106 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (111 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (51 resets) in 55 ms. (71 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (91 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (105 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (63 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (56 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (111 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (133 resets) in 22 ms. (174 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (57 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (154 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (52 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
[2024-06-02 22:10:40] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 22:10:40] [INFO ] Invariant cache hit.
[2024-06-02 22:10:40] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/119 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 4/123 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 305/428 variables, 123/131 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 44/175 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/429 variables, 1/176 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 1/430 variables, 1/177 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/430 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 177 constraints, problems are : Problem set: 2 solved, 32 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 78/119 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-02 22:10:42] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-06-02 22:10:42] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:10:42] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2024-06-02 22:10:42] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:10:42] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 4/123 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-02 22:10:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 305/428 variables, 123/137 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 44/181 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 30/211 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/211 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 1/429 variables, 1/212 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 2/214 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-02 22:10:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 1/215 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 0/215 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 1/430 variables, 1/216 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 216 constraints, problems are : Problem set: 2 solved, 32 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/34 constraints, Known Traps: 7/7 constraints]
After SMT, in 6840ms problems are : Problem set: 2 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 332/332 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 124 transition count 329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 122 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 122 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 122 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 121 transition count 322
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 14 place count 119 transition count 326
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 18 place count 119 transition count 322
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 20 place count 119 transition count 320
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 119 transition count 322
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 24 place count 118 transition count 320
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 26 place count 118 transition count 318
Applied a total of 26 rules in 135 ms. Remains 118 /124 variables (removed 6) and now considering 318/332 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 118/124 places, 318/332 transitions.
RANDOM walk for 40000 steps (2152 resets) in 699 ms. (57 steps per ms) remains 27/32 properties
BEST_FIRST walk for 4002 steps (55 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (109 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (136 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (49 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (106 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (56 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (105 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (60 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (106 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (63 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (75 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (107 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (63 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (52 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (109 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (127 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (67 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (149 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (59 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
[2024-06-02 22:10:47] [INFO ] Flow matrix only has 291 transitions (discarded 27 similar events)
// Phase 1: matrix 291 rows 118 cols
[2024-06-02 22:10:47] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:10:47] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 75/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 4/117 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 291/408 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/409 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 171 constraints, problems are : Problem set: 0 solved, 27 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 75/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 22:10:48] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:10:48] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:10:48] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:10:48] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:10:48] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 291/408 variables, 117/130 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 25/200 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/409 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 22:10:50] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-06-02 22:10:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/409 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 206 constraints, problems are : Problem set: 0 solved, 27 unsolved in 4339 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 8/8 constraints]
After SMT, in 5172ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 4 properties in 5000 ms.
Support contains 35 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 318/318 transitions.
Applied a total of 0 rules in 15 ms. Remains 118 /118 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 118/118 places, 318/318 transitions.
RANDOM walk for 40000 steps (2241 resets) in 340 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (95 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (149 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (56 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (102 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (54 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (100 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (60 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (106 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (49 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (105 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (97 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (133 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (51 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (51 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 495940 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :15 out of 23
Probabilistic random walk after 495940 steps, saw 116046 distinct states, run finished after 3004 ms. (steps per millisecond=165 ) properties seen :15
[2024-06-02 22:11:01] [INFO ] Flow matrix only has 291 transitions (discarded 27 similar events)
[2024-06-02 22:11:01] [INFO ] Invariant cache hit.
[2024-06-02 22:11:01] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 24/117 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 291/408 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/409 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/409 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 171 constraints, problems are : Problem set: 0 solved, 8 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 75/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:11:01] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:11:01] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 24/117 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:11:01] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:11:01] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 291/408 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 45/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/409 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 183 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1560ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 8224 ms.
Support contains 18 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 318/318 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 311
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 308
Applied a total of 9 rules in 18 ms. Remains 114 /118 variables (removed 4) and now considering 308/318 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 114/118 places, 308/318 transitions.
RANDOM walk for 40000 steps (2162 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (544 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (535 resets) in 42 ms. (930 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (568 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (68 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1096 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (483 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (554 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 482314 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 8
Probabilistic random walk after 482314 steps, saw 111709 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-02 22:11:14] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 22:11:14] [INFO ] Computed 8 invariants in 8 ms
[2024-06-02 22:11:14] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 281/394 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 44/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 166 constraints, problems are : Problem set: 0 solved, 8 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 73/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:11:14] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:11:14] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 22:11:14] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 281/394 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 44/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/395 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/395 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 177 constraints, problems are : Problem set: 0 solved, 8 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 2926 ms.
Support contains 18 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 308/308 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 114/114 places, 308/308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 308/308 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-02 22:11:18] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 22:11:18] [INFO ] Invariant cache hit.
[2024-06-02 22:11:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:11:18] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 22:11:18] [INFO ] Invariant cache hit.
[2024-06-02 22:11:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 22:11:18] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 22:11:18] [INFO ] Redundant transitions in 13 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 22:11:18] [INFO ] Flow matrix only has 281 transitions (discarded 27 similar events)
[2024-06-02 22:11:18] [INFO ] Invariant cache hit.
[2024-06-02 22:11:18] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:11:20] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2024-06-02 22:11:20] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:11:20] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:11:20] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:11:20] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:11:20] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:11:21] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:11:21] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:11:21] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:11:22] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 281/395 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 176 constraints, problems are : Problem set: 0 solved, 307 unsolved in 10490 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/395 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 483 constraints, problems are : Problem set: 0 solved, 307 unsolved in 14012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 24709ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 24714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24988 ms. Remains : 114/114 places, 308/308 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 77 edges and 114 vertex of which 16 / 114 are part of one of the 3 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 101 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 101 transition count 219
Applied a total of 19 rules in 32 ms. Remains 101 /114 variables (removed 13) and now considering 219/308 (removed 89) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 219 rows 101 cols
[2024-06-02 22:11:43] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:11:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:11:43] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 22:11:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:11:43] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 22:11:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:11:43] [INFO ] After 83ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 22:11:43] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:11:44] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:11:44] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:11:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
TRAPS : Iteration 1
[2024-06-02 22:11:44] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 22:11:44] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 1194 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:11:44] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 21 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Applied a total of 22 rules in 16 ms. Remains 114 /124 variables (removed 10) and now considering 306/332 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 114/124 places, 306/332 transitions.
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:11:44] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 322
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 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
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 1 with 2 rules applied. Total rules applied 26 place count 112 transition count 302
Applied a total of 26 rules in 28 ms. Remains 112 /124 variables (removed 12) and now considering 302/332 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 112/124 places, 302/332 transitions.
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:11:44] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 10 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:11:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:11:45] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
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 1 with 2 rules applied. Total rules applied 24 place count 112 transition count 304
Applied a total of 24 rules in 17 ms. Remains 112 /124 variables (removed 12) and now considering 304/332 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 112/124 places, 304/332 transitions.
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:45] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
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 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 117 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 310
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 1 with 2 rules applied. Total rules applied 19 place count 114 transition count 309
Applied a total of 19 rules in 18 ms. Remains 114 /124 variables (removed 10) and now considering 309/332 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 114/124 places, 309/332 transitions.
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:45] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 106 transition count 288
Applied a total of 38 rules in 33 ms. Remains 106 /124 variables (removed 18) and now considering 288/332 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 106/124 places, 288/332 transitions.
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:45] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 321
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 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 314
Applied a total of 16 rules in 11 ms. Remains 116 /124 variables (removed 8) and now considering 314/332 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 116/124 places, 314/332 transitions.
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:45] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:45] [INFO ] Input system was already deterministic with 314 transitions.
RANDOM walk for 40000 steps (2394 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (583 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1914814 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :0 out of 1
Probabilistic random walk after 1914814 steps, saw 355799 distinct states, run finished after 3002 ms. (steps per millisecond=637 ) properties seen :0
[2024-06-02 22:11:48] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 116 cols
[2024-06-02 22:11:48] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 22:11:48] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/296 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/394 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/395 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/403 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/403 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/296 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/394 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/395 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/403 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/403 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 314/314 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 116 transition count 311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 113 transition count 317
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 113 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 113 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 113 transition count 310
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 2 with 3 rules applied. Total rules applied 22 place count 112 transition count 308
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 24 place count 112 transition count 306
Applied a total of 24 rules in 20 ms. Remains 112 /116 variables (removed 4) and now considering 306/314 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 112/116 places, 306/314 transitions.
RANDOM walk for 4000000 steps (231727 resets) in 6693 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (56968 resets) in 2028 ms. (1971 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3864390 steps, run timeout after 6001 ms. (steps per millisecond=643 ) properties seen :0 out of 1
Probabilistic random walk after 3864390 steps, saw 731868 distinct states, run finished after 6001 ms. (steps per millisecond=643 ) properties seen :0
[2024-06-02 22:11:56] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
// Phase 1: matrix 277 rows 112 cols
[2024-06-02 22:11:56] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:11:56] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/389 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/389 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 22:11:57] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:11:57] [INFO ] Invariant cache hit.
[2024-06-02 22:11:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:11:57] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:11:57] [INFO ] Invariant cache hit.
[2024-06-02 22:11:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:11:57] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-06-02 22:11:57] [INFO ] Redundant transitions in 6 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 22:11:57] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:11:57] [INFO ] Invariant cache hit.
[2024-06-02 22:11:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:12:03] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:12:09] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/389 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 177 constraints, problems are : Problem set: 0 solved, 304 unsolved in 18013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/133 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 481 constraints, problems are : Problem set: 0 solved, 304 unsolved in 18155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
After SMT, in 36346ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 36349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36634 ms. Remains : 112/112 places, 306/306 transitions.
RANDOM walk for 400000 steps (23062 resets) in 1599 ms. (250 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-02 22:12:34] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:12:34] [INFO ] Invariant cache hit.
[2024-06-02 22:12:34] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:12:34] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:12:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:12:34] [INFO ] After 8ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:12:34] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:12:34] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:12:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:12:34] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:12:34] [INFO ] After 17ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:12:34] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:12:34] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (230731 resets) in 6344 ms. (630 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (57188 resets) in 2064 ms. (1937 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4315539 steps, run timeout after 6001 ms. (steps per millisecond=719 ) properties seen :0 out of 1
Probabilistic random walk after 4315539 steps, saw 804901 distinct states, run finished after 6001 ms. (steps per millisecond=719 ) properties seen :0
[2024-06-02 22:12:42] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:12:42] [INFO ] Invariant cache hit.
[2024-06-02 22:12:42] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/389 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/389 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 22:12:43] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:12:43] [INFO ] Invariant cache hit.
[2024-06-02 22:12:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:12:43] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:12:43] [INFO ] Invariant cache hit.
[2024-06-02 22:12:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:12:43] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-02 22:12:43] [INFO ] Redundant transitions in 3 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 22:12:43] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:12:43] [INFO ] Invariant cache hit.
[2024-06-02 22:12:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:12:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:12:55] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/389 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 177 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17756 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/133 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 481 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17841 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
After SMT, in 35823ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 35827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36103 ms. Remains : 112/112 places, 306/306 transitions.
RANDOM walk for 400000 steps (23370 resets) in 999 ms. (400 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-02 22:13:19] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:13:19] [INFO ] Invariant cache hit.
[2024-06-02 22:13:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:13:19] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:13:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:13:19] [INFO ] After 7ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:13:19] [INFO ] After 20ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:13:19] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:13:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:13:19] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:13:19] [INFO ] After 17ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:13:19] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:13:19] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 117 steps (5 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (2271 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (580 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2022723 steps, run timeout after 3001 ms. (steps per millisecond=674 ) properties seen :0 out of 1
Probabilistic random walk after 2022723 steps, saw 412167 distinct states, run finished after 3002 ms. (steps per millisecond=673 ) properties seen :0
[2024-06-02 22:13:22] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:13:22] [INFO ] Invariant cache hit.
[2024-06-02 22:13:22] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/301 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/383 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/389 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/301 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/383 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/389 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 483ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 112/112 places, 306/306 transitions.
RANDOM walk for 40000 steps (2351 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (574 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1949267 steps, run timeout after 3001 ms. (steps per millisecond=649 ) properties seen :0 out of 1
Probabilistic random walk after 1949267 steps, saw 398761 distinct states, run finished after 3003 ms. (steps per millisecond=649 ) properties seen :0
[2024-06-02 22:13:26] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:13:26] [INFO ] Invariant cache hit.
[2024-06-02 22:13:26] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/301 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/383 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/389 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/299 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/301 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/383 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/389 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2024-06-02 22:13:26] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:13:26] [INFO ] Invariant cache hit.
[2024-06-02 22:13:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:13:26] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:13:26] [INFO ] Invariant cache hit.
[2024-06-02 22:13:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:13:27] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-02 22:13:27] [INFO ] Redundant transitions in 2 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 22:13:27] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2024-06-02 22:13:27] [INFO ] Invariant cache hit.
[2024-06-02 22:13:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:13:29] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:13:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:13:29] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:13:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:13:33] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 22:13:38] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/389 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 177 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17909 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/133 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 481 constraints, problems are : Problem set: 0 solved, 304 unsolved in 17754 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 14/14 constraints]
After SMT, in 35836ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 35840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36100 ms. Remains : 112/112 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 86 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 176
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 8 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 85 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 84 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 83 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 83 transition count 146
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 83 transition count 141
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 80 transition count 140
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 80 transition count 140
Applied a total of 22 rules in 31 ms. Remains 80 /112 variables (removed 32) and now considering 140/306 (removed 166) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:14:03] [INFO ] Flow matrix only has 138 transitions (discarded 2 similar events)
// Phase 1: matrix 138 rows 80 cols
[2024-06-02 22:14:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:14:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:14:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:14:03] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:14:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:14:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-06-02 22:14:03] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:14:03] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 86 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 176
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 8 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 85 transition count 174
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 11 place count 84 transition count 173
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 84 transition count 168
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 81 transition count 167
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 81 transition count 167
Applied a total of 20 rules in 27 ms. Remains 81 /112 variables (removed 31) and now considering 167/306 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:14:03] [INFO ] Flow matrix only has 165 transitions (discarded 2 similar events)
// Phase 1: matrix 165 rows 81 cols
[2024-06-02 22:14:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:14:03] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:14:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:14:03] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:14:03] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:14:03] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 153 ms.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 17 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 312
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 1 with 2 rules applied. Total rules applied 18 place count 115 transition count 311
Applied a total of 18 rules in 10 ms. Remains 115 /124 variables (removed 9) and now considering 311/332 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 115/124 places, 311/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Applied a total of 24 rules in 6 ms. Remains 113 /124 variables (removed 11) and now considering 303/332 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/124 places, 303/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 322
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 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 118 transition count 316
Applied a total of 14 rules in 3 ms. Remains 118 /124 variables (removed 6) and now considering 316/332 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 118/124 places, 316/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Applied a total of 36 rules in 10 ms. Remains 107 /124 variables (removed 17) and now considering 289/332 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 107/124 places, 289/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 287
Applied a total of 38 rules in 11 ms. Remains 106 /124 variables (removed 18) and now considering 287/332 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 106/124 places, 287/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 40 place count 104 transition count 285
Applied a total of 40 rules in 23 ms. Remains 104 /124 variables (removed 20) and now considering 285/332 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 104/124 places, 285/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 40 place count 104 transition count 285
Applied a total of 40 rules in 22 ms. Remains 104 /124 variables (removed 20) and now considering 285/332 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 104/124 places, 285/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 324
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 119 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 295
Applied a total of 31 rules in 11 ms. Remains 109 /124 variables (removed 15) and now considering 295/332 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 109/124 places, 295/332 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:14:03] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:14:03] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:14:03] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 22:14:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 332 transitions and 1227 arcs took 5 ms.
Total runtime 250653 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 124
TRANSITIONS: 332
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 981
MODEL NAME: /home/mcc/execution/407/model
124 places, 332 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366473688

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898100218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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