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 |
854.104 | 1051593.00 | 1214928.00 | 2732.20 | FFFFTFFTFTTFFTTF | 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-171734898100219.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100219
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME FireWire-PT-07-LTLCardinality-01
FORMULA_NAME FireWire-PT-07-LTLCardinality-02
FORMULA_NAME FireWire-PT-07-LTLCardinality-03
FORMULA_NAME FireWire-PT-07-LTLCardinality-04
FORMULA_NAME FireWire-PT-07-LTLCardinality-05
FORMULA_NAME FireWire-PT-07-LTLCardinality-06
FORMULA_NAME FireWire-PT-07-LTLCardinality-07
FORMULA_NAME FireWire-PT-07-LTLCardinality-08
FORMULA_NAME FireWire-PT-07-LTLCardinality-09
FORMULA_NAME FireWire-PT-07-LTLCardinality-10
FORMULA_NAME FireWire-PT-07-LTLCardinality-11
FORMULA_NAME FireWire-PT-07-LTLCardinality-12
FORMULA_NAME FireWire-PT-07-LTLCardinality-13
FORMULA_NAME FireWire-PT-07-LTLCardinality-14
FORMULA_NAME FireWire-PT-07-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717366215147
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
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:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:10:16] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 22:10:16] [INFO ] Transformed 126 places.
[2024-06-02 22:10:16] [INFO ] Transformed 396 transitions.
[2024-06-02 22:10:16] [INFO ] Found NUPN structural information;
[2024-06-02 22:10:16] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 331
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 121 transition count 329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 119 transition count 325
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 119 transition count 325
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 22 place count 119 transition count 319
Applied a total of 22 rules in 46 ms. Remains 119 /126 variables (removed 7) and now considering 319/343 (removed 24) transitions.
[2024-06-02 22:10:16] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
// Phase 1: matrix 293 rows 119 cols
[2024-06-02 22:10:16] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 22:10:16] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-02 22:10:16] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 22:10:16] [INFO ] Invariant cache hit.
[2024-06-02 22:10:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:10:17] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-06-02 22:10:17] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 22:10:17] [INFO ] Invariant cache hit.
[2024-06-02 22:10:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 22:10:19] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 12 ms to minimize.
[2024-06-02 22:10:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:10:19] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:10:19] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:10:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 22:10:20] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 292/411 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/412 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 180 constraints, problems are : Problem set: 0 solved, 318 unsolved in 11285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 292/411 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 318/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/412 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 498 constraints, problems are : Problem set: 0 solved, 318 unsolved in 26411 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 10/10 constraints]
After SMT, in 38000ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 38020ms
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 319/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38535 ms. Remains : 119/126 places, 319/343 transitions.
Support contains 41 out of 119 places after structural reductions.
[2024-06-02 22:10:55] [INFO ] Flatten gal took : 51 ms
[2024-06-02 22:10:55] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:10:55] [INFO ] Input system was already deterministic with 319 transitions.
RANDOM walk for 40000 steps (2242 resets) in 1624 ms. (24 steps per ms) remains 13/26 properties
BEST_FIRST walk for 40003 steps (611 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (623 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (580 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (795 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (587 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (603 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (569 resets) in 120 ms. (330 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40003 steps (703 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (563 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (519 resets) in 64 ms. (615 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (477 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
[2024-06-02 22:10:56] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 22:10:56] [INFO ] Invariant cache hit.
[2024-06-02 22:10:56] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 97/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/117 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 292/409 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 42/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/411 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/412 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/412 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 170 constraints, problems are : Problem set: 0 solved, 10 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 97/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:10:57] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:10:57] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 13 ms to minimize.
[2024-06-02 22:10:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:10:57] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 292/409 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/411 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/412 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/412 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 184 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 1747ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 2 properties in 2465 ms.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 319/319 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 119 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 117 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 311
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 117 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 116 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 116 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 114 transition count 312
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 114 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 20 place count 114 transition count 306
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 114 transition count 308
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 113 transition count 306
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 113 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 112 transition count 303
Applied a total of 27 rules in 85 ms. Remains 112 /119 variables (removed 7) and now considering 303/319 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 112/119 places, 303/319 transitions.
RANDOM walk for 40000 steps (2242 resets) in 418 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (565 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (754 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (650 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (702 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (523 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (501 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (480 resets) in 35 ms. (1111 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 751990 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :3 out of 8
Probabilistic random walk after 751990 steps, saw 163231 distinct states, run finished after 3005 ms. (steps per millisecond=250 ) properties seen :3
[2024-06-02 22:11:04] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
// Phase 1: matrix 276 rows 112 cols
[2024-06-02 22:11:04] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:11:04] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 274/380 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/388 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 162 constraints, problems are : Problem set: 0 solved, 5 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:11:04] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:11:04] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 274/380 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 22:11:04] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 8/388 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 170 constraints, problems are : Problem set: 0 solved, 5 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1015 ms.
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 112/112 places, 303/303 transitions.
RANDOM walk for 40000 steps (2357 resets) in 581 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (611 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (720 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (638 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (549 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 804300 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :1 out of 5
Probabilistic random walk after 804300 steps, saw 177265 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :1
[2024-06-02 22:11:09] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 22:11:09] [INFO ] Invariant cache hit.
[2024-06-02 22:11:09] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 251/336 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 49/385 variables, 25/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/388 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:11:09] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 251/336 variables, 85/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 49/385 variables, 25/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/388 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:11:09] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:11:10] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:11:10] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 170 constraints, problems are : Problem set: 0 solved, 4 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1109 ms.
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 112/112 places, 303/303 transitions.
RANDOM walk for 40000 steps (2319 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (557 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (756 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (667 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (541 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 718150 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 4
Probabilistic random walk after 718150 steps, saw 156809 distinct states, run finished after 3002 ms. (steps per millisecond=239 ) properties seen :0
[2024-06-02 22:11:14] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 22:11:14] [INFO ] Invariant cache hit.
[2024-06-02 22:11:14] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 251/336 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 49/385 variables, 25/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/388 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/388 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:11:14] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 251/336 variables, 85/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 49/385 variables, 25/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/388 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 22:11:15] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:11:15] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:11:15] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 170 constraints, problems are : Problem set: 0 solved, 4 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1183 ms.
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 28 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 112/112 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-06-02 22:11:16] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 22:11:16] [INFO ] Invariant cache hit.
[2024-06-02 22:11:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:11:16] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 22:11:16] [INFO ] Invariant cache hit.
[2024-06-02 22:11:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:11:16] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 22:11:16] [INFO ] Redundant transitions in 18 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-02 22:11:16] [INFO ] Flow matrix only has 276 transitions (discarded 27 similar events)
[2024-06-02 22:11:16] [INFO ] Invariant cache hit.
[2024-06-02 22:11:16] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 22:11:17] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:11:17] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:11:17] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:11:18] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:11:18] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:11:18] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:11:18] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:11:18] [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, 8/16 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 22:11:19] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 276/387 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 42/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 22:11:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
[2024-06-02 22:11:23] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 22:11:30] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/388 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 301 unsolved in 19756 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 276/387 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 301/474 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 475 constraints, problems are : Problem set: 0 solved, 301 unsolved in 17678 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 12/12 constraints]
After SMT, in 37636ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 37640ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37902 ms. Remains : 112/112 places, 303/303 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 95 edges and 112 vertex of which 26 / 112 are part of one of the 3 SCC in 3 ms
Free SCC test removed 23 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 111 transitions.
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 3 place count 88 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 88 transition count 184
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 12 place count 87 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 87 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 86 transition count 182
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 86 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 86 transition count 181
Applied a total of 16 rules in 42 ms. Remains 86 /112 variables (removed 26) and now considering 181/303 (removed 122) transitions.
Running SMT prover for 4 properties.
[2024-06-02 22:11:54] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
// Phase 1: matrix 179 rows 86 cols
[2024-06-02 22:11:54] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 22:11:54] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:11:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:11:54] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 22:11:54] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2024-06-02 22:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-02 22:11:54] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 1
[2024-06-02 22:11:54] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 22:11:55] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 550 ms.
Computed a total of 21 stabilizing places and 45 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(p1 U G(p2))))'
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 315
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 5 place count 116 transition count 314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 114 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 114 transition count 314
Applied a total of 13 rules in 35 ms. Remains 114 /119 variables (removed 5) and now considering 314/319 (removed 5) transitions.
[2024-06-02 22:11:55] [INFO ] Flow matrix only has 284 transitions (discarded 30 similar events)
// Phase 1: matrix 284 rows 114 cols
[2024-06-02 22:11:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:11:56] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-02 22:11:56] [INFO ] Flow matrix only has 284 transitions (discarded 30 similar events)
[2024-06-02 22:11:56] [INFO ] Invariant cache hit.
[2024-06-02 22:11:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:11:56] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-06-02 22:11:56] [INFO ] Redundant transitions in 4 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-02 22:11:56] [INFO ] Flow matrix only has 284 transitions (discarded 30 similar events)
[2024-06-02 22:11:56] [INFO ] Invariant cache hit.
[2024-06-02 22:11:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:11:57] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 15 places in 549 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:11:58] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:11:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 283/396 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 43/174 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:12:02] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/398 variables, and 176 constraints, problems are : Problem set: 0 solved, 311 unsolved in 15599 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 283/396 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 43/175 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 311/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:12:21] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:12:31] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/397 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/398 variables, and 489 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 13/13 constraints]
After SMT, in 45819ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 45822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/119 places, 314/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46639 ms. Remains : 114/119 places, 314/319 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-00 finished in 47215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(G(p1)))))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Applied a total of 27 rules in 21 ms. Remains 106 /119 variables (removed 13) and now considering 287/319 (removed 32) transitions.
[2024-06-02 22:12:42] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 22:12:42] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:12:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:12:42] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:12:42] [INFO ] Invariant cache hit.
[2024-06-02 22:12:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:12:42] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 22:12:42] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:12:42] [INFO ] Invariant cache hit.
[2024-06-02 22:12:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:12:44] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:12:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10523 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32834ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32836ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 287/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33064 ms. Remains : 106/119 places, 287/319 transitions.
Stuttering acceptance computed with spot in 250 ms :[p0, p0, p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Detected a total of 9/106 stabilizing places and 16/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be false thanks to negative knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-01 finished in 33690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 313
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 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 310
Iterating global reduction 1 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 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 110 transition count 297
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 109 transition count 296
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 25 place count 106 transition count 302
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 31 place count 106 transition count 296
Applied a total of 31 rules in 30 ms. Remains 106 /119 variables (removed 13) and now considering 296/319 (removed 23) transitions.
[2024-06-02 22:13:16] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
// Phase 1: matrix 263 rows 106 cols
[2024-06-02 22:13:16] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:13:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:13:16] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:13:16] [INFO ] Invariant cache hit.
[2024-06-02 22:13:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:13:16] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 22:13:16] [INFO ] Redundant transitions in 4 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 22:13:16] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:13:16] [INFO ] Invariant cache hit.
[2024-06-02 22:13:16] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:13:17] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:13:17] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-06-02 22:13:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:13:17] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:13:17] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:13:18] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:13:18] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:13:18] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:13:18] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:13:18] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 163 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11796 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 293/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:13:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:13:49] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/368 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 458 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 41966ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41970ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/119 places, 296/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42203 ms. Remains : 106/119 places, 296/319 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 1 reset in 84 ms.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (2326 resets) in 89 ms. (444 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-06-02 22:13:59] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:13:59] [INFO ] Invariant cache hit.
[2024-06-02 22:13:59] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/257 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/322 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 28/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/365 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/368 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:13:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 191/257 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/322 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 42/365 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 11/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/368 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/369 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 283
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 1 with 3 rules applied. Total rules applied 18 place count 101 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 101 transition count 279
Applied a total of 20 rules in 30 ms. Remains 101 /106 variables (removed 5) and now considering 279/296 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 101/106 places, 279/296 transitions.
RANDOM walk for 40000 steps (2244 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 660105 steps, run visited all 1 properties in 1033 ms. (steps per millisecond=639 )
Probabilistic random walk after 660105 steps, saw 146375 distinct states, run finished after 1039 ms. (steps per millisecond=635 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-02 22:14:00] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:00] [INFO ] Invariant cache hit.
[2024-06-02 22:14:00] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 22:14:00] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:00] [INFO ] Invariant cache hit.
[2024-06-02 22:14:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:14:01] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 22:14:01] [INFO ] Redundant transitions in 3 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 22:14:01] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:01] [INFO ] Invariant cache hit.
[2024-06-02 22:14:01] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:14:02] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:14:03] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 163 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11685 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 293/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:14:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:14:34] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/368 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 458 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 41877ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41880ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42162 ms. Remains : 106/106 places, 296/296 transitions.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (2307 resets) in 161 ms. (246 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-06-02 22:14:43] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:43] [INFO ] Invariant cache hit.
[2024-06-02 22:14:43] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/257 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/322 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 28/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/365 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/368 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:14:43] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 191/257 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/322 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/323 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 42/365 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 11/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/368 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/369 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 283
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 1 with 3 rules applied. Total rules applied 18 place count 101 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 101 transition count 279
Applied a total of 20 rules in 19 ms. Remains 101 /106 variables (removed 5) and now considering 279/296 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 101/106 places, 279/296 transitions.
RANDOM walk for 40000 steps (2353 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 660105 steps, run visited all 1 properties in 1002 ms. (steps per millisecond=658 )
Probabilistic random walk after 660105 steps, saw 146375 distinct states, run finished after 1002 ms. (steps per millisecond=658 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-02 22:14:45] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:45] [INFO ] Invariant cache hit.
[2024-06-02 22:14:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:14:45] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:45] [INFO ] Invariant cache hit.
[2024-06-02 22:14:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:14:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 22:14:45] [INFO ] Redundant transitions in 2 ms returned []
Running 293 sub problems to find dead transitions.
[2024-06-02 22:14:45] [INFO ] Flow matrix only has 263 transitions (discarded 33 similar events)
[2024-06-02 22:14:45] [INFO ] Invariant cache hit.
[2024-06-02 22:14:45] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:14:46] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:14:47] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:14:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:14:47] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/369 variables, and 163 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11909 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 293/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:15:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-06-02 22:15:18] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/368 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 458 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 12/12 constraints]
After SMT, in 42094ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 42098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42324 ms. Remains : 106/106 places, 296/296 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-02 finished in 131226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Applied a total of 9 rules in 4 ms. Remains 115 /119 variables (removed 4) and now considering 308/319 (removed 11) transitions.
[2024-06-02 22:15:27] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 22:15:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:15:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:15:27] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 22:15:27] [INFO ] Invariant cache hit.
[2024-06-02 22:15:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:15:27] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 22:15:27] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 22:15:27] [INFO ] Invariant cache hit.
[2024-06-02 22:15:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:15:29] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:15:29] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:15:29] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:15:29] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:15:29] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:15:29] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:15:30] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:15:30] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:15:30] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:15:30] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 174 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11978 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 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/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 481 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 42179ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 42183ms
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 308/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42423 ms. Remains : 115/119 places, 308/319 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-03 finished in 42654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))||p0)))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 117 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 116 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 116 transition count 311
Applied a total of 6 rules in 4 ms. Remains 116 /119 variables (removed 3) and now considering 311/319 (removed 8) transitions.
[2024-06-02 22:16:10] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 116 cols
[2024-06-02 22:16:10] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:16:10] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:16:10] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 22:16:10] [INFO ] Invariant cache hit.
[2024-06-02 22:16:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:16:10] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-06-02 22:16:10] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 22:16:10] [INFO ] Invariant cache hit.
[2024-06-02 22:16:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 172 constraints, problems are : Problem set: 0 solved, 310 unsolved in 12329 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 310/481 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 482 constraints, problems are : Problem set: 0 solved, 310 unsolved in 25486 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints]
After SMT, in 37983ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 37987ms
Starting structural reductions in LTL mode, iteration 1 : 116/119 places, 311/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38244 ms. Remains : 116/119 places, 311/319 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Computed a total of 18 stabilizing places and 37 stable transitions
Computed a total of 18 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-04 finished in 38718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 313
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 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 310
Iterating global reduction 1 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 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 109 transition count 295
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 21 place count 108 transition count 294
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 27 place count 105 transition count 300
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 33 place count 105 transition count 294
Applied a total of 33 rules in 25 ms. Remains 105 /119 variables (removed 14) and now considering 294/319 (removed 25) transitions.
[2024-06-02 22:16:48] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 22:16:48] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:16:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:16:48] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:16:48] [INFO ] Invariant cache hit.
[2024-06-02 22:16:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:16:49] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-06-02 22:16:49] [INFO ] Redundant transitions in 3 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-02 22:16:49] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:16:49] [INFO ] Invariant cache hit.
[2024-06-02 22:16:49] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:16:50] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:16:53] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:16:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 13016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:17:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:17:11] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 26715 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 39881ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 39884ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/119 places, 294/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40161 ms. Remains : 105/119 places, 294/319 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2308 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (747 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1936025 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :0 out of 1
Probabilistic random walk after 1936025 steps, saw 366944 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
[2024-06-02 22:17:32] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:17:32] [INFO ] Invariant cache hit.
[2024-06-02 22:17:32] [INFO ] State equation strengthened by 39 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/365 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/365 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 290
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 1 with 3 rules applied. Total rules applied 10 place count 104 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 104 transition count 286
Applied a total of 12 rules in 13 ms. Remains 104 /105 variables (removed 1) and now considering 286/294 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 104/105 places, 286/294 transitions.
RANDOM walk for 40000 steps (2284 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (797 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1834131 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :0 out of 1
Probabilistic random walk after 1834131 steps, saw 379458 distinct states, run finished after 3001 ms. (steps per millisecond=611 ) properties seen :0
[2024-06-02 22:17:35] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
// Phase 1: matrix 257 rows 104 cols
[2024-06-02 22:17:35] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:17:35] [INFO ] State equation strengthened by 39 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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/361 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/361 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 22:17:36] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 22:17:36] [INFO ] Invariant cache hit.
[2024-06-02 22:17:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:17:36] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 22:17:36] [INFO ] Invariant cache hit.
[2024-06-02 22:17:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:17:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 22:17:36] [INFO ] Redundant transitions in 1 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 22:17:36] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 22:17:36] [INFO ] Invariant cache hit.
[2024-06-02 22:17:36] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:17:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:17:40] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:17:41] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 160 constraints, problems are : Problem set: 0 solved, 284 unsolved in 12942 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 284/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 444 constraints, problems are : Problem set: 0 solved, 284 unsolved in 14422 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
After SMT, in 27532ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 27536ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27744 ms. Remains : 104/104 places, 286/286 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 104 vertex of which 27 / 104 are part of one of the 3 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 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 79 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 79 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 79 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 78 transition count 162
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 78 transition count 161
Applied a total of 13 rules in 21 ms. Remains 78 /104 variables (removed 26) and now considering 161/286 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:18:03] [INFO ] Flow matrix only has 159 transitions (discarded 2 similar events)
// Phase 1: matrix 159 rows 78 cols
[2024-06-02 22:18:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:18:03] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:18:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:18: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:18:03] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:18:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2024-06-02 22:18:03] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:18:04] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 193 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 294/294 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-02 22:18:04] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 22:18:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:18:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:18:04] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:18:04] [INFO ] Invariant cache hit.
[2024-06-02 22:18:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:18:04] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 22:18:04] [INFO ] Redundant transitions in 1 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-02 22:18:04] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:18:04] [INFO ] Invariant cache hit.
[2024-06-02 22:18:04] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 2 ms to minimize.
[2024-06-02 22:18:05] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:18:06] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:18:08] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:18:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 13370 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:18:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:18:26] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 26618 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 40169ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 40172ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40403 ms. Remains : 105/105 places, 294/294 transitions.
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2298 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (750 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1979110 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :0 out of 1
Probabilistic random walk after 1979110 steps, saw 373984 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :0
[2024-06-02 22:18:47] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:18:47] [INFO ] Invariant cache hit.
[2024-06-02 22:18:47] [INFO ] State equation strengthened by 39 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/365 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/264 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/356 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/365 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 290
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 1 with 3 rules applied. Total rules applied 10 place count 104 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 104 transition count 286
Applied a total of 12 rules in 9 ms. Remains 104 /105 variables (removed 1) and now considering 286/294 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 104/105 places, 286/294 transitions.
RANDOM walk for 40000 steps (2293 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (723 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1889266 steps, run timeout after 3001 ms. (steps per millisecond=629 ) properties seen :0 out of 1
Probabilistic random walk after 1889266 steps, saw 387987 distinct states, run finished after 3001 ms. (steps per millisecond=629 ) properties seen :0
[2024-06-02 22:18:51] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
// Phase 1: matrix 257 rows 104 cols
[2024-06-02 22:18:51] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:18:51] [INFO ] State equation strengthened by 39 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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/361 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/361 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/260 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/352 variables, 42/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/353 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/361 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 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 6 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 286/286 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 22:18:51] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 22:18:51] [INFO ] Invariant cache hit.
[2024-06-02 22:18:51] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:18:51] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 22:18:51] [INFO ] Invariant cache hit.
[2024-06-02 22:18:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:18:51] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 22:18:51] [INFO ] Redundant transitions in 1 ms returned []
Running 284 sub problems to find dead transitions.
[2024-06-02 22:18:51] [INFO ] Flow matrix only has 257 transitions (discarded 29 similar events)
[2024-06-02 22:18:51] [INFO ] Invariant cache hit.
[2024-06-02 22:18:51] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:18:52] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:18:52] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:18:52] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:18:53] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 22:18:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:18:57] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 160 constraints, problems are : Problem set: 0 solved, 284 unsolved in 12885 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 284/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/361 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 444 constraints, problems are : Problem set: 0 solved, 284 unsolved in 14319 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
After SMT, in 27379ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 27381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27652 ms. Remains : 104/104 places, 286/286 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 104 vertex of which 27 / 104 are part of one of the 3 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 116 transitions.
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 3 place count 79 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 79 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 79 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 78 transition count 162
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 78 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 78 transition count 161
Applied a total of 13 rules in 12 ms. Remains 78 /104 variables (removed 26) and now considering 161/286 (removed 125) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:19:19] [INFO ] Flow matrix only has 159 transitions (discarded 2 similar events)
// Phase 1: matrix 159 rows 78 cols
[2024-06-02 22:19:19] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:19:19] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:19:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:19:19] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:19:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-02 22:19:19] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:19:19] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 174 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 53 ms.
Product exploration explored 100000 steps with 1 reset in 50 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-06-02 22:19:19] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
// Phase 1: matrix 261 rows 105 cols
[2024-06-02 22:19:19] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:19:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:19:19] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:19:19] [INFO ] Invariant cache hit.
[2024-06-02 22:19:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:19:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 22:19:20] [INFO ] Redundant transitions in 2 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-02 22:19:20] [INFO ] Flow matrix only has 261 transitions (discarded 33 similar events)
[2024-06-02 22:19:20] [INFO ] Invariant cache hit.
[2024-06-02 22:19:20] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:19:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:19:24] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:19:25] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 13142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:19:36] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 22:19:42] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 454 constraints, problems are : Problem set: 0 solved, 291 unsolved in 27283 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 11/11 constraints]
After SMT, in 40593ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 40597ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40830 ms. Remains : 105/105 places, 294/294 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-05 finished in 191786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 313
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 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 115 transition count 310
Iterating global reduction 1 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 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 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 29 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 101 transition count 291
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 41 place count 101 transition count 285
Applied a total of 41 rules in 47 ms. Remains 101 /119 variables (removed 18) and now considering 285/319 (removed 34) transitions.
[2024-06-02 22:20:00] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
// Phase 1: matrix 252 rows 101 cols
[2024-06-02 22:20:00] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:20:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:20:00] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:00] [INFO ] Invariant cache hit.
[2024-06-02 22:20:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:20:00] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 22:20:00] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 22:20:00] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:00] [INFO ] Invariant cache hit.
[2024-06-02 22:20:00] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 22:20:01] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:20:01] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:20:02] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 159 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12585 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
After SMT, in 22344ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 22347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/119 places, 285/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22619 ms. Remains : 101/119 places, 285/319 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-06
Product exploration explored 100000 steps with 1 reset in 43 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 3418 steps (186 resets) in 12 ms. (262 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 285/285 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 22:20:23] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:23] [INFO ] Invariant cache hit.
[2024-06-02 22:20:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:20:23] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:23] [INFO ] Invariant cache hit.
[2024-06-02 22:20:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:20:24] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 22:20:24] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 22:20:24] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:24] [INFO ] Invariant cache hit.
[2024-06-02 22:20:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 22:20:24] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:20:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:20:26] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:20:26] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 159 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 12528 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
After SMT, in 22429ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 22432ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22655 ms. Remains : 101/101 places, 285/285 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 7689 steps (425 resets) in 26 ms. (284 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 41 ms.
Product exploration explored 100000 steps with 1 reset in 47 ms.
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 285/285 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 22:20:47] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:47] [INFO ] Invariant cache hit.
[2024-06-02 22:20:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:20:47] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:47] [INFO ] Invariant cache hit.
[2024-06-02 22:20:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:20:47] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 22:20:47] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 22:20:47] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 22:20:47] [INFO ] Invariant cache hit.
[2024-06-02 22:20:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:20:48] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:20:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 159 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9631 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 441 constraints, problems are : Problem set: 0 solved, 282 unsolved in 13322 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 12/12 constraints]
After SMT, in 23096ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 23100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23331 ms. Remains : 101/101 places, 285/285 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-06 finished in 69846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p0)||G(p1))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Applied a total of 9 rules in 5 ms. Remains 115 /119 variables (removed 4) and now considering 308/319 (removed 11) transitions.
[2024-06-02 22:21:10] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 22:21:10] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:21:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:21:10] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 22:21:10] [INFO ] Invariant cache hit.
[2024-06-02 22:21:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:21:10] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 22:21:10] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 22:21:10] [INFO ] Invariant cache hit.
[2024-06-02 22:21:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:21:12] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:21:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:21:12] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:21:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:21:12] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:21:12] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:21:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 174 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11941 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 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/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 481 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 42111ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 42114ms
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 308/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42358 ms. Remains : 115/119 places, 308/319 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 18 stabilizing places and 37 stable transitions
Computed a total of 18 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-07 finished in 42864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Applied a total of 15 rules in 8 ms. Remains 112 /119 variables (removed 7) and now considering 301/319 (removed 18) transitions.
[2024-06-02 22:21:53] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 112 cols
[2024-06-02 22:21:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:21:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:21:53] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 22:21:53] [INFO ] Invariant cache hit.
[2024-06-02 22:21:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:21:53] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-02 22:21:53] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2024-06-02 22:21:53] [INFO ] Invariant cache hit.
[2024-06-02 22:21:53] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:21:55] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:21:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:21:56] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:21:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:21:56] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:21:56] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:21:56] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/386 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 172 constraints, problems are : Problem set: 0 solved, 300 unsolved in 11942 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/386 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 300/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 472 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20925 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 12/12 constraints]
After SMT, in 33049ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 33052ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 301/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33294 ms. Remains : 112/119 places, 301/319 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-08 finished in 33414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(F(p2))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Applied a total of 9 rules in 5 ms. Remains 115 /119 variables (removed 4) and now considering 308/319 (removed 11) transitions.
[2024-06-02 22:22:26] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 22:22:26] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:22:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:22:26] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 22:22:26] [INFO ] Invariant cache hit.
[2024-06-02 22:22:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:22:27] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 22:22:27] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 22:22:27] [INFO ] Invariant cache hit.
[2024-06-02 22:22:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 22:22:28] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:22:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:22:28] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 0 ms to minimize.
[2024-06-02 22:22:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-02 22:22:28] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:22:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 174 constraints, problems are : Problem set: 0 solved, 307 unsolved in 12077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 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/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 481 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 42265ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 42269ms
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 308/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42555 ms. Remains : 115/119 places, 308/319 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 18 stabilizing places and 37 stable transitions
Computed a total of 18 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-09 finished in 42995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Applied a total of 27 rules in 11 ms. Remains 106 /119 variables (removed 13) and now considering 287/319 (removed 32) transitions.
[2024-06-02 22:23:09] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 22:23:09] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:23:09] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:23:09] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:23:09] [INFO ] Invariant cache hit.
[2024-06-02 22:23:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:23:10] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 22:23:10] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:23:10] [INFO ] Invariant cache hit.
[2024-06-02 22:23:10] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:23:12] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10562 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21771 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 32488ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 32491ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 287/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32833 ms. Remains : 106/119 places, 287/319 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-11
Product exploration explored 100000 steps with 4 reset in 46 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (2149 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (612 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1969074 steps, run timeout after 3001 ms. (steps per millisecond=656 ) properties seen :0 out of 1
Probabilistic random walk after 1969074 steps, saw 365165 distinct states, run finished after 3001 ms. (steps per millisecond=656 ) properties seen :0
[2024-06-02 22:23:46] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:23:46] [INFO ] Invariant cache hit.
[2024-06-02 22:23:46] [INFO ] State equation strengthened by 38 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 260/364 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 37/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:23:46] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:23:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/364 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/366 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/367 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 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 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 104 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 104 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 104 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 104 transition count 284
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 17 place count 103 transition count 282
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 19 place count 103 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 102 transition count 279
Applied a total of 20 rules in 18 ms. Remains 102 /106 variables (removed 4) and now considering 279/287 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 102/106 places, 279/287 transitions.
RANDOM walk for 40000 steps (2259 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (677 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1894283 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :0 out of 1
Probabilistic random walk after 1894283 steps, saw 390587 distinct states, run finished after 3001 ms. (steps per millisecond=631 ) properties seen :0
[2024-06-02 22:23:49] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 22:23:49] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:23:49] [INFO ] State equation strengthened by 38 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) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/351 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 21/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/354 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 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) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/351 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 21/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/354 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 22:23:49] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 22:23:49] [INFO ] Invariant cache hit.
[2024-06-02 22:23:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:23:49] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 22:23:49] [INFO ] Invariant cache hit.
[2024-06-02 22:23:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:23:50] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 22:23:50] [INFO ] Redundant transitions in 2 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 22:23:50] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 22:23:50] [INFO ] Invariant cache hit.
[2024-06-02 22:23:50] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:23:50] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 5 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 5 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:23:51] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:23:54] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:23:55] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:23:56] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 163 constraints, problems are : Problem set: 0 solved, 277 unsolved in 14283 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 277/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 440 constraints, problems are : Problem set: 0 solved, 277 unsolved in 16099 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
After SMT, in 30538ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 30542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30767 ms. Remains : 102/102 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 102 vertex of which 28 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 122 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 77 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 77 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 77 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 76 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 75 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 75 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 74 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 73 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 73 transition count 126
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 121
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 70 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 70 transition count 120
Applied a total of 26 rules in 17 ms. Remains 70 /102 variables (removed 32) and now considering 120/279 (removed 159) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:24:20] [INFO ] Flow matrix only has 118 transitions (discarded 2 similar events)
// Phase 1: matrix 118 rows 70 cols
[2024-06-02 22:24:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:24:20] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:24:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:24:20] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:24:20] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2024-06-02 22:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 1
[2024-06-02 22:24:20] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:24:20] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Support contains 2 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 287/287 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 22:24:21] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 22:24:21] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:24:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:24:21] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:24:21] [INFO ] Invariant cache hit.
[2024-06-02 22:24:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:24:21] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-06-02 22:24:21] [INFO ] Redundant transitions in 1 ms returned []
Running 286 sub problems to find dead transitions.
[2024-06-02 22:24:21] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:24:21] [INFO ] Invariant cache hit.
[2024-06-02 22:24:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 22:24:22] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:24:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:24:22] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:24:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22408 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 33144ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 33147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33425 ms. Remains : 106/106 places, 287/287 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (2139 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (619 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2002847 steps, run timeout after 3001 ms. (steps per millisecond=667 ) properties seen :0 out of 1
Probabilistic random walk after 2002847 steps, saw 371092 distinct states, run finished after 3001 ms. (steps per millisecond=667 ) properties seen :0
[2024-06-02 22:24:57] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:24:57] [INFO ] Invariant cache hit.
[2024-06-02 22:24:57] [INFO ] State equation strengthened by 38 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 260/364 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 37/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/367 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/367 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:24:57] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:24:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/364 variables, 104/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/366 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/367 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 287/287 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 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 104 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 104 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 104 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 104 transition count 284
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 17 place count 103 transition count 282
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 19 place count 103 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 102 transition count 279
Applied a total of 20 rules in 19 ms. Remains 102 /106 variables (removed 4) and now considering 279/287 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 102/106 places, 279/287 transitions.
RANDOM walk for 40000 steps (2308 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (682 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1897036 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :0 out of 1
Probabilistic random walk after 1897036 steps, saw 390743 distinct states, run finished after 3001 ms. (steps per millisecond=632 ) properties seen :0
[2024-06-02 22:25:01] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 22:25:01] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:25:01] [INFO ] State equation strengthened by 38 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) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/351 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 21/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/354 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 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) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/97 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/266 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/300 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/351 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 21/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/354 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/354 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 279/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 22:25:01] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 22:25:01] [INFO ] Invariant cache hit.
[2024-06-02 22:25:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:25:01] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 22:25:01] [INFO ] Invariant cache hit.
[2024-06-02 22:25:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:25:01] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 22:25:01] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 22:25:01] [INFO ] Flow matrix only has 252 transitions (discarded 27 similar events)
[2024-06-02 22:25:01] [INFO ] Invariant cache hit.
[2024-06-02 22:25:01] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:25:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:25:03] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:25:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/118 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:25:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:25:05] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 22:25:07] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:25:07] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:25:07] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:25:07] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 163 constraints, problems are : Problem set: 0 solved, 277 unsolved in 14059 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 277/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 440 constraints, problems are : Problem set: 0 solved, 277 unsolved in 16143 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 15/15 constraints]
After SMT, in 30366ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 30370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30585 ms. Remains : 102/102 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 101 edges and 102 vertex of which 28 / 102 are part of one of the 4 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 122 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 77 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 77 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 77 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 76 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 75 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 75 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 74 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 73 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 73 transition count 126
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 121
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 70 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 70 transition count 120
Applied a total of 26 rules in 11 ms. Remains 70 /102 variables (removed 32) and now considering 120/279 (removed 159) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:25:31] [INFO ] Flow matrix only has 118 transitions (discarded 2 similar events)
// Phase 1: matrix 118 rows 70 cols
[2024-06-02 22:25:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:25:32] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:25:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:25:32] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:25:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-02 22:25:32] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:25:32] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 155 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 103 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 transition count 286
Applied a total of 8 rules in 7 ms. Remains 103 /106 variables (removed 3) and now considering 286/287 (removed 1) transitions.
[2024-06-02 22:25:32] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 22:25:32] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:25:32] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:25:32] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 22:25:32] [INFO ] Invariant cache hit.
[2024-06-02 22:25:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:25:32] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-06-02 22:25:32] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:25:32] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 22:25:32] [INFO ] Invariant cache hit.
[2024-06-02 22:25:32] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:25:33] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:25:33] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:25:33] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:25:33] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:25:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:25:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:25:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:25:34] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:25:34] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:25:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:25:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 255/357 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:25:37] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/358 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 164 constraints, problems are : Problem set: 0 solved, 283 unsolved in 13141 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/125 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 283/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:25:51] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/358 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 448 constraints, problems are : Problem set: 0 solved, 283 unsolved in 24060 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 16/16 constraints]
After SMT, in 37368ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 37371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 286/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37613 ms. Remains : 103/106 places, 286/287 transitions.
Treatment of property FireWire-PT-07-LTLCardinality-11 finished in 180343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 106 transition count 287
Applied a total of 27 rules in 15 ms. Remains 106 /119 variables (removed 13) and now considering 287/319 (removed 32) transitions.
[2024-06-02 22:26:10] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 22:26:10] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:26:10] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:26:10] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:26:10] [INFO ] Invariant cache hit.
[2024-06-02 22:26:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:26:10] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 22:26:10] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 22:26:10] [INFO ] Invariant cache hit.
[2024-06-02 22:26:10] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 22:26:11] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:26:11] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:26:12] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 286 unsolved in 10712 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/161 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 448 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 33197ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 33201ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 287/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33459 ms. Remains : 106/119 places, 287/319 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Product exploration explored 100000 steps with 33333 reset in 110 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLCardinality-13 finished in 33821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||((!p1||X(F((!p2||G(!p3))))) U (G((!p1||X(F((!p2||G(!p3))))))||(!p3&&(!p1||X(F((!p2||G(!p3)))))))))))'
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 319/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 314
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 314
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 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 116 transition count 311
Applied a total of 7 rules in 4 ms. Remains 116 /119 variables (removed 3) and now considering 311/319 (removed 8) transitions.
[2024-06-02 22:26:43] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 116 cols
[2024-06-02 22:26:43] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:26:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:26:44] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 22:26:44] [INFO ] Invariant cache hit.
[2024-06-02 22:26:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:26:44] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2024-06-02 22:26:44] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2024-06-02 22:26:44] [INFO ] Invariant cache hit.
[2024-06-02 22:26:44] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:26:46] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:26:47] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 175 constraints, problems are : Problem set: 0 solved, 310 unsolved in 12555 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 485 constraints, problems are : Problem set: 0 solved, 310 unsolved in 29292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 9/9 constraints]
After SMT, in 42028ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 42032ms
Starting structural reductions in LTL mode, iteration 1 : 116/119 places, 311/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42370 ms. Remains : 116/119 places, 311/319 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1 p3 p2), (AND p3 p2), (AND p3 p2 p0 p1)]
Running random walk in product with property : FireWire-PT-07-LTLCardinality-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLCardinality-15 finished in 42525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
[2024-06-02 22:27:27] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:27:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 22:27:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 319 transitions and 1175 arcs took 5 ms.
Total runtime 1030731 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/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 119
TRANSITIONS: 319
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/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: 2685
MODEL NAME: /home/mcc/execution/412/model
119 places, 319 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-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717367266740
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-171734898100219"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;