About the Execution of LTSMin+red for PolyORBLF-COL-S02J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2924.355 | 2977985.00 | 3885498.00 | 798.00 | FT?FTTT?FFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446300076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S02J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717248205220
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:23:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:23:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:23:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:23:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:23:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 843 ms
[2024-06-01 13:23:27] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:23:27] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:23:27] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (17 resets) in 1280 ms. (31 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40001 steps (13 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
[2024-06-01 13:23:28] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:23:28] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 13:23:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:23:28] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 555ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 32 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-06-01 13:23:28] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-06-01 13:23:28] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 13:23:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 8/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/97 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 105 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 7/40 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:23:30] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 5/45 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 43/102 variables, 59/104 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 8/112 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 41/153 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 0/102 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 153 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 20/20 constraints]
After SMT, in 3376ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 3377ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 12 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3447 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 13:23:32] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:23:32] [INFO ] Flatten gal took : 12 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:23:32] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 34 ms.
[2024-06-01 13:23:32] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 288 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 35 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:23:32] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2024-06-01 13:23:32] [INFO ] Computed 44 invariants in 47 ms
[2024-06-01 13:23:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 269 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:23:40] [INFO ] Deduced a trap composed of 277 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:23:41] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 3 ms to minimize.
[2024-06-01 13:23:41] [INFO ] Deduced a trap composed of 251 places in 321 ms of which 3 ms to minimize.
[2024-06-01 13:23:42] [INFO ] Deduced a trap composed of 211 places in 319 ms of which 3 ms to minimize.
[2024-06-01 13:23:42] [INFO ] Deduced a trap composed of 257 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:23:42] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:23:42] [INFO ] Deduced a trap composed of 248 places in 323 ms of which 33 ms to minimize.
[2024-06-01 13:23:44] [INFO ] Deduced a trap composed of 243 places in 1226 ms of which 16 ms to minimize.
[2024-06-01 13:23:50] [INFO ] Deduced a trap composed of 223 places in 311 ms of which 5 ms to minimize.
[2024-06-01 13:23:51] [INFO ] Deduced a trap composed of 245 places in 686 ms of which 4 ms to minimize.
[2024-06-01 13:23:52] [INFO ] Deduced a trap composed of 261 places in 303 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:24:00] [INFO ] Deduced a trap composed of 300 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:24:01] [INFO ] Deduced a trap composed of 253 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:24:01] [INFO ] Deduced a trap composed of 250 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:24:05] [INFO ] Deduced a trap composed of 238 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1274 variables, and 67 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 25/25 constraints]
After SMT, in 41178ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41195ms
[2024-06-01 13:24:13] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:24:13] [INFO ] Invariant cache hit.
[2024-06-01 13:24:14] [INFO ] Implicit Places using invariants in 358 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 377 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/476 places, 818/824 transitions.
Applied a total of 0 rules in 11 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41626 ms. Remains : 462/476 places, 818/824 transitions.
Support contains 288 out of 462 places after structural reductions.
[2024-06-01 13:24:14] [INFO ] Flatten gal took : 147 ms
[2024-06-01 13:24:14] [INFO ] Flatten gal took : 134 ms
[2024-06-01 13:24:14] [INFO ] Input system was already deterministic with 818 transitions.
Support contains 248 out of 462 places (down from 288) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 40000 steps (12 resets) in 463 ms. (86 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40001 steps (10 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
[2024-06-01 13:24:15] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 13:24:15] [INFO ] Computed 38 invariants in 31 ms
[2024-06-01 13:24:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/221 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/457 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/460 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 806/1266 variables, 460/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 72/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1266 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1268 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1268 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/221 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/457 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/460 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1268 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 15 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 312 transition count 656
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 300 transition count 656
Applied a total of 324 rules in 239 ms. Remains 300 /462 variables (removed 162) and now considering 656/818 (removed 162) transitions.
Running 654 sub problems to find dead transitions.
[2024-06-01 13:24:17] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
// Phase 1: matrix 644 rows 300 cols
[2024-06-01 13:24:18] [INFO ] Computed 38 invariants in 18 ms
[2024-06-01 13:24:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 112 places in 936 ms of which 2 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 103 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:24:27] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:24:27] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 128 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 123 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 166 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/300 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/944 variables, and 53 constraints, problems are : Problem set: 66 solved, 588 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/300 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 66 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 66 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 15/51 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-06-01 13:24:45] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:24:45] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 4/55 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-06-01 13:24:52] [INFO ] Deduced a trap composed of 110 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:24:53] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/57 constraints. Problems are: Problem set: 66 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/944 variables, and 57 constraints, problems are : Problem set: 66 solved, 588 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/300 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/654 constraints, Known Traps: 21/21 constraints]
After SMT, in 41640ms problems are : Problem set: 66 solved, 588 unsolved
Search for dead transitions found 66 dead transitions in 41662ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/462 places, 590/818 transitions.
Reduce places removed 2 places and 12 transitions.
Graph (complete) has 1784 edges and 298 vertex of which 6 are kept as prefixes of interest. Removing 292 places using SCC suffix rule.0 ms
Discarding 292 places :
Also discarding 572 output transitions
Drop transitions (Output transitions of discarded places.) removed 572 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 6
Reduce places removed 0 places and 6 transitions.
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 3 rules in 11 ms. Remains 6 /300 variables (removed 294) and now considering 0/590 (removed 590) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41915 ms. Remains : 6/462 places, 0/818 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(X((p0 U p1)))'
Support contains 12 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 27 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:25:00] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:25:00] [INFO ] Computed 38 invariants in 18 ms
[2024-06-01 13:25:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 240 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:25:07] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 271 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 265 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 223 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:25:15] [INFO ] Deduced a trap composed of 110 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 262 places in 261 ms of which 5 ms to minimize.
[2024-06-01 13:25:18] [INFO ] Deduced a trap composed of 269 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 309 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 298 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:25:27] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-06-01 13:25:31] [INFO ] Deduced a trap composed of 243 places in 293 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40983ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40999ms
[2024-06-01 13:25:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:25:41] [INFO ] Invariant cache hit.
[2024-06-01 13:25:41] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-01 13:25:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:25:41] [INFO ] Invariant cache hit.
[2024-06-01 13:25:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:25:47] [INFO ] Implicit Places using invariants and state equation in 5286 ms returned []
Implicit Place search using SMT with State Equation took 5882 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:25:47] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:25:47] [INFO ] Invariant cache hit.
[2024-06-01 13:25:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 270 places in 312 ms of which 6 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 286 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 256 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 5 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 268 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 245 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 241 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 288 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 232 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 248 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 144 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 302 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 278 places in 196 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 296 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 249 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 261 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 247 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:26:12] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:26:13] [INFO ] Deduced a trap composed of 242 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 244 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 288 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 67 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 61026ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 61041ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 776/818 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107991 ms. Remains : 456/462 places, 776/818 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-00 finished in 108473 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(!p1))) U X(X(!p2))))'
Support contains 33 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 23 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:26:48] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:26:48] [INFO ] Invariant cache hit.
[2024-06-01 13:26:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 1 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 270 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 286 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 256 places in 291 ms of which 5 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 5 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 268 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 2 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 241 places in 258 ms of which 5 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 288 places in 258 ms of which 5 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 5 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 248 places in 372 ms of which 6 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 302 places in 260 ms of which 5 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 278 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 296 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 6 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 261 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 247 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:14] [INFO ] Deduced a trap composed of 297 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 276 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 246 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 239 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 129 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40841ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40871ms
[2024-06-01 13:27:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:27:29] [INFO ] Invariant cache hit.
[2024-06-01 13:27:29] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 13:27:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:27:29] [INFO ] Invariant cache hit.
[2024-06-01 13:27:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:27:33] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:27:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:27:33] [INFO ] Invariant cache hit.
[2024-06-01 13:27:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 0 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:27:41] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:27:43] [INFO ] Deduced a trap composed of 270 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 286 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 256 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:27:44] [INFO ] Deduced a trap composed of 268 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 245 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 241 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 288 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 232 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:27:45] [INFO ] Deduced a trap composed of 248 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:27:49] [INFO ] Deduced a trap composed of 302 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:27:50] [INFO ] Deduced a trap composed of 278 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:50] [INFO ] Deduced a trap composed of 296 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:27:51] [INFO ] Deduced a trap composed of 249 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:27:51] [INFO ] Deduced a trap composed of 261 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:27:51] [INFO ] Deduced a trap composed of 247 places in 342 ms of which 31 ms to minimize.
[2024-06-01 13:27:57] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 4 ms to minimize.
[2024-06-01 13:27:58] [INFO ] Deduced a trap composed of 242 places in 167 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 10.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:28:05] [INFO ] Deduced a trap composed of 61 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 244 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 288 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 222 places in 247 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 67 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60779ms
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105248 ms. Remains : 456/462 places, 812/818 transitions.
Stuttering acceptance computed with spot in 632 ms :[p2, (OR (AND (NOT p0) p2) (AND p1 p2)), p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), p2, (AND p1 p2), (OR (NOT p0) p1), p1]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 539 ms.
Product exploration explored 100000 steps with 33333 reset in 457 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 28 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-01 finished in 106954 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 U (p1||G(!p0)))||F(G(p2)))))'
Support contains 50 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 10 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:28:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:28:35] [INFO ] Invariant cache hit.
[2024-06-01 13:28:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:28:43] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:28:43] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:28:45] [INFO ] Deduced a trap composed of 270 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:28:45] [INFO ] Deduced a trap composed of 286 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 256 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 268 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:28:46] [INFO ] Deduced a trap composed of 245 places in 200 ms of which 4 ms to minimize.
[2024-06-01 13:28:47] [INFO ] Deduced a trap composed of 241 places in 232 ms of which 2 ms to minimize.
[2024-06-01 13:28:47] [INFO ] Deduced a trap composed of 288 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:28:47] [INFO ] Deduced a trap composed of 232 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:28:47] [INFO ] Deduced a trap composed of 248 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 20 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 302 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 278 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 296 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 249 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 261 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 247 places in 203 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 297 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 276 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 246 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 63 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 27/27 constraints]
After SMT, in 40903ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40938ms
[2024-06-01 13:29:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:29:16] [INFO ] Invariant cache hit.
[2024-06-01 13:29:16] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-01 13:29:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:29:16] [INFO ] Invariant cache hit.
[2024-06-01 13:29:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:29:22] [INFO ] Implicit Places using invariants and state equation in 5511 ms returned []
Implicit Place search using SMT with State Equation took 5827 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:29:22] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:29:22] [INFO ] Invariant cache hit.
[2024-06-01 13:29:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 270 places in 283 ms of which 5 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 286 places in 197 ms of which 2 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 256 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 268 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 245 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 241 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 288 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 232 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 248 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:29:36] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 2 ms to minimize.
[2024-06-01 13:29:36] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:29:39] [INFO ] Deduced a trap composed of 302 places in 1897 ms of which 3 ms to minimize.
[2024-06-01 13:29:39] [INFO ] Deduced a trap composed of 278 places in 313 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 6 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 249 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 261 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 247 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:29:47] [INFO ] Deduced a trap composed of 242 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:55] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:30:09] [INFO ] Deduced a trap composed of 244 places in 275 ms of which 5 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 288 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 222 places in 177 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60844ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60864ms
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107657 ms. Remains : 456/462 places, 812/818 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-02
Product exploration explored 100000 steps with 4174 reset in 452 ms.
Product exploration explored 100000 steps with 4192 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 479 ms :[(AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), false, false, false, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (13 resets) in 1214 ms. (32 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40001 steps (13 resets) in 845 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 579 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 684 ms. (58 steps per ms) remains 3/3 properties
[2024-06-01 13:30:26] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:30:26] [INFO ] Invariant cache hit.
[2024-06-01 13:30:26] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/82 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/90 variables, 4/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/437 variables, 20/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 442/1256 variables, and 31 constraints, problems are : Problem set: 3 solved, 0 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 409ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 13 factoid took 645 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 257 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Support contains 50 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 456 transition count 770
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 414 transition count 770
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 414 transition count 734
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 378 transition count 734
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 252 place count 330 transition count 686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 324 transition count 680
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 324 transition count 680
Applied a total of 264 rules in 78 ms. Remains 324 /456 variables (removed 132) and now considering 680/812 (removed 132) transitions.
Running 678 sub problems to find dead transitions.
[2024-06-01 13:30:27] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-06-01 13:30:27] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 13:30:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:30:33] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:30:33] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 186 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:30:38] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 45 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:30:59] [INFO ] Deduced a trap composed of 120 places in 229 ms of which 8 ms to minimize.
[2024-06-01 13:30:59] [INFO ] Deduced a trap composed of 103 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 103 places in 203 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 49 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 13/13 constraints]
After SMT, in 40932ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40943ms
[2024-06-01 13:31:08] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-06-01 13:31:08] [INFO ] Invariant cache hit.
[2024-06-01 13:31:09] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 13:31:09] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-06-01 13:31:09] [INFO ] Invariant cache hit.
[2024-06-01 13:31:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:31:11] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 3116 ms to find 0 implicit places.
[2024-06-01 13:31:11] [INFO ] Redundant transitions in 57 ms returned []
Running 678 sub problems to find dead transitions.
[2024-06-01 13:31:11] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-06-01 13:31:11] [INFO ] Invariant cache hit.
[2024-06-01 13:31:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:31:16] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:31:20] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:31:22] [INFO ] Deduced a trap composed of 178 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 115 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 4 ms to minimize.
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 163 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 123 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/51 constraints. Problems are: Problem set: 36 solved, 642 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/52 constraints. Problems are: Problem set: 66 solved, 612 unsolved
[2024-06-01 13:31:43] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 31124ms, After SMT, problems are : Problem set: 66 solved, 612 unsolved
Search for dead transitions found 66 dead transitions in 31136ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 324/456 places, 614/812 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 14 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-06-01 13:31:43] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-06-01 13:31:43] [INFO ] Computed 38 invariants in 5 ms
[2024-06-01 13:31:43] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 13:31:43] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:31:43] [INFO ] Invariant cache hit.
[2024-06-01 13:31:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:31:45] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/456 places, 590/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77712 ms. Remains : 310/456 places, 590/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 217 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
RANDOM walk for 40000 steps (20 resets) in 351 ms. (113 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
[2024-06-01 13:31:46] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:31:46] [INFO ] Invariant cache hit.
[2024-06-01 13:31:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/186 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 304/888 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p0))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 480 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 282 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 222 ms :[(AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 5739 reset in 468 ms.
Product exploration explored 100000 steps with 5732 reset in 621 ms.
Support contains 50 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 590/590 transitions.
Applied a total of 0 rules in 25 ms. Remains 310 /310 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Running 588 sub problems to find dead transitions.
[2024-06-01 13:31:48] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:31:48] [INFO ] Invariant cache hit.
[2024-06-01 13:31:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 1 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2024-06-01 13:31:52] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 127 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 125 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:31:54] [INFO ] Deduced a trap composed of 152 places in 121 ms of which 1 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:31:55] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 120 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:31:56] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:31:57] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:31:58] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:31:58] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:31:58] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:31:58] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:31:58] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 4 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 5 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 129 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 157 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 153 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 1 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 148 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/888 variables, and 96 constraints, problems are : Problem set: 0 solved, 588 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 144 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 150 places in 222 ms of which 5 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 148 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 120 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 1 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 155 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 147 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 5 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 144 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 147 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 5 ms to minimize.
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 150 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 167 places in 238 ms of which 5 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 143 places in 260 ms of which 5 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 135 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 5 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 145 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 1 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 151 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 160 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 148 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 156 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 148 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 143 places in 188 ms of which 4 ms to minimize.
[2024-06-01 13:32:23] [INFO ] Deduced a trap composed of 145 places in 212 ms of which 5 ms to minimize.
[2024-06-01 13:32:24] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:25] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 145 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 141 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 145 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 146 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/888 variables, and 150 constraints, problems are : Problem set: 0 solved, 588 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 114/114 constraints]
After SMT, in 40609ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 40619ms
[2024-06-01 13:32:29] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:32:29] [INFO ] Invariant cache hit.
[2024-06-01 13:32:29] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 13:32:29] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:32:29] [INFO ] Invariant cache hit.
[2024-06-01 13:32:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:32:31] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
[2024-06-01 13:32:31] [INFO ] Redundant transitions in 9 ms returned []
Running 588 sub problems to find dead transitions.
[2024-06-01 13:32:31] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:32:31] [INFO ] Invariant cache hit.
[2024-06-01 13:32:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 2 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 117 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 110 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 125 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 136 places in 293 ms of which 3 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 133 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 132 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 119 places in 197 ms of which 5 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 129 places in 184 ms of which 5 ms to minimize.
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 122 places in 175 ms of which 5 ms to minimize.
[2024-06-01 13:32:40] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 6 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:32:42] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 123 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:32:43] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 132 places in 625 ms of which 27 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 128 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 132 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 4 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:49] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:32:49] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 160 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 151 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 136 places in 1127 ms of which 28 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 5 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 4 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 4 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 4 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 148 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 133 places in 183 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 150 places in 201 ms of which 1 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 6 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 4 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 148 places in 168 ms of which 5 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 5 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 143 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 123 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 150 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 150 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 1 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:33:00] [INFO ] Deduced a trap composed of 154 places in 129 ms of which 3 ms to minimize.
[2024-06-01 13:33:00] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 5 ms to minimize.
[2024-06-01 13:33:00] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:33:00] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 124 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 151 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:33:02] [INFO ] Deduced a trap composed of 142 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:33:02] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:33:02] [INFO ] Deduced a trap composed of 147 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 30706ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 30718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73798 ms. Remains : 310/310 places, 590/590 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-02 finished in 267196 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(G(p0)))'
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 318 transition count 674
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 318 transition count 674
Applied a total of 288 rules in 75 ms. Remains 318 /462 variables (removed 144) and now considering 674/818 (removed 144) transitions.
Running 672 sub problems to find dead transitions.
[2024-06-01 13:33:02] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2024-06-01 13:33:02] [INFO ] Computed 38 invariants in 10 ms
[2024-06-01 13:33:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 13:33:06] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 124 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:33:09] [INFO ] Deduced a trap composed of 184 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 114 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 50 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 13:33:33] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/318 variables, 2/55 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-06-01 13:33:42] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/980 variables, and 56 constraints, problems are : Problem set: 66 solved, 606 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 18/18 constraints]
After SMT, in 40916ms problems are : Problem set: 66 solved, 606 unsolved
Search for dead transitions found 66 dead transitions in 40924ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 13:33:43] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
// Phase 1: matrix 596 rows 318 cols
[2024-06-01 13:33:43] [INFO ] Computed 38 invariants in 9 ms
[2024-06-01 13:33:44] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 13:33:44] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
[2024-06-01 13:33:44] [INFO ] Invariant cache hit.
[2024-06-01 13:33:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:33:47] [INFO ] Implicit Places using invariants and state equation in 2926 ms returned []
Implicit Place search using SMT with State Equation took 3374 ms to find 0 implicit places.
[2024-06-01 13:33:47] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 318/462 places, 608/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 304 transition count 584
Applied a total of 12 rules in 29 ms. Remains 304 /318 variables (removed 14) and now considering 584/608 (removed 24) transitions.
[2024-06-01 13:33:47] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
// Phase 1: matrix 572 rows 304 cols
[2024-06-01 13:33:47] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 13:33:47] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 13:33:47] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
[2024-06-01 13:33:47] [INFO ] Invariant cache hit.
[2024-06-01 13:33:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:33:49] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 304/462 places, 584/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46655 ms. Remains : 304/462 places, 584/818 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-03
Product exploration explored 100000 steps with 70 reset in 432 ms.
Stack based approach found an accepted trace after 668 steps with 0 reset with depth 669 and stack size 669 in 4 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-03 finished in 47217 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((G(p0) U !p1)))'
Support contains 38 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 10 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:33:49] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:33:50] [INFO ] Computed 38 invariants in 9 ms
[2024-06-01 13:33:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:33:56] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 240 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 271 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 265 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 248 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 223 places in 272 ms of which 5 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 241 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:34:05] [INFO ] Deduced a trap composed of 110 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 262 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 269 places in 206 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 309 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 298 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 6 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 243 places in 372 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40971ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40994ms
[2024-06-01 13:34:30] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:34:30] [INFO ] Invariant cache hit.
[2024-06-01 13:34:31] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-01 13:34:31] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:34:31] [INFO ] Invariant cache hit.
[2024-06-01 13:34:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:34:37] [INFO ] Implicit Places using invariants and state equation in 6099 ms returned []
Implicit Place search using SMT with State Equation took 6481 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:34:37] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:34:37] [INFO ] Invariant cache hit.
[2024-06-01 13:34:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:34:45] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:34:45] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 1 ms to minimize.
[2024-06-01 13:34:45] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:34:45] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:34:48] [INFO ] Deduced a trap composed of 270 places in 270 ms of which 5 ms to minimize.
[2024-06-01 13:34:48] [INFO ] Deduced a trap composed of 286 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 256 places in 274 ms of which 5 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 268 places in 281 ms of which 7 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 241 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 288 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 5 ms to minimize.
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:34:54] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 3 ms to minimize.
[2024-06-01 13:34:54] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:34:55] [INFO ] Deduced a trap composed of 302 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:34:56] [INFO ] Deduced a trap composed of 278 places in 399 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:34:56] [INFO ] Deduced a trap composed of 296 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:34:57] [INFO ] Deduced a trap composed of 249 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:34:57] [INFO ] Deduced a trap composed of 261 places in 207 ms of which 4 ms to minimize.
[2024-06-01 13:34:57] [INFO ] Deduced a trap composed of 247 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:35:12] [INFO ] Deduced a trap composed of 242 places in 6036 ms of which 29 ms to minimize.
SMT process timed out in 34829ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 34846ms
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82338 ms. Remains : 456/462 places, 812/818 transitions.
Stuttering acceptance computed with spot in 189 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 582 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 27 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-05 finished in 83751 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 12 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 11 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:35:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:35:13] [INFO ] Invariant cache hit.
[2024-06-01 13:35:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 270 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 286 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 256 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 268 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 245 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 241 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 288 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 232 places in 194 ms of which 4 ms to minimize.
[2024-06-01 13:35:26] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:35:29] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:35:30] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:35:31] [INFO ] Deduced a trap composed of 302 places in 267 ms of which 5 ms to minimize.
[2024-06-01 13:35:31] [INFO ] Deduced a trap composed of 278 places in 358 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:32] [INFO ] Deduced a trap composed of 296 places in 253 ms of which 6 ms to minimize.
[2024-06-01 13:35:32] [INFO ] Deduced a trap composed of 249 places in 279 ms of which 5 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 261 places in 294 ms of which 3 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 247 places in 288 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 297 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 276 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 246 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 239 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 41013ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41023ms
[2024-06-01 13:35:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:35:54] [INFO ] Invariant cache hit.
[2024-06-01 13:35:55] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 13:35:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:35:55] [INFO ] Invariant cache hit.
[2024-06-01 13:35:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:35:59] [INFO ] Implicit Places using invariants and state equation in 4196 ms returned []
Implicit Place search using SMT with State Equation took 4514 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:35:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:35:59] [INFO ] Invariant cache hit.
[2024-06-01 13:35:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 14 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 270 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 286 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 256 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 268 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 245 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 241 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 288 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 248 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:36:16] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 4 ms to minimize.
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 302 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 278 places in 198 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 296 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 249 places in 187 ms of which 4 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 261 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 247 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 244 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 288 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 222 places in 214 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 61031ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 61044ms
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106598 ms. Remains : 456/462 places, 812/818 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-06
Product exploration explored 100000 steps with 2863 reset in 234 ms.
Product exploration explored 100000 steps with 2874 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 141 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 13:37:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:37:01] [INFO ] Invariant cache hit.
[2024-06-01 13:37:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:37:02] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 142 ms returned sat
[2024-06-01 13:37:03] [INFO ] [Real]Absence check using state equation in 1567 ms returned sat
[2024-06-01 13:37:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:37:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-01 13:37:04] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 86 ms returned sat
[2024-06-01 13:37:07] [INFO ] [Nat]Absence check using state equation in 2571 ms returned sat
[2024-06-01 13:37:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:37:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 630 ms returned sat
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 145 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 4 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2928 ms
[2024-06-01 13:37:10] [INFO ] Computed and/alt/rep : 546/1845/540 causal constraints (skipped 258 transitions) in 77 ms.
[2024-06-01 13:37:17] [INFO ] Added : 342 causal constraints over 69 iterations in 6495 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:37:17] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:37:17] [INFO ] Invariant cache hit.
[2024-06-01 13:37:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:37:25] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:37:25] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 270 places in 220 ms of which 4 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 286 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 256 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 268 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 245 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 241 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:37:28] [INFO ] Deduced a trap composed of 288 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 232 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:37:29] [INFO ] Deduced a trap composed of 248 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 7 ms to minimize.
[2024-06-01 13:37:32] [INFO ] Deduced a trap composed of 144 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 302 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 278 places in 197 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 296 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 249 places in 192 ms of which 4 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 261 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 247 places in 187 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 297 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 276 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 239 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40990ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 41002ms
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:58] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:38:03] [INFO ] Implicit Places using invariants and state equation in 4629 ms returned []
Implicit Place search using SMT with State Equation took 4933 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:38:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:38:03] [INFO ] Invariant cache hit.
[2024-06-01 13:38:03] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 270 places in 275 ms of which 5 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 286 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 256 places in 263 ms of which 7 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 268 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 241 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 288 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 248 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 144 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 302 places in 268 ms of which 5 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 278 places in 262 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 296 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 249 places in 246 ms of which 5 ms to minimize.
[2024-06-01 13:38:21] [INFO ] Deduced a trap composed of 261 places in 256 ms of which 5 ms to minimize.
[2024-06-01 13:38:21] [INFO ] Deduced a trap composed of 247 places in 302 ms of which 6 ms to minimize.
[2024-06-01 13:38:31] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:38:32] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 244 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 288 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 222 places in 243 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/455 variables, 1/67 constraints. Problems are: Problem set: 36 solved, 774 unsolved
[2024-06-01 13:39:02] [INFO ] Deduced a trap composed of 320 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1256 variables, and 68 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 31/31 constraints]
After SMT, in 60849ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60859ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 456/456 places, 776/812 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106813 ms. Remains : 456/456 places, 776/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 141 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 13:39:04] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 456 cols
[2024-06-01 13:39:04] [INFO ] Computed 38 invariants in 18 ms
[2024-06-01 13:39:05] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2024-06-01 13:39:05] [INFO ] [Real]Absence check using 14 positive and 24 generalized place invariants in 53 ms returned sat
[2024-06-01 13:39:06] [INFO ] [Real]Absence check using state equation in 1042 ms returned sat
[2024-06-01 13:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:39:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 37 ms returned sat
[2024-06-01 13:39:07] [INFO ] [Nat]Absence check using 14 positive and 24 generalized place invariants in 68 ms returned sat
[2024-06-01 13:39:12] [INFO ] [Nat]Absence check using state equation in 5070 ms returned sat
[2024-06-01 13:39:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:39:12] [INFO ] [Nat]Added 72 Read/Feed constraints in 385 ms returned sat
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 121 places in 219 ms of which 4 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 1 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1361 ms
[2024-06-01 13:39:14] [INFO ] Computed and/alt/rep : 570/2085/564 causal constraints (skipped 198 transitions) in 81 ms.
[2024-06-01 13:39:20] [INFO ] Added : 402 causal constraints over 81 iterations in 6411 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2884 reset in 328 ms.
Product exploration explored 100000 steps with 2887 reset in 347 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 456 transition count 776
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 36 place count 456 transition count 806
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 78 place count 456 transition count 806
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 444 transition count 794
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 444 transition count 794
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 150 place count 444 transition count 794
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 174 place count 420 transition count 770
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 198 place count 420 transition count 770
Deduced a syphon composed of 96 places in 0 ms
Applied a total of 198 rules in 48 ms. Remains 420 /456 variables (removed 36) and now considering 770/776 (removed 6) transitions.
Running 768 sub problems to find dead transitions.
[2024-06-01 13:39:21] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 420 cols
[2024-06-01 13:39:21] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 13:39:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 133 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 122 places in 179 ms of which 2 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-06-01 13:39:31] [INFO ] Deduced a trap composed of 100 places in 371 ms of which 5 ms to minimize.
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 124 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 32 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 115 places in 285 ms of which 5 ms to minimize.
Problem TDEAD716 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/48 constraints. Problems are: Problem set: 114 solved, 654 unsolved
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 122 places in 255 ms of which 8 ms to minimize.
[2024-06-01 13:39:37] [INFO ] Deduced a trap composed of 131 places in 358 ms of which 7 ms to minimize.
[2024-06-01 13:39:37] [INFO ] Deduced a trap composed of 116 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:39:42] [INFO ] Deduced a trap composed of 110 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:39:42] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 4 ms to minimize.
SMT process timed out in 20934ms, After SMT, problems are : Problem set: 114 solved, 654 unsolved
Search for dead transitions found 114 dead transitions in 20942ms
Found 114 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 114 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 114 transitions.
[2024-06-01 13:39:42] [INFO ] Redundant transitions in 3 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 420/456 places, 656/776 transitions.
Graph (complete) has 1942 edges and 420 vertex of which 336 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.2 ms
Discarding 84 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 1 ms
Applied a total of 1 rules in 13 ms. Remains 336 /420 variables (removed 84) and now considering 656/656 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 336/456 places, 656/776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21034 ms. Remains : 336/456 places, 656/776 transitions.
Support contains 12 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 776/776 transitions.
Applied a total of 0 rules in 6 ms. Remains 456 /456 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Running 774 sub problems to find dead transitions.
[2024-06-01 13:39:42] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
// Phase 1: matrix 764 rows 456 cols
[2024-06-01 13:39:42] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 13:39:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:39:49] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:39:50] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 259 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 238 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 270 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 271 places in 249 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 120 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:39:59] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1220 variables, and 52 constraints, problems are : Problem set: 0 solved, 774 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 223 places in 268 ms of which 6 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 229 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 210 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 261 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 244 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:40:14] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1220 variables, and 59 constraints, problems are : Problem set: 0 solved, 774 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/774 constraints, Known Traps: 23/23 constraints]
After SMT, in 40716ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 40725ms
[2024-06-01 13:40:23] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-06-01 13:40:23] [INFO ] Invariant cache hit.
[2024-06-01 13:40:23] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 13:40:23] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-06-01 13:40:23] [INFO ] Invariant cache hit.
[2024-06-01 13:40:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:40:28] [INFO ] Implicit Places using invariants and state equation in 4402 ms returned []
Implicit Place search using SMT with State Equation took 4689 ms to find 0 implicit places.
Running 774 sub problems to find dead transitions.
[2024-06-01 13:40:28] [INFO ] Flow matrix only has 764 transitions (discarded 12 similar events)
[2024-06-01 13:40:28] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:40:34] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:40:34] [INFO ] Deduced a trap composed of 243 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:40:34] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:40:35] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:40:36] [INFO ] Deduced a trap composed of 230 places in 204 ms of which 4 ms to minimize.
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:40:38] [INFO ] Deduced a trap composed of 263 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:40:38] [INFO ] Deduced a trap composed of 288 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:40:38] [INFO ] Deduced a trap composed of 246 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 249 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 249 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:40:39] [INFO ] Deduced a trap composed of 246 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:40:40] [INFO ] Deduced a trap composed of 213 places in 237 ms of which 5 ms to minimize.
[2024-06-01 13:40:40] [INFO ] Deduced a trap composed of 250 places in 199 ms of which 4 ms to minimize.
[2024-06-01 13:40:40] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:40:40] [INFO ] Deduced a trap composed of 244 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:40:41] [INFO ] Deduced a trap composed of 145 places in 242 ms of which 5 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 271 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 251 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 283 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 260 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 250 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 256 places in 206 ms of which 4 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 241 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 278 places in 372 ms of which 19 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 234 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 242 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 241 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 263 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 265 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:40:50] [INFO ] Deduced a trap composed of 251 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:40:52] [INFO ] Deduced a trap composed of 246 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1220 variables, and 73 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 37/73 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:41:01] [INFO ] Deduced a trap composed of 229 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:41:01] [INFO ] Deduced a trap composed of 204 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:41:02] [INFO ] Deduced a trap composed of 210 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:41:07] [INFO ] Deduced a trap composed of 302 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:41:07] [INFO ] Deduced a trap composed of 310 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:41:09] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 223 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:41:18] [INFO ] Deduced a trap composed of 279 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:41:18] [INFO ] Deduced a trap composed of 120 places in 226 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 774 unsolved
[2024-06-01 13:41:27] [INFO ] Deduced a trap composed of 249 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 287 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 298 places in 254 ms of which 5 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 246 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1220 variables, and 86 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/774 constraints, Known Traps: 50/50 constraints]
After SMT, in 60807ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 60822ms
Finished structural reductions in LTL mode , in 1 iterations and 106247 ms. Remains : 456/456 places, 776/776 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-06 finished in 375415 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(F(p0)))))'
Support contains 31 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 8 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:41:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:41:29] [INFO ] Computed 38 invariants in 18 ms
[2024-06-01 13:41:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:41:34] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:41:34] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:41:35] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:41:35] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:41:35] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:41:35] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:41:35] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:41:35] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:41:36] [INFO ] Deduced a trap composed of 271 places in 253 ms of which 7 ms to minimize.
[2024-06-01 13:41:36] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:41:37] [INFO ] Deduced a trap composed of 265 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 248 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:41:43] [INFO ] Deduced a trap composed of 223 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:41:43] [INFO ] Deduced a trap composed of 241 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 110 places in 227 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 262 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 269 places in 265 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:41:56] [INFO ] Deduced a trap composed of 309 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:41:56] [INFO ] Deduced a trap composed of 298 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:41:57] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:42:01] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 21/21 constraints]
After SMT, in 40786ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40793ms
[2024-06-01 13:42:09] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:42:09] [INFO ] Invariant cache hit.
[2024-06-01 13:42:10] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 13:42:10] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:42:10] [INFO ] Invariant cache hit.
[2024-06-01 13:42:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:42:16] [INFO ] Implicit Places using invariants and state equation in 5924 ms returned []
Implicit Place search using SMT with State Equation took 6177 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:42:16] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:42:16] [INFO ] Invariant cache hit.
[2024-06-01 13:42:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:42:22] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 270 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 286 places in 200 ms of which 4 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 256 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:42:25] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 268 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 245 places in 202 ms of which 4 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 241 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:42:26] [INFO ] Deduced a trap composed of 288 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 232 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:42:27] [INFO ] Deduced a trap composed of 248 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 302 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 278 places in 194 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 296 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 249 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 261 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 247 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 242 places in 431 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:43:05] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 7 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 288 places in 258 ms of which 5 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60849ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60868ms
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107853 ms. Remains : 456/462 places, 812/818 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 321 ms.
Product exploration explored 100000 steps with 25000 reset in 317 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 3 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:43:18] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:43:18] [INFO ] Invariant cache hit.
[2024-06-01 13:43:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 270 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 286 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 256 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 268 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 245 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 241 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 288 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 248 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 302 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:43:35] [INFO ] Deduced a trap composed of 278 places in 250 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:43:35] [INFO ] Deduced a trap composed of 296 places in 365 ms of which 18 ms to minimize.
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 249 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 261 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 247 places in 283 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 297 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 276 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 246 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:43:56] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:43:56] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40924ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40932ms
[2024-06-01 13:43:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:43:59] [INFO ] Invariant cache hit.
[2024-06-01 13:43:59] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-01 13:43:59] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:43:59] [INFO ] Invariant cache hit.
[2024-06-01 13:44:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:44:05] [INFO ] Implicit Places using invariants and state equation in 5962 ms returned []
Implicit Place search using SMT with State Equation took 6352 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:44:05] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:44:05] [INFO ] Invariant cache hit.
[2024-06-01 13:44:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:44:13] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 3 ms to minimize.
[2024-06-01 13:44:13] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 270 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:44:16] [INFO ] Deduced a trap composed of 286 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:44:16] [INFO ] Deduced a trap composed of 256 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:44:16] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:44:16] [INFO ] Deduced a trap composed of 268 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:44:17] [INFO ] Deduced a trap composed of 245 places in 417 ms of which 6 ms to minimize.
[2024-06-01 13:44:17] [INFO ] Deduced a trap composed of 241 places in 383 ms of which 5 ms to minimize.
[2024-06-01 13:44:17] [INFO ] Deduced a trap composed of 288 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:44:18] [INFO ] Deduced a trap composed of 232 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:44:18] [INFO ] Deduced a trap composed of 248 places in 280 ms of which 5 ms to minimize.
[2024-06-01 13:44:23] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 144 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 302 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 278 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 296 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 249 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 261 places in 320 ms of which 3 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 247 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:44:32] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:44:33] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 (/ 1.0 3.0))
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 (/ 1.0 3.0))
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 (/ 1.0 3.0))
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:44:38] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 244 places in 272 ms of which 5 ms to minimize.
[2024-06-01 13:44:55] [INFO ] Deduced a trap composed of 288 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:44:55] [INFO ] Deduced a trap composed of 222 places in 265 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60882ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Finished structural reductions in LTL mode , in 1 iterations and 108188 ms. Remains : 456/456 places, 812/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 265 ms.
Product exploration explored 100000 steps with 25000 reset in 260 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 456 transition count 812
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 54 Pre rules applied. Total rules applied 36 place count 456 transition count 866
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 90 place count 456 transition count 866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 102 place count 444 transition count 854
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 114 place count 444 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 162 place count 444 transition count 854
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 186 place count 420 transition count 830
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 210 place count 420 transition count 830
Deduced a syphon composed of 108 places in 0 ms
Applied a total of 210 rules in 56 ms. Remains 420 /456 variables (removed 36) and now considering 830/812 (removed -18) transitions.
Running 828 sub problems to find dead transitions.
[2024-06-01 13:45:08] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 420 cols
[2024-06-01 13:45:08] [INFO ] Computed 38 invariants in 20 ms
[2024-06-01 13:45:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:45:27] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-01 13:45:27] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:45:28] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 2 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1238 variables, and 45 constraints, problems are : Problem set: 24 solved, 804 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 24 solved, 804 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 11/11 constraints. Problems are: Problem set: 24 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/34 constraints. Problems are: Problem set: 24 solved, 804 unsolved
Problem TDEAD776 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD801 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 9/43 constraints. Problems are: Problem set: 30 solved, 798 unsolved
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
[2024-06-01 13:45:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
[2024-06-01 13:45:37] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
[2024-06-01 13:45:38] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 11/54 constraints. Problems are: Problem set: 102 solved, 726 unsolved
[2024-06-01 13:45:42] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 5 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:45:45] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 6/60 constraints. Problems are: Problem set: 102 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1238 variables, and 60 constraints, problems are : Problem set: 102 solved, 726 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 26/26 constraints]
After SMT, in 40968ms problems are : Problem set: 102 solved, 726 unsolved
Search for dead transitions found 102 dead transitions in 40977ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
[2024-06-01 13:45:49] [INFO ] Redundant transitions in 3 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 420/456 places, 728/812 transitions.
Graph (complete) has 2050 edges and 420 vertex of which 360 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 0 output transitions
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 1 rules in 11 ms. Remains 360 /420 variables (removed 60) and now considering 728/728 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 360/456 places, 728/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41081 ms. Remains : 360/456 places, 728/812 transitions.
Support contains 31 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 3 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:45:49] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:45:49] [INFO ] Computed 38 invariants in 10 ms
[2024-06-01 13:45:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 240 places in 271 ms of which 5 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 271 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 265 places in 281 ms of which 6 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 248 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 223 places in 267 ms of which 5 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 241 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:46:07] [INFO ] Deduced a trap composed of 110 places in 238 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:46:09] [INFO ] Deduced a trap composed of 262 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:46:09] [INFO ] Deduced a trap composed of 269 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20082 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:46:15] [INFO ] Deduced a trap composed of 309 places in 256 ms of which 5 ms to minimize.
[2024-06-01 13:46:16] [INFO ] Deduced a trap composed of 298 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:46:17] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:46:20] [INFO ] Deduced a trap composed of 243 places in 238 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:46:30] [INFO ] Deduced a trap composed of 242 places in 423 ms of which 20 ms to minimize.
SMT process timed out in 40962ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40969ms
[2024-06-01 13:46:30] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:46:30] [INFO ] Invariant cache hit.
[2024-06-01 13:46:31] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-06-01 13:46:31] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:46:31] [INFO ] Invariant cache hit.
[2024-06-01 13:46:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:46:36] [INFO ] Implicit Places using invariants and state equation in 4598 ms returned []
Implicit Place search using SMT with State Equation took 5207 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:46:36] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:46:36] [INFO ] Invariant cache hit.
[2024-06-01 13:46:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:46:49] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:46:49] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:46:51] [INFO ] Deduced a trap composed of 270 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:46:51] [INFO ] Deduced a trap composed of 286 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:46:51] [INFO ] Deduced a trap composed of 256 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 268 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 245 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 241 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:46:53] [INFO ] Deduced a trap composed of 288 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:46:53] [INFO ] Deduced a trap composed of 232 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:46:53] [INFO ] Deduced a trap composed of 248 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:46:55] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 32 ms to minimize.
[2024-06-01 13:46:56] [INFO ] Deduced a trap composed of 144 places in 302 ms of which 3 ms to minimize.
[2024-06-01 13:46:57] [INFO ] Deduced a trap composed of 302 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:46:58] [INFO ] Deduced a trap composed of 278 places in 233 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:46:58] [INFO ] Deduced a trap composed of 296 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:46:59] [INFO ] Deduced a trap composed of 249 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:46:59] [INFO ] Deduced a trap composed of 261 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:46:59] [INFO ] Deduced a trap composed of 247 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 244 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 288 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 61011ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 61027ms
Finished structural reductions in LTL mode , in 1 iterations and 107213 ms. Remains : 456/456 places, 812/812 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-07 finished in 368072 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(F(p0)))'
Support contains 12 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Applied a total of 300 rules in 31 ms. Remains 312 /462 variables (removed 150) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2024-06-01 13:47:37] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2024-06-01 13:47:37] [INFO ] Computed 38 invariants in 15 ms
[2024-06-01 13:47:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:47:41] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:47:42] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:47:42] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:47:42] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:47:42] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:47:42] [INFO ] Deduced a trap composed of 115 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:47:43] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:47:44] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 4 ms to minimize.
[2024-06-01 13:47:46] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:47:46] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:47:47] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:47:50] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:47:51] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 49 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 110 places in 199 ms of which 5 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
SMT process timed out in 40930ms, After SMT, problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 40950ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-06-01 13:48:18] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
// Phase 1: matrix 620 rows 312 cols
[2024-06-01 13:48:18] [INFO ] Computed 38 invariants in 16 ms
[2024-06-01 13:48:18] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 13:48:18] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-06-01 13:48:18] [INFO ] Invariant cache hit.
[2024-06-01 13:48:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:48:21] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 3287 ms to find 0 implicit places.
[2024-06-01 13:48:21] [INFO ] Redundant transitions in 4 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 312/462 places, 632/818 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44295 ms. Remains : 312/462 places, 632/818 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-08
Product exploration explored 100000 steps with 4310 reset in 473 ms.
Product exploration explored 100000 steps with 4319 reset in 479 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:48:23] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-06-01 13:48:23] [INFO ] Invariant cache hit.
[2024-06-01 13:48:23] [INFO ] [Real]Absence check using 15 positive place invariants in 36 ms returned sat
[2024-06-01 13:48:23] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 59 ms returned sat
[2024-06-01 13:48:24] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2024-06-01 13:48:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2024-06-01 13:48:25] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 28 ms returned sat
[2024-06-01 13:48:26] [INFO ] [Nat]Absence check using state equation in 1492 ms returned sat
[2024-06-01 13:48:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:48:26] [INFO ] [Nat]Added 72 Read/Feed constraints in 229 ms returned sat
[2024-06-01 13:48:27] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 5 ms to minimize.
[2024-06-01 13:48:27] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 6 ms to minimize.
[2024-06-01 13:48:27] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1217 ms
[2024-06-01 13:48:28] [INFO ] Computed and/alt/rep : 378/1797/372 causal constraints (skipped 246 transitions) in 65 ms.
[2024-06-01 13:48:31] [INFO ] Added : 263 causal constraints over 53 iterations in 3274 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 632/632 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Running 630 sub problems to find dead transitions.
[2024-06-01 13:48:31] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-06-01 13:48:31] [INFO ] Invariant cache hit.
[2024-06-01 13:48:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:48:36] [INFO ] Deduced a trap composed of 128 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:48:36] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 181 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:48:38] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:48:38] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-06-01 13:48:40] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:48:41] [INFO ] Deduced a trap composed of 102 places in 223 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:48:44] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/932 variables, and 52 constraints, problems are : Problem set: 0 solved, 630 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 140 places in 265 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 145 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:48:59] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 4 ms to minimize.
[2024-06-01 13:49:00] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:49:00] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:49:01] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:49:01] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:49:05] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:49:06] [INFO ] Deduced a trap composed of 156 places in 274 ms of which 5 ms to minimize.
[2024-06-01 13:49:08] [INFO ] Deduced a trap composed of 110 places in 213 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/932 variables, and 63 constraints, problems are : Problem set: 0 solved, 630 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 27/27 constraints]
After SMT, in 40729ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 40738ms
[2024-06-01 13:49:12] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-06-01 13:49:12] [INFO ] Invariant cache hit.
[2024-06-01 13:49:12] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 13:49:12] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-06-01 13:49:12] [INFO ] Invariant cache hit.
[2024-06-01 13:49:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:49:14] [INFO ] Implicit Places using invariants and state equation in 2473 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2024-06-01 13:49:14] [INFO ] Redundant transitions in 7 ms returned []
Running 630 sub problems to find dead transitions.
[2024-06-01 13:49:14] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2024-06-01 13:49:14] [INFO ] Invariant cache hit.
[2024-06-01 13:49:14] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:49:20] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:49:21] [INFO ] Deduced a trap composed of 181 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:49:22] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 2 ms to minimize.
[2024-06-01 13:49:22] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:49:24] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 102 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-01 13:49:28] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/53 constraints. Problems are: Problem set: 30 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/932 variables, and 53 constraints, problems are : Problem set: 30 solved, 600 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 30 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/51 constraints. Problems are: Problem set: 30 solved, 600 unsolved
[2024-06-01 13:49:48] [INFO ] Deduced a trap composed of 152 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:49:49] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:49:49] [INFO ] Deduced a trap composed of 183 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:49:49] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:49:49] [INFO ] Deduced a trap composed of 183 places in 216 ms of which 5 ms to minimize.
[2024-06-01 13:49:53] [INFO ] Deduced a trap composed of 145 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:49:53] [INFO ] Deduced a trap composed of 146 places in 197 ms of which 2 ms to minimize.
[2024-06-01 13:49:53] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 2 ms to minimize.
[2024-06-01 13:49:54] [INFO ] Deduced a trap composed of 146 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:49:54] [INFO ] Deduced a trap composed of 157 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:49:54] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:49:55] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 12/63 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/63 constraints. Problems are: Problem set: 30 solved, 600 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/64 constraints. Problems are: Problem set: 30 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/932 variables, and 64 constraints, problems are : Problem set: 30 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 27/27 constraints]
After SMT, in 60811ms problems are : Problem set: 30 solved, 600 unsolved
Search for dead transitions found 30 dead transitions in 60826ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 312/312 places, 602/632 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 298 transition count 578
Applied a total of 12 rules in 14 ms. Remains 298 /312 variables (removed 14) and now considering 578/602 (removed 24) transitions.
[2024-06-01 13:50:15] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
// Phase 1: matrix 566 rows 298 cols
[2024-06-01 13:50:15] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 13:50:15] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 13:50:15] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 13:50:15] [INFO ] Invariant cache hit.
[2024-06-01 13:50:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:50:18] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 2520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 298/312 places, 578/632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106816 ms. Remains : 298/312 places, 578/632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 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 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 92 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 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 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:50:18] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 13:50:18] [INFO ] Invariant cache hit.
[2024-06-01 13:50:19] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2024-06-01 13:50:19] [INFO ] [Real]Absence check using 12 positive and 26 generalized place invariants in 208 ms returned sat
[2024-06-01 13:50:20] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-06-01 13:50:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:50:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 13:50:20] [INFO ] [Nat]Absence check using 12 positive and 26 generalized place invariants in 34 ms returned sat
[2024-06-01 13:50:20] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-06-01 13:50:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:50:21] [INFO ] [Nat]Added 72 Read/Feed constraints in 99 ms returned sat
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2024-06-01 13:50:21] [INFO ] Computed and/alt/rep : 342/1533/336 causal constraints (skipped 228 transitions) in 44 ms.
[2024-06-01 13:50:23] [INFO ] Added : 213 causal constraints over 43 iterations in 2466 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4299 reset in 465 ms.
Product exploration explored 100000 steps with 4315 reset in 522 ms.
Support contains 12 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 578/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 298 /298 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Running 576 sub problems to find dead transitions.
[2024-06-01 13:50:25] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 13:50:25] [INFO ] Invariant cache hit.
[2024-06-01 13:50:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:28] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:50:28] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:50:28] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:50:28] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:50:28] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:50:29] [INFO ] Deduced a trap composed of 110 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:50:29] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:50:29] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:50:29] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:50:29] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 121 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 124 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:50:30] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:50:31] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:50:31] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:50:31] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:31] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 153 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 140 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 142 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 127 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 146 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 142 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 157 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 3 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 159 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 5 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 131 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 4 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 4 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 4 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 153 places in 171 ms of which 5 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 1 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 4 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 4 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:50:45] [INFO ] Deduced a trap composed of 120 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:50:45] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:50:45] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:50:45] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/864 variables, and 115 constraints, problems are : Problem set: 0 solved, 576 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 79/115 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:47] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 140 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 1 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 127 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 5 ms to minimize.
[2024-06-01 13:50:51] [INFO ] Deduced a trap composed of 130 places in 234 ms of which 5 ms to minimize.
[2024-06-01 13:50:51] [INFO ] Deduced a trap composed of 147 places in 240 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:52] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 6 ms to minimize.
[2024-06-01 13:50:52] [INFO ] Deduced a trap composed of 136 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 142 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 4 ms to minimize.
[2024-06-01 13:50:53] [INFO ] Deduced a trap composed of 151 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:50:54] [INFO ] Deduced a trap composed of 123 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:50:54] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:50:54] [INFO ] Deduced a trap composed of 134 places in 260 ms of which 2 ms to minimize.
[2024-06-01 13:50:54] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:50:54] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 134 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 147 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:50:56] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:50:56] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 126 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 128 places in 227 ms of which 5 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 131 places in 244 ms of which 5 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 150 places in 237 ms of which 5 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:51:02] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:51:03] [INFO ] Deduced a trap composed of 120 places in 203 ms of which 2 ms to minimize.
[2024-06-01 13:51:03] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:51:03] [INFO ] Deduced a trap composed of 112 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:51:03] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:51:04] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:51:04] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:51:04] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:51:04] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/864 variables, and 175 constraints, problems are : Problem set: 0 solved, 576 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 139/139 constraints]
After SMT, in 40651ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 40659ms
[2024-06-01 13:51:05] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 13:51:05] [INFO ] Invariant cache hit.
[2024-06-01 13:51:06] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 13:51:06] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 13:51:06] [INFO ] Invariant cache hit.
[2024-06-01 13:51:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:51:08] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
[2024-06-01 13:51:08] [INFO ] Redundant transitions in 5 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-01 13:51:08] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 13:51:08] [INFO ] Invariant cache hit.
[2024-06-01 13:51:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:51:11] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 118 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 109 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 126 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 1 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:51:16] [INFO ] Deduced a trap composed of 137 places in 296 ms of which 5 ms to minimize.
[2024-06-01 13:51:16] [INFO ] Deduced a trap composed of 153 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:51:16] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 5 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 140 places in 287 ms of which 5 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 143 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 1 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 127 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 129 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 128 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:51:19] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 139 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 133 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 157 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 143 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 3 ms to minimize.
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 142 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 159 places in 112 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 6 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 4 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 4 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 1 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 1 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 145 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 150 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 144 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 142 places in 203 ms of which 2 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 130 places in 180 ms of which 1 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 147 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 140 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 147 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 1 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:51:34] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:51:34] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 1 ms to minimize.
[2024-06-01 13:51:34] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:37] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/864 variables, and 137 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 101/101 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 101/137 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 143 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 152 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 152 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:51:44] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 1 ms to minimize.
[2024-06-01 13:51:44] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:51:44] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:51:44] [INFO ] Deduced a trap composed of 145 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:51:44] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:51:45] [INFO ] Deduced a trap composed of 135 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:46] [INFO ] Deduced a trap composed of 124 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 151 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 5 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:51:48] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:51:48] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:51:48] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 124 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 135 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:51:50] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:51:51] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:51:51] [INFO ] Deduced a trap composed of 130 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:51:52] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:51:55] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:51:55] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:51:55] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:51:56] [INFO ] Deduced a trap composed of 135 places in 281 ms of which 3 ms to minimize.
[2024-06-01 13:51:56] [INFO ] Deduced a trap composed of 129 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:51:56] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:51:56] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:51:57] [INFO ] Deduced a trap composed of 135 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:51:57] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:51:57] [INFO ] Deduced a trap composed of 139 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 132 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:51:59] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:52:08] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/864 variables, and 201 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 165/165 constraints]
After SMT, in 60766ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60776ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103884 ms. Remains : 298/298 places, 578/578 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-08 finished in 271793 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 16 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 42 ms. Remains 324 /462 variables (removed 138) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2024-06-01 13:52:09] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-06-01 13:52:09] [INFO ] Computed 38 invariants in 17 ms
[2024-06-01 13:52:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 1 ms to minimize.
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:52:14] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:52:14] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:52:14] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:52:18] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:52:18] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:52:18] [INFO ] Deduced a trap composed of 114 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:52:19] [INFO ] Deduced a trap composed of 144 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:52:24] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 50 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:52:31] [INFO ] Deduced a trap composed of 192 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/53 constraints. Problems are: Problem set: 66 solved, 612 unsolved
At refinement iteration 7 (OVERLAPS) 668/992 variables, 324/377 constraints. Problems are: Problem set: 66 solved, 612 unsolved
SMT process timed out in 40936ms, After SMT, problems are : Problem set: 66 solved, 612 unsolved
Search for dead transitions found 66 dead transitions in 40945ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 13:52:50] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
// Phase 1: matrix 602 rows 324 cols
[2024-06-01 13:52:50] [INFO ] Computed 38 invariants in 13 ms
[2024-06-01 13:52:50] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-06-01 13:52:50] [INFO ] Flow matrix only has 602 transitions (discarded 12 similar events)
[2024-06-01 13:52:50] [INFO ] Invariant cache hit.
[2024-06-01 13:52:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:52:52] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2024-06-01 13:52:52] [INFO ] Redundant transitions in 7 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 324/462 places, 614/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 310 transition count 590
Applied a total of 12 rules in 22 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-06-01 13:52:52] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-06-01 13:52:52] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 13:52:52] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 13:52:52] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:52:52] [INFO ] Invariant cache hit.
[2024-06-01 13:52:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:52:54] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 310/462 places, 590/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45400 ms. Remains : 310/462 places, 590/818 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-09
Product exploration explored 100000 steps with 2717 reset in 337 ms.
Product exploration explored 100000 steps with 2752 reset in 325 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40000 steps (20 resets) in 325 ms. (122 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (50 resets) in 336 ms. (118 steps per ms) remains 1/1 properties
[2024-06-01 13:52:55] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:52:55] [INFO ] Invariant cache hit.
[2024-06-01 13:52:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/187 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 307/888 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 181 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2024-06-01 13:52:56] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:52:56] [INFO ] Invariant cache hit.
[2024-06-01 13:52:56] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 13:52:56] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 91 ms returned sat
[2024-06-01 13:52:57] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-06-01 13:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:52:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 13:52:57] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 19 ms returned sat
[2024-06-01 13:52:58] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-06-01 13:52:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:52:58] [INFO ] [Nat]Added 72 Read/Feed constraints in 66 ms returned sat
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:52:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 774 ms
[2024-06-01 13:52:59] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 44 ms.
[2024-06-01 13:53:02] [INFO ] Added : 295 causal constraints over 59 iterations in 3556 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 13:53:02] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:53:02] [INFO ] Invariant cache hit.
[2024-06-01 13:53:08] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-01 13:53:08] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 41 ms returned sat
[2024-06-01 13:53:09] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-06-01 13:53:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:53:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 13:53:09] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 17 ms returned sat
[2024-06-01 13:53:09] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-06-01 13:53:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:53:09] [INFO ] [Nat]Added 72 Read/Feed constraints in 68 ms returned sat
[2024-06-01 13:53:10] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:53:10] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:53:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2024-06-01 13:53:10] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 51 ms.
[2024-06-01 13:53:12] [INFO ] Added : 250 causal constraints over 50 iterations in 1861 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 590/590 transitions.
Applied a total of 0 rules in 16 ms. Remains 310 /310 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Running 588 sub problems to find dead transitions.
[2024-06-01 13:53:12] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:53:12] [INFO ] Invariant cache hit.
[2024-06-01 13:53:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:15] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:53:15] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:53:16] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:53:17] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:53:17] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 1 ms to minimize.
[2024-06-01 13:53:17] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:53:17] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:53:17] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:53:18] [INFO ] Deduced a trap composed of 119 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:53:18] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:53:18] [INFO ] Deduced a trap composed of 118 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:53:18] [INFO ] Deduced a trap composed of 143 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:53:19] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:53:19] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:19] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:53:19] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:53:20] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:53:20] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:53:20] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:53:20] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:53:20] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 1 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 144 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:53:23] [INFO ] Deduced a trap composed of 125 places in 222 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:26] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:53:26] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:53:26] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 132 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 140 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:53:28] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 1 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 1 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 1 ms to minimize.
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 143 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 4 ms to minimize.
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 4 ms to minimize.
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 124 places in 167 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/888 variables, and 106 constraints, problems are : Problem set: 0 solved, 588 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 70/106 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:34] [INFO ] Deduced a trap composed of 148 places in 185 ms of which 4 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 151 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 145 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:53:37] [INFO ] Deduced a trap composed of 144 places in 205 ms of which 5 ms to minimize.
[2024-06-01 13:53:37] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:53:37] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:53:37] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:53:38] [INFO ] Deduced a trap composed of 131 places in 277 ms of which 2 ms to minimize.
[2024-06-01 13:53:38] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:53:38] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:53:38] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:39] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 129 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 151 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 148 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:53:41] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 134 places in 194 ms of which 4 ms to minimize.
[2024-06-01 13:53:44] [INFO ] Deduced a trap composed of 153 places in 2146 ms of which 29 ms to minimize.
[2024-06-01 13:53:45] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:53:45] [INFO ] Deduced a trap composed of 150 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:53:45] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:53:45] [INFO ] Deduced a trap composed of 147 places in 289 ms of which 2 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 134 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 147 places in 285 ms of which 5 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 132 places in 243 ms of which 5 ms to minimize.
[2024-06-01 13:53:49] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:53:49] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:53:49] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:53:49] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:53:50] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:53:50] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 1 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 134 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:53:53] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 2 ms to minimize.
SMT process timed out in 40783ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 40798ms
[2024-06-01 13:53:53] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:53:53] [INFO ] Invariant cache hit.
[2024-06-01 13:53:53] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-01 13:53:53] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:53:53] [INFO ] Invariant cache hit.
[2024-06-01 13:53:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:53:55] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2392 ms to find 0 implicit places.
[2024-06-01 13:53:55] [INFO ] Redundant transitions in 6 ms returned []
Running 588 sub problems to find dead transitions.
[2024-06-01 13:53:55] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:53:55] [INFO ] Invariant cache hit.
[2024-06-01 13:53:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 120 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 124 places in 226 ms of which 2 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 111 places in 263 ms of which 6 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 111 places in 273 ms of which 6 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 4 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 119 places in 251 ms of which 6 ms to minimize.
[2024-06-01 13:54:02] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:54:02] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:54:02] [INFO ] Deduced a trap composed of 143 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:54:02] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:54:02] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:03] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:54:03] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:54:03] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:54:05] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 4 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 144 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 115 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 4 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 1 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 5 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 155 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 145 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 2 ms to minimize.
[2024-06-01 13:54:12] [INFO ] Deduced a trap composed of 140 places in 191 ms of which 4 ms to minimize.
[2024-06-01 13:54:12] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:54:12] [INFO ] Deduced a trap composed of 139 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:54:12] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:54:13] [INFO ] Deduced a trap composed of 134 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:54:13] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:54:13] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:54:13] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:54:13] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:14] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-06-01 13:54:14] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:15] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:54:15] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:54:15] [INFO ] Deduced a trap composed of 133 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 140 places in 198 ms of which 6 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 124 places in 210 ms of which 6 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 4 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 7 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 153 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 150 places in 188 ms of which 4 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 4 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:54:19] [INFO ] Deduced a trap composed of 153 places in 196 ms of which 6 ms to minimize.
[2024-06-01 13:54:19] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:54:19] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:19] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 1 ms to minimize.
[2024-06-01 13:54:20] [INFO ] Deduced a trap composed of 121 places in 187 ms of which 8 ms to minimize.
[2024-06-01 13:54:20] [INFO ] Deduced a trap composed of 123 places in 189 ms of which 5 ms to minimize.
[2024-06-01 13:54:20] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 4 ms to minimize.
[2024-06-01 13:54:20] [INFO ] Deduced a trap composed of 147 places in 206 ms of which 5 ms to minimize.
[2024-06-01 13:54:21] [INFO ] Deduced a trap composed of 159 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:54:21] [INFO ] Deduced a trap composed of 144 places in 275 ms of which 5 ms to minimize.
[2024-06-01 13:54:21] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:54:21] [INFO ] Deduced a trap composed of 143 places in 263 ms of which 5 ms to minimize.
[2024-06-01 13:54:23] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:54:23] [INFO ] Deduced a trap composed of 170 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:54:24] [INFO ] Deduced a trap composed of 147 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:54:24] [INFO ] Deduced a trap composed of 88 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/888 variables, and 129 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 93/129 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 155 places in 173 ms of which 4 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 129 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 125 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 4 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 140 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 140 places in 268 ms of which 81 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 156 places in 141 ms of which 1 ms to minimize.
[2024-06-01 13:54:40] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:54:40] [INFO ] Deduced a trap composed of 147 places in 279 ms of which 5 ms to minimize.
[2024-06-01 13:54:40] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 142 places in 264 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:54:44] [INFO ] Deduced a trap composed of 135 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:54:44] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:54:45] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:54:47] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:54:47] [INFO ] Deduced a trap composed of 125 places in 299 ms of which 6 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 133 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 1 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 128 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 4 ms to minimize.
[2024-06-01 13:54:52] [INFO ] Deduced a trap composed of 115 places in 200 ms of which 6 ms to minimize.
[2024-06-01 13:54:52] [INFO ] Deduced a trap composed of 115 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:52] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:54:52] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 5 ms to minimize.
[2024-06-01 13:54:53] [INFO ] Deduced a trap composed of 135 places in 224 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/888 variables, and 184 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 148/148 constraints]
After SMT, in 60751ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103986 ms. Remains : 310/310 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40000 steps (21 resets) in 274 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
[2024-06-01 13:54:56] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:54:56] [INFO ] Invariant cache hit.
[2024-06-01 13:54:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/187 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 307/888 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 10 factoid took 216 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2024-06-01 13:54:57] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:54:57] [INFO ] Invariant cache hit.
[2024-06-01 13:54:58] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-01 13:54:58] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 110 ms returned sat
[2024-06-01 13:54:58] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-06-01 13:54:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 13:54:59] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 28 ms returned sat
[2024-06-01 13:54:59] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-06-01 13:54:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:54:59] [INFO ] [Nat]Added 72 Read/Feed constraints in 125 ms returned sat
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:55:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 704 ms
[2024-06-01 13:55:00] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 51 ms.
[2024-06-01 13:55:03] [INFO ] Added : 295 causal constraints over 59 iterations in 3183 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 13:55:03] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:55:03] [INFO ] Invariant cache hit.
[2024-06-01 13:55:04] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2024-06-01 13:55:04] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 62 ms returned sat
[2024-06-01 13:55:04] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-06-01 13:55:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 13:55:05] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 26 ms returned sat
[2024-06-01 13:55:05] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2024-06-01 13:55:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:55:05] [INFO ] [Nat]Added 72 Read/Feed constraints in 70 ms returned sat
[2024-06-01 13:55:05] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:55:06] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:55:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2024-06-01 13:55:06] [INFO ] Computed and/alt/rep : 354/1545/348 causal constraints (skipped 228 transitions) in 45 ms.
[2024-06-01 13:55:08] [INFO ] Added : 250 causal constraints over 50 iterations in 2251 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
Product exploration explored 100000 steps with 2724 reset in 379 ms.
Product exploration explored 100000 steps with 2727 reset in 378 ms.
Support contains 16 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 590/590 transitions.
Applied a total of 0 rules in 9 ms. Remains 310 /310 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Running 588 sub problems to find dead transitions.
[2024-06-01 13:55:09] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:55:09] [INFO ] Invariant cache hit.
[2024-06-01 13:55:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 158 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 3 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:55:23] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:55:24] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:55:24] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:55:24] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:55:24] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:55:24] [INFO ] Deduced a trap composed of 125 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:55:25] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:55:25] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:55:25] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:55:25] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:26] [INFO ] Deduced a trap composed of 143 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 147 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 3 ms to minimize.
SMT process timed out in 20716ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 20725ms
[2024-06-01 13:55:30] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:55:30] [INFO ] Invariant cache hit.
[2024-06-01 13:55:30] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 13:55:30] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:55:30] [INFO ] Invariant cache hit.
[2024-06-01 13:55:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:55:32] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2024-06-01 13:55:32] [INFO ] Redundant transitions in 5 ms returned []
Running 588 sub problems to find dead transitions.
[2024-06-01 13:55:32] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 13:55:32] [INFO ] Invariant cache hit.
[2024-06-01 13:55:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:35] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 120 places in 207 ms of which 5 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 119 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 148 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 144 places in 113 ms of which 1 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 155 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 145 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 156 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 3 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 143 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 3 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 147 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 121 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 147 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 88 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 129 places in 177 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/888 variables, and 136 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 100/136 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 157 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 143 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 141 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 145 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:56:08] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:56:08] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:56:08] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:56:08] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:56:08] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:56:09] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:56:09] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 145 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:56:11] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:56:12] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 4 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 18/174 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 13:56:24] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:56:24] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:56:24] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:56:24] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:56:24] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:56:25] [INFO ] Deduced a trap composed of 147 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:56:25] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:56:25] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:56:25] [INFO ] Deduced a trap composed of 153 places in 130 ms of which 3 ms to minimize.
[2024-06-01 13:56:25] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 12/186 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/888 variables, and 186 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/310 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 150/150 constraints]
After SMT, in 60641ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60650ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83485 ms. Remains : 310/310 places, 590/590 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-09 finished in 264038 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(G(p0)))'
Support contains 6 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Applied a total of 0 rules in 4 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:56:33] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 13:56:33] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 13:56:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:56:39] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:56:40] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 4 ms to minimize.
[2024-06-01 13:56:40] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:56:40] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:56:40] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:56:40] [INFO ] Deduced a trap composed of 235 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:56:41] [INFO ] Deduced a trap composed of 277 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:56:41] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:56:43] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:56:44] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:56:45] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 5 ms to minimize.
[2024-06-01 13:56:46] [INFO ] Deduced a trap composed of 223 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:56:47] [INFO ] Deduced a trap composed of 264 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:56:47] [INFO ] Deduced a trap composed of 256 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:56:47] [INFO ] Deduced a trap composed of 214 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
(s40 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 51 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:57:00] [INFO ] Deduced a trap composed of 263 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:57:00] [INFO ] Deduced a trap composed of 295 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 258 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:57:02] [INFO ] Deduced a trap composed of 234 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 4 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:57:10] [INFO ] Deduced a trap composed of 191 places in 242 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 58 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints]
After SMT, in 40813ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40820ms
[2024-06-01 13:57:13] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:57:13] [INFO ] Invariant cache hit.
[2024-06-01 13:57:14] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-06-01 13:57:14] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:57:14] [INFO ] Invariant cache hit.
[2024-06-01 13:57:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:57:19] [INFO ] Implicit Places using invariants and state equation in 4965 ms returned []
Implicit Place search using SMT with State Equation took 5318 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:57:19] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:57:19] [INFO ] Invariant cache hit.
[2024-06-01 13:57:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:57:26] [INFO ] Deduced a trap composed of 251 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:57:26] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:57:26] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:57:26] [INFO ] Deduced a trap composed of 278 places in 346 ms of which 4 ms to minimize.
[2024-06-01 13:57:27] [INFO ] Deduced a trap composed of 254 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:57:27] [INFO ] Deduced a trap composed of 264 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:57:27] [INFO ] Deduced a trap composed of 259 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:57:28] [INFO ] Deduced a trap composed of 247 places in 270 ms of which 5 ms to minimize.
[2024-06-01 13:57:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 228 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 327 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 239 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 236 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 233 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 275 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:57:48] [INFO ] Deduced a trap composed of 247 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:57:50] [INFO ] Deduced a trap composed of 134 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 31082ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 31092ms
Finished structural reductions in LTL mode , in 1 iterations and 77238 ms. Remains : 462/462 places, 818/818 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-10 finished in 77385 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)||G(p1)))'
Support contains 23 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 324 transition count 680
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 318 transition count 674
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 318 transition count 674
Applied a total of 288 rules in 26 ms. Remains 318 /462 variables (removed 144) and now considering 674/818 (removed 144) transitions.
Running 672 sub problems to find dead transitions.
[2024-06-01 13:57:50] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2024-06-01 13:57:50] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 13:57:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/317 variables, 1/46 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/46 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/318 variables, 1/47 constraints. Problems are: Problem set: 66 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/980 variables, and 47 constraints, problems are : Problem set: 66 solved, 606 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 66 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 9/45 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 184 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 4/49 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/49 constraints. Problems are: Problem set: 66 solved, 606 unsolved
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/50 constraints. Problems are: Problem set: 66 solved, 606 unsolved
[2024-06-01 13:58:23] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:58:24] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 2/52 constraints. Problems are: Problem set: 66 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/980 variables, and 52 constraints, problems are : Problem set: 66 solved, 606 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 15/15 constraints]
After SMT, in 40718ms problems are : Problem set: 66 solved, 606 unsolved
Search for dead transitions found 66 dead transitions in 40727ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 13:58:31] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
// Phase 1: matrix 596 rows 318 cols
[2024-06-01 13:58:31] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 13:58:31] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-06-01 13:58:31] [INFO ] Flow matrix only has 596 transitions (discarded 12 similar events)
[2024-06-01 13:58:31] [INFO ] Invariant cache hit.
[2024-06-01 13:58:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:58:33] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2024-06-01 13:58:34] [INFO ] Redundant transitions in 4 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 318/462 places, 608/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 304 transition count 584
Applied a total of 12 rules in 23 ms. Remains 304 /318 variables (removed 14) and now considering 584/608 (removed 24) transitions.
[2024-06-01 13:58:34] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
// Phase 1: matrix 572 rows 304 cols
[2024-06-01 13:58:34] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 13:58:34] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 13:58:34] [INFO ] Flow matrix only has 572 transitions (discarded 12 similar events)
[2024-06-01 13:58:34] [INFO ] Invariant cache hit.
[2024-06-01 13:58:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:58:37] [INFO ] Implicit Places using invariants and state equation in 2718 ms returned []
Implicit Place search using SMT with State Equation took 3016 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 304/462 places, 584/818 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46637 ms. Remains : 304/462 places, 584/818 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-11 finished in 46809 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(G((X((p0&&G(p1))) U (X((G(p3) U (p0&&G(p3))))||p2)))))'
Support contains 20 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 7 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:58:37] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:58:37] [INFO ] Computed 38 invariants in 11 ms
[2024-06-01 13:58:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 240 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 271 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 265 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:58:48] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 5 ms to minimize.
[2024-06-01 13:58:50] [INFO ] Deduced a trap composed of 223 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:58:50] [INFO ] Deduced a trap composed of 241 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:58:52] [INFO ] Deduced a trap composed of 110 places in 302 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:58:54] [INFO ] Deduced a trap composed of 262 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:58:54] [INFO ] Deduced a trap composed of 269 places in 249 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 309 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 298 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:59:07] [INFO ] Deduced a trap composed of 243 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 9)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 1)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 2)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 4)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 58 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 22/22 constraints]
After SMT, in 40782ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40794ms
[2024-06-01 13:59:18] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:59:18] [INFO ] Invariant cache hit.
[2024-06-01 13:59:18] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 13:59:18] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:59:18] [INFO ] Invariant cache hit.
[2024-06-01 13:59:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:59:23] [INFO ] Implicit Places using invariants and state equation in 4727 ms returned []
Implicit Place search using SMT with State Equation took 5017 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:59:23] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:59:23] [INFO ] Invariant cache hit.
[2024-06-01 13:59:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:59:30] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:59:30] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:59:30] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:59:30] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 270 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 286 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 256 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 268 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 245 places in 309 ms of which 9 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 241 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 288 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:59:35] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:59:36] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:59:38] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:59:39] [INFO ] Deduced a trap composed of 144 places in 220 ms of which 7 ms to minimize.
[2024-06-01 13:59:40] [INFO ] Deduced a trap composed of 302 places in 271 ms of which 5 ms to minimize.
[2024-06-01 13:59:40] [INFO ] Deduced a trap composed of 278 places in 251 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:59:41] [INFO ] Deduced a trap composed of 296 places in 234 ms of which 2 ms to minimize.
[2024-06-01 13:59:41] [INFO ] Deduced a trap composed of 249 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:59:41] [INFO ] Deduced a trap composed of 261 places in 224 ms of which 2 ms to minimize.
[2024-06-01 13:59:42] [INFO ] Deduced a trap composed of 247 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:59:47] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:59:48] [INFO ] Deduced a trap composed of 242 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:59:55] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:00:14] [INFO ] Deduced a trap composed of 244 places in 255 ms of which 4 ms to minimize.
[2024-06-01 14:00:14] [INFO ] Deduced a trap composed of 288 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:00:14] [INFO ] Deduced a trap composed of 222 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 60961ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60971ms
Starting structural reductions in LTL mode, iteration 1 : 456/462 places, 812/818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106794 ms. Remains : 456/462 places, 812/818 transitions.
Stuttering acceptance computed with spot in 641 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-12
Stuttering criterion allowed to conclude after 1043 steps with 0 reset in 11 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-12 finished in 107501 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 U p1)&&G((p2&&F(!p0))))))'
Support contains 44 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 462 transition count 788
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 432 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 426 transition count 782
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 72 place count 426 transition count 764
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 108 place count 408 transition count 764
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 204 place count 360 transition count 716
Applied a total of 204 rules in 42 ms. Remains 360 /462 variables (removed 102) and now considering 716/818 (removed 102) transitions.
Running 714 sub problems to find dead transitions.
[2024-06-01 14:00:24] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
// Phase 1: matrix 704 rows 360 cols
[2024-06-01 14:00:24] [INFO ] Computed 38 invariants in 12 ms
[2024-06-01 14:00:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 167 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 224 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:36] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 145 places in 207 ms of which 4 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 145 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1064 variables, and 51 constraints, problems are : Problem set: 0 solved, 714 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 714 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-01 14:00:48] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:00:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/359 variables, 1/55 constraints. Problems are: Problem set: 36 solved, 678 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 9)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/1064 variables, and 55 constraints, problems are : Problem set: 36 solved, 678 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/714 constraints, Known Traps: 18/18 constraints]
After SMT, in 40907ms problems are : Problem set: 36 solved, 678 unsolved
Search for dead transitions found 36 dead transitions in 40923ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-06-01 14:01:05] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 360 cols
[2024-06-01 14:01:05] [INFO ] Computed 38 invariants in 14 ms
[2024-06-01 14:01:05] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 14:01:05] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2024-06-01 14:01:06] [INFO ] Invariant cache hit.
[2024-06-01 14:01:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:01:09] [INFO ] Implicit Places using invariants and state equation in 3117 ms returned []
Implicit Place search using SMT with State Equation took 3388 ms to find 0 implicit places.
[2024-06-01 14:01:09] [INFO ] Redundant transitions in 4 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 360/462 places, 680/818 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44384 ms. Remains : 360/462 places, 680/818 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), p0, (OR (NOT p2) p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-13
Stuttering criterion allowed to conclude after 1115 steps with 0 reset in 10 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-13 finished in 44683 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 U (p1||G(!p0)))||F(G(p2)))))'
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))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T06-LTLFireability-06
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 462 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 420 transition count 740
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 384 transition count 740
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 264 place count 330 transition count 686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 270 place count 324 transition count 680
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 32 ms. Remains 324 /462 variables (removed 138) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2024-06-01 14:01:09] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-06-01 14:01:09] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:01:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:01:14] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 4 ms to minimize.
[2024-06-01 14:01:15] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 4 ms to minimize.
[2024-06-01 14:01:16] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:01:20] [INFO ] Deduced a trap composed of 114 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:01:20] [INFO ] Deduced a trap composed of 147 places in 220 ms of which 2 ms to minimize.
[2024-06-01 14:01:20] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:01:21] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/323 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 642 unsolved
[2024-06-01 14:01:30] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/992 variables, and 51 constraints, problems are : Problem set: 36 solved, 642 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 36 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 11/11 constraints. Problems are: Problem set: 36 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 25/36 constraints. Problems are: Problem set: 36 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 14/50 constraints. Problems are: Problem set: 36 solved, 642 unsolved
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 116 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:01:35] [INFO ] Deduced a trap composed of 120 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/52 constraints. Problems are: Problem set: 36 solved, 642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/52 constraints. Problems are: Problem set: 36 solved, 642 unsolved
At refinement iteration 5 (OVERLAPS) 1/323 variables, 1/53 constraints. Problems are: Problem set: 36 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/992 variables, and 53 constraints, problems are : Problem set: 36 solved, 642 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 16/16 constraints]
After SMT, in 40949ms problems are : Problem set: 36 solved, 642 unsolved
Search for dead transitions found 36 dead transitions in 40958ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-06-01 14:01:50] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
// Phase 1: matrix 632 rows 324 cols
[2024-06-01 14:01:50] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 14:01:51] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 14:01:51] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:01:51] [INFO ] Invariant cache hit.
[2024-06-01 14:01:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:01:53] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3058 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 324/462 places, 644/818 transitions.
Applied a total of 0 rules in 27 ms. Remains 324 /324 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 44079 ms. Remains : 324/462 places, 644/818 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-06
Product exploration explored 100000 steps with 3950 reset in 418 ms.
Product exploration explored 100000 steps with 3962 reset in 417 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 96 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 14:01:55] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:01:55] [INFO ] Invariant cache hit.
[2024-06-01 14:01:55] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2024-06-01 14:01:56] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 98 ms returned sat
[2024-06-01 14:01:56] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-06-01 14:01:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:01:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 14:01:57] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 42 ms returned sat
[2024-06-01 14:01:57] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-06-01 14:01:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:01:58] [INFO ] [Nat]Added 72 Read/Feed constraints in 250 ms returned sat
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 2 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 4 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 5 ms to minimize.
[2024-06-01 14:01:59] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-06-01 14:01:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1079 ms
[2024-06-01 14:01:59] [INFO ] Computed and/alt/rep : 402/1893/396 causal constraints (skipped 234 transitions) in 55 ms.
[2024-06-01 14:02:01] [INFO ] Added : 148 causal constraints over 30 iterations in 2473 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 644/644 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Running 642 sub problems to find dead transitions.
[2024-06-01 14:02:01] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:02:01] [INFO ] Invariant cache hit.
[2024-06-01 14:02:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:12] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:02:12] [INFO ] Deduced a trap composed of 110 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 155 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 129 places in 220 ms of which 2 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 140 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 178 places in 229 ms of which 2 ms to minimize.
[2024-06-01 14:02:21] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:02:22] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/956 variables, and 53 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:24] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:02:25] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:02:25] [INFO ] Deduced a trap composed of 120 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:02:27] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:02:28] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:02:31] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:02:32] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 4 ms to minimize.
[2024-06-01 14:02:32] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/956 variables, and 62 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 26/26 constraints]
After SMT, in 40763ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 40771ms
[2024-06-01 14:02:42] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:02:42] [INFO ] Invariant cache hit.
[2024-06-01 14:02:42] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 14:02:42] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:02:42] [INFO ] Invariant cache hit.
[2024-06-01 14:02:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:02:46] [INFO ] Implicit Places using invariants and state equation in 4043 ms returned []
Implicit Place search using SMT with State Equation took 4359 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2024-06-01 14:02:46] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:02:46] [INFO ] Invariant cache hit.
[2024-06-01 14:02:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:02:52] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:02:52] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:02:52] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 5 ms to minimize.
[2024-06-01 14:02:52] [INFO ] Deduced a trap composed of 126 places in 282 ms of which 2 ms to minimize.
[2024-06-01 14:02:53] [INFO ] Deduced a trap composed of 117 places in 237 ms of which 28 ms to minimize.
[2024-06-01 14:02:55] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:02:59] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 5 ms to minimize.
[2024-06-01 14:02:59] [INFO ] Deduced a trap composed of 110 places in 167 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:03:06] [INFO ] Deduced a trap composed of 155 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:03:06] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:03:06] [INFO ] Deduced a trap composed of 140 places in 196 ms of which 5 ms to minimize.
[2024-06-01 14:03:07] [INFO ] Deduced a trap composed of 178 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:03:08] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 4 ms to minimize.
[2024-06-01 14:03:09] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 19.0 2.0))
(s1 (/ 1.0 2.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 0.0)
(s123 0.0)
(s124 (/ 1.0 2.0))
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 (/ 1.0 2.0))
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s204 (/ 1.0 2.0))
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 (/ 1.0 2.0))
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 4.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(timeout
s236 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/323 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/956 variables, and 54 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:03:21] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 5 ms to minimize.
[2024-06-01 14:03:21] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:03:21] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:03:23] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 3 ms to minimize.
[2024-06-01 14:03:24] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 3 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:03:40] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/956 variables, and 62 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 26/26 constraints]
After SMT, in 60725ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 60737ms
Finished structural reductions in LTL mode , in 1 iterations and 105892 ms. Remains : 324/324 places, 644/644 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 94 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 14:03:48] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:03:48] [INFO ] Invariant cache hit.
[2024-06-01 14:03:48] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2024-06-01 14:03:48] [INFO ] [Real]Absence check using 15 positive and 23 generalized place invariants in 144 ms returned sat
[2024-06-01 14:03:49] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2024-06-01 14:03:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:03:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 14:03:49] [INFO ] [Nat]Absence check using 15 positive and 23 generalized place invariants in 31 ms returned sat
[2024-06-01 14:03:50] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-06-01 14:03:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:03:50] [INFO ] [Nat]Added 72 Read/Feed constraints in 234 ms returned sat
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 740 ms
[2024-06-01 14:03:51] [INFO ] Computed and/alt/rep : 402/1893/396 causal constraints (skipped 234 transitions) in 56 ms.
[2024-06-01 14:03:52] [INFO ] Added : 148 causal constraints over 30 iterations in 1652 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3949 reset in 363 ms.
Product exploration explored 100000 steps with 3954 reset in 362 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 644/644 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Running 642 sub problems to find dead transitions.
[2024-06-01 14:03:53] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:03:53] [INFO ] Invariant cache hit.
[2024-06-01 14:03:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:03:57] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:03:57] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:03:57] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:03:57] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:03:57] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 117 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:03:59] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 140 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 155 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:04:10] [INFO ] Deduced a trap composed of 178 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:04:10] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:04:10] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/956 variables, and 53 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:04:17] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:04:17] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:04:17] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:04:19] [INFO ] Deduced a trap composed of 128 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:04:20] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:04:24] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:04:25] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:04:25] [INFO ] Deduced a trap composed of 62 places in 288 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/956 variables, and 61 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 25/25 constraints]
After SMT, in 40759ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 40770ms
[2024-06-01 14:04:34] [INFO ] Redundant transitions in 3 ms returned []
Running 642 sub problems to find dead transitions.
[2024-06-01 14:04:34] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:04:34] [INFO ] Invariant cache hit.
[2024-06-01 14:04:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:04:40] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 140 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:04:52] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 3 ms to minimize.
[2024-06-01 14:04:52] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:04:53] [INFO ] Deduced a trap composed of 140 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:04:53] [INFO ] Deduced a trap composed of 178 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:04:54] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:04:54] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (OVERLAPS) 1/323 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/956 variables, and 55 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 128 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:05:22] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (OVERLAPS) 1/323 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/956 variables, and 63 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 26/26 constraints]
After SMT, in 60840ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 60850ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101647 ms. Remains : 324/324 places, 644/644 transitions.
Support contains 12 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 644/644 transitions.
Applied a total of 0 rules in 4 ms. Remains 324 /324 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Running 642 sub problems to find dead transitions.
[2024-06-01 14:05:35] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:05:35] [INFO ] Invariant cache hit.
[2024-06-01 14:05:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:05:40] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:05:40] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:05:40] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:05:40] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:05:40] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:05:41] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:05:45] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:05:45] [INFO ] Deduced a trap composed of 110 places in 187 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:05:53] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:05:53] [INFO ] Deduced a trap composed of 129 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:05:53] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 178 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/956 variables, and 53 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:05:58] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:05:58] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:05:58] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:06:00] [INFO ] Deduced a trap composed of 128 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:06:01] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:06:04] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:06:05] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:06:05] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 123 places in 228 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/956 variables, and 62 constraints, problems are : Problem set: 0 solved, 642 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 26/26 constraints]
After SMT, in 40867ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 40880ms
[2024-06-01 14:06:16] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:06:16] [INFO ] Invariant cache hit.
[2024-06-01 14:06:16] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 14:06:16] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:06:16] [INFO ] Invariant cache hit.
[2024-06-01 14:06:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:06:19] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2024-06-01 14:06:19] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
[2024-06-01 14:06:19] [INFO ] Invariant cache hit.
[2024-06-01 14:06:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:06:24] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:06:25] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:06:25] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:06:29] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:06:29] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-06-01 14:06:36] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:06:37] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:06:37] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:06:37] [INFO ] Deduced a trap composed of 178 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:06:38] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (OVERLAPS) 1/323 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/55 constraints. Problems are: Problem set: 30 solved, 612 unsolved
[2024-06-01 14:06:49] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/956 variables, and 56 constraints, problems are : Problem set: 30 solved, 612 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 30 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 30 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 22/36 constraints. Problems are: Problem set: 30 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 17/53 constraints. Problems are: Problem set: 30 solved, 612 unsolved
[2024-06-01 14:06:52] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:06:59] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:06:59] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 4/57 constraints. Problems are: Problem set: 30 solved, 612 unsolved
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 120 places in 206 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/58 constraints. Problems are: Problem set: 30 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/956 variables, and 58 constraints, problems are : Problem set: 30 solved, 612 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/642 constraints, Known Traps: 22/23 constraints]
After SMT, in 60791ms problems are : Problem set: 30 solved, 612 unsolved
Search for dead transitions found 30 dead transitions in 60804ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 324/324 places, 614/644 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 602
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 310 transition count 590
Applied a total of 14 rules in 4 ms. Remains 310 /324 variables (removed 14) and now considering 590/614 (removed 24) transitions.
[2024-06-01 14:07:20] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
// Phase 1: matrix 578 rows 310 cols
[2024-06-01 14:07:20] [INFO ] Computed 38 invariants in 6 ms
[2024-06-01 14:07:20] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-06-01 14:07:20] [INFO ] Flow matrix only has 578 transitions (discarded 12 similar events)
[2024-06-01 14:07:20] [INFO ] Invariant cache hit.
[2024-06-01 14:07:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:07:22] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 310/324 places, 590/644 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107353 ms. Remains : 310/324 places, 590/644 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-06 finished in 373294 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(F(p0)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T06-LTLFireability-07
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 462 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Applied a total of 300 rules in 54 ms. Remains 312 /462 variables (removed 150) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2024-06-01 14:07:23] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2024-06-01 14:07:23] [INFO ] Computed 38 invariants in 15 ms
[2024-06-01 14:07:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 178 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 101 places in 2153 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 14:07:38] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:07:38] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
(s38 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/968 variables, and 49 constraints, problems are : Problem set: 0 solved, 666 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 159 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/55 constraints. Problems are: Problem set: 66 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/968 variables, and 55 constraints, problems are : Problem set: 66 solved, 600 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 17/17 constraints]
After SMT, in 41060ms problems are : Problem set: 66 solved, 600 unsolved
Search for dead transitions found 66 dead transitions in 41082ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 14:08:04] [INFO ] Flow matrix only has 590 transitions (discarded 12 similar events)
// Phase 1: matrix 590 rows 312 cols
[2024-06-01 14:08:04] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:08:04] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 14:08:04] [INFO ] Flow matrix only has 590 transitions (discarded 12 similar events)
[2024-06-01 14:08:04] [INFO ] Invariant cache hit.
[2024-06-01 14:08:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:08:06] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 312/462 places, 602/818 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 298 transition count 578
Applied a total of 12 rules in 11 ms. Remains 298 /312 variables (removed 14) and now considering 578/602 (removed 24) transitions.
[2024-06-01 14:08:06] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
// Phase 1: matrix 566 rows 298 cols
[2024-06-01 14:08:06] [INFO ] Computed 38 invariants in 13 ms
[2024-06-01 14:08:07] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 14:08:07] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:08:07] [INFO ] Invariant cache hit.
[2024-06-01 14:08:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:08:09] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 2750 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 298/462 places, 578/818 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 46303 ms. Remains : 298/462 places, 578/818 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 284 ms.
Product exploration explored 100000 steps with 25000 reset in 286 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 298 /298 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Running 576 sub problems to find dead transitions.
[2024-06-01 14:08:11] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:08:11] [INFO ] Invariant cache hit.
[2024-06-01 14:08:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2024-06-01 14:08:14] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 5 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 118 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 122 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 109 places in 255 ms of which 5 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 121 places in 192 ms of which 5 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 122 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 5 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 126 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 5 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 3 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:08:19] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:08:19] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 6 ms to minimize.
[2024-06-01 14:08:19] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 5 ms to minimize.
[2024-06-01 14:08:19] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 5 ms to minimize.
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 4 ms to minimize.
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:08:20] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 4 ms to minimize.
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 132 places in 176 ms of which 6 ms to minimize.
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 129 places in 185 ms of which 5 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 128 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 121 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 117 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 5 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 146 places in 158 ms of which 5 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 159 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/864 variables, and 96 constraints, problems are : Problem set: 0 solved, 576 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:32] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:08:33] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 4 ms to minimize.
[2024-06-01 14:08:33] [INFO ] Deduced a trap composed of 126 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:08:33] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:08:33] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 4 ms to minimize.
[2024-06-01 14:08:33] [INFO ] Deduced a trap composed of 133 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:08:33] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 136 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 130 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 3 ms to minimize.
[2024-06-01 14:08:36] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:08:36] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:08:36] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:08:36] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:08:36] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:37] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:08:38] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:08:38] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:08:38] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:08:38] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:08:38] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 5 ms to minimize.
[2024-06-01 14:08:39] [INFO ] Deduced a trap composed of 147 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:08:39] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:08:39] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:08:39] [INFO ] Deduced a trap composed of 124 places in 169 ms of which 4 ms to minimize.
[2024-06-01 14:08:40] [INFO ] Deduced a trap composed of 115 places in 232 ms of which 5 ms to minimize.
[2024-06-01 14:08:40] [INFO ] Deduced a trap composed of 118 places in 177 ms of which 5 ms to minimize.
[2024-06-01 14:08:40] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:08:40] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:08:40] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:08:41] [INFO ] Deduced a trap composed of 117 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:08:41] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 4 ms to minimize.
[2024-06-01 14:08:41] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:08:41] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:08:41] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:42] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:08:43] [INFO ] Deduced a trap composed of 144 places in 191 ms of which 4 ms to minimize.
[2024-06-01 14:08:43] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:08:43] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:08:44] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:08:44] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 3 ms to minimize.
[2024-06-01 14:08:44] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 3 ms to minimize.
[2024-06-01 14:08:44] [INFO ] Deduced a trap composed of 127 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:08:44] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 5 ms to minimize.
[2024-06-01 14:08:44] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:08:45] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:08:45] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:08:45] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 5 ms to minimize.
[2024-06-01 14:08:45] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 4 ms to minimize.
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 121 places in 173 ms of which 4 ms to minimize.
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 122 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 4 ms to minimize.
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 144 places in 174 ms of which 5 ms to minimize.
[2024-06-01 14:08:46] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 4 ms to minimize.
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 143 places in 201 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 125 places in 2158 ms of which 24 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 4 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 4 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 6 ms to minimize.
SMT process timed out in 40590ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 40602ms
[2024-06-01 14:08:51] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:08:51] [INFO ] Invariant cache hit.
[2024-06-01 14:08:51] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 14:08:51] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:08:51] [INFO ] Invariant cache hit.
[2024-06-01 14:08:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:08:55] [INFO ] Implicit Places using invariants and state equation in 3407 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 14:08:55] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:08:55] [INFO ] Invariant cache hit.
[2024-06-01 14:08:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:09:02] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:09:02] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:09:02] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:09:03] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:09:03] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:09:03] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:09:03] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:09:03] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:09:04] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:09:04] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:09:04] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:09:04] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:09:04] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:09:05] [INFO ] Deduced a trap composed of 132 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:09:05] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:09:05] [INFO ] Deduced a trap composed of 129 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:09:05] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:09:06] [INFO ] Deduced a trap composed of 121 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:09:06] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:13] [INFO ] Deduced a trap composed of 117 places in 188 ms of which 6 ms to minimize.
[2024-06-01 14:09:13] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:09:13] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:09:14] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 6 ms to minimize.
[2024-06-01 14:09:14] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:09:14] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:09:14] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:09:14] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:09:15] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:09:15] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 4 ms to minimize.
[2024-06-01 14:09:15] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:09:15] [INFO ] Deduced a trap composed of 157 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:09:15] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 4 ms to minimize.
[2024-06-01 14:09:15] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 13 ms to minimize.
[2024-06-01 14:09:16] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:09:16] [INFO ] Deduced a trap composed of 135 places in 207 ms of which 6 ms to minimize.
[2024-06-01 14:09:16] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:09:16] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:09:16] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 4 ms to minimize.
[2024-06-01 14:09:17] [INFO ] Deduced a trap composed of 159 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:17] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:09:18] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 5 ms to minimize.
[2024-06-01 14:09:18] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:09:18] [INFO ] Deduced a trap composed of 135 places in 188 ms of which 6 ms to minimize.
[2024-06-01 14:09:18] [INFO ] Deduced a trap composed of 144 places in 188 ms of which 7 ms to minimize.
[2024-06-01 14:09:18] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:09:19] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 5 ms to minimize.
[2024-06-01 14:09:19] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 7 ms to minimize.
[2024-06-01 14:09:19] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 4 ms to minimize.
[2024-06-01 14:09:19] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:09:19] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 132 places in 191 ms of which 7 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:09:20] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:09:21] [INFO ] Deduced a trap composed of 116 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:09:21] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:09:21] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:09:21] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 5 ms to minimize.
[2024-06-01 14:09:22] [INFO ] Deduced a trap composed of 145 places in 187 ms of which 6 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 150 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 4 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 143 places in 177 ms of which 5 ms to minimize.
[2024-06-01 14:09:23] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 4 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 130 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 147 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 1 ms to minimize.
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 145 places in 145 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 135 places in 206 ms of which 1 ms to minimize.
SMT process timed out in 30631ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 30640ms
Finished structural reductions in LTL mode , in 1 iterations and 75014 ms. Remains : 298/298 places, 578/578 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 204 ms.
Product exploration explored 100000 steps with 25000 reset in 318 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 31 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 578/578 transitions.
Applied a total of 0 rules in 8 ms. Remains 298 /298 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Running 576 sub problems to find dead transitions.
[2024-06-01 14:09:27] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:09:27] [INFO ] Invariant cache hit.
[2024-06-01 14:09:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 110 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 1 ms to minimize.
[2024-06-01 14:09:32] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:09:32] [INFO ] Deduced a trap composed of 122 places in 177 ms of which 4 ms to minimize.
[2024-06-01 14:09:32] [INFO ] Deduced a trap composed of 109 places in 198 ms of which 6 ms to minimize.
[2024-06-01 14:09:32] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 4 ms to minimize.
[2024-06-01 14:09:32] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:09:32] [INFO ] Deduced a trap composed of 122 places in 186 ms of which 6 ms to minimize.
[2024-06-01 14:09:33] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 4 ms to minimize.
[2024-06-01 14:09:33] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 5 ms to minimize.
[2024-06-01 14:09:33] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:09:33] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:09:33] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 121 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 130 places in 183 ms of which 5 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 4 ms to minimize.
[2024-06-01 14:09:36] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 4 ms to minimize.
[2024-06-01 14:09:36] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:09:36] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 5 ms to minimize.
[2024-06-01 14:09:36] [INFO ] Deduced a trap composed of 133 places in 189 ms of which 4 ms to minimize.
[2024-06-01 14:09:36] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 4 ms to minimize.
[2024-06-01 14:09:37] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 4 ms to minimize.
[2024-06-01 14:09:37] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:09:37] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:09:37] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:09:37] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:09:37] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:09:38] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:09:38] [INFO ] Deduced a trap composed of 128 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:09:38] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 4 ms to minimize.
[2024-06-01 14:09:38] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:41] [INFO ] Deduced a trap composed of 117 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:09:41] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 4 ms to minimize.
[2024-06-01 14:09:41] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 6 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 5 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 146 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 4 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 4 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 1 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 159 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:45] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:09:45] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 157 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 4 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 1 ms to minimize.
SMT process timed out in 20722ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 20730ms
[2024-06-01 14:09:48] [INFO ] Redundant transitions in 7 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-01 14:09:48] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:09:48] [INFO ] Invariant cache hit.
[2024-06-01 14:09:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 107 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 122 places in 189 ms of which 4 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 5 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:09:56] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:09:56] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:09:57] [INFO ] Deduced a trap composed of 130 places in 242 ms of which 4 ms to minimize.
[2024-06-01 14:09:57] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 4 ms to minimize.
[2024-06-01 14:09:57] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 4 ms to minimize.
[2024-06-01 14:09:58] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 4 ms to minimize.
[2024-06-01 14:09:58] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:09:58] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:09:58] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:09:58] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:09:59] [INFO ] Deduced a trap composed of 138 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:09:59] [INFO ] Deduced a trap composed of 143 places in 229 ms of which 5 ms to minimize.
[2024-06-01 14:09:59] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:09:59] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:10:00] [INFO ] Deduced a trap composed of 132 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:10:00] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 4 ms to minimize.
[2024-06-01 14:10:00] [INFO ] Deduced a trap composed of 129 places in 184 ms of which 5 ms to minimize.
[2024-06-01 14:10:00] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:10:00] [INFO ] Deduced a trap composed of 121 places in 194 ms of which 1 ms to minimize.
[2024-06-01 14:10:01] [INFO ] Deduced a trap composed of 124 places in 266 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:04] [INFO ] Deduced a trap composed of 117 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:10:04] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:10:05] [INFO ] Deduced a trap composed of 122 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:10:05] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 1 ms to minimize.
[2024-06-01 14:10:05] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 1 ms to minimize.
[2024-06-01 14:10:05] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 4 ms to minimize.
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 146 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 1 ms to minimize.
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 142 places in 205 ms of which 1 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 157 places in 287 ms of which 1 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 5 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 143 places in 192 ms of which 4 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 5 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 4 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 135 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 142 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 6 ms to minimize.
[2024-06-01 14:10:10] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:10:11] [INFO ] Deduced a trap composed of 157 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 153 places in 215 ms of which 6 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 117 places in 209 ms of which 5 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 134 places in 392 ms of which 27 ms to minimize.
[2024-06-01 14:10:12] [INFO ] Deduced a trap composed of 132 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:10:13] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:10:13] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:10:13] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 5 ms to minimize.
[2024-06-01 14:10:13] [INFO ] Deduced a trap composed of 120 places in 193 ms of which 5 ms to minimize.
[2024-06-01 14:10:14] [INFO ] Deduced a trap composed of 116 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:10:14] [INFO ] Deduced a trap composed of 128 places in 194 ms of which 5 ms to minimize.
[2024-06-01 14:10:14] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:10:14] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:15] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:10:15] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:10:15] [INFO ] Deduced a trap composed of 150 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 3 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:10:16] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:10:17] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 1 ms to minimize.
[2024-06-01 14:10:17] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:10:17] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:10:17] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 6 ms to minimize.
[2024-06-01 14:10:17] [INFO ] Deduced a trap composed of 140 places in 194 ms of which 4 ms to minimize.
[2024-06-01 14:10:18] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:10:18] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:10:18] [INFO ] Deduced a trap composed of 140 places in 201 ms of which 6 ms to minimize.
[2024-06-01 14:10:18] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:10:18] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 6 ms to minimize.
[2024-06-01 14:10:19] [INFO ] Deduced a trap composed of 148 places in 205 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/864 variables, and 136 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 100/136 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:21] [INFO ] Deduced a trap composed of 148 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:10:21] [INFO ] Deduced a trap composed of 152 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:10:21] [INFO ] Deduced a trap composed of 132 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:10:21] [INFO ] Deduced a trap composed of 163 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:10:21] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:10:22] [INFO ] Deduced a trap composed of 148 places in 143 ms of which 1 ms to minimize.
[2024-06-01 14:10:22] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:10:22] [INFO ] Deduced a trap composed of 157 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:10:22] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:10:22] [INFO ] Deduced a trap composed of 151 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:10:22] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:10:23] [INFO ] Deduced a trap composed of 158 places in 719 ms of which 2 ms to minimize.
[2024-06-01 14:10:23] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:10:24] [INFO ] Deduced a trap composed of 152 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:10:24] [INFO ] Deduced a trap composed of 142 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:10:24] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:10:24] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:10:24] [INFO ] Deduced a trap composed of 150 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:10:25] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:10:25] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:26] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:10:26] [INFO ] Deduced a trap composed of 144 places in 284 ms of which 2 ms to minimize.
[2024-06-01 14:10:27] [INFO ] Deduced a trap composed of 140 places in 219 ms of which 4 ms to minimize.
[2024-06-01 14:10:27] [INFO ] Deduced a trap composed of 130 places in 196 ms of which 4 ms to minimize.
[2024-06-01 14:10:27] [INFO ] Deduced a trap composed of 148 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:10:28] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:10:28] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:10:28] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 4 ms to minimize.
[2024-06-01 14:10:28] [INFO ] Deduced a trap composed of 144 places in 190 ms of which 4 ms to minimize.
[2024-06-01 14:10:28] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 5 ms to minimize.
[2024-06-01 14:10:29] [INFO ] Deduced a trap composed of 122 places in 201 ms of which 5 ms to minimize.
[2024-06-01 14:10:29] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 6 ms to minimize.
[2024-06-01 14:10:29] [INFO ] Deduced a trap composed of 134 places in 192 ms of which 4 ms to minimize.
[2024-06-01 14:10:29] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 4 ms to minimize.
[2024-06-01 14:10:30] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 4 ms to minimize.
[2024-06-01 14:10:30] [INFO ] Deduced a trap composed of 141 places in 191 ms of which 5 ms to minimize.
[2024-06-01 14:10:30] [INFO ] Deduced a trap composed of 145 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:10:30] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:10:31] [INFO ] Deduced a trap composed of 169 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:10:32] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:10:33] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 130 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:10:34] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 1 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 126 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 130 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:10:35] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 148 places in 133 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:44] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 4 ms to minimize.
[2024-06-01 14:10:44] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:10:45] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:10:45] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:10:45] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 5 ms to minimize.
[2024-06-01 14:10:45] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 4 ms to minimize.
[2024-06-01 14:10:45] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:10:46] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:10:46] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 4 ms to minimize.
[2024-06-01 14:10:46] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 4 ms to minimize.
[2024-06-01 14:10:47] [INFO ] Deduced a trap composed of 157 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:10:47] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:10:47] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 3 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 145 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:10:49] [INFO ] Deduced a trap composed of 133 places in 187 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/864 variables, and 216 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/298 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 180/180 constraints]
After SMT, in 60662ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81432 ms. Remains : 298/298 places, 578/578 transitions.
Support contains 31 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Running 576 sub problems to find dead transitions.
[2024-06-01 14:10:49] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:10:49] [INFO ] Invariant cache hit.
[2024-06-01 14:10:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 110 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 5 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 118 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 122 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 122 places in 223 ms of which 4 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 124 places in 174 ms of which 4 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 111 places in 255 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 4 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 130 places in 189 ms of which 4 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 4 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 4 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 153 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:10:58] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:10:58] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 3 ms to minimize.
[2024-06-01 14:10:58] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:10:58] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:10:58] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 142 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 129 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 128 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:11:00] [INFO ] Deduced a trap composed of 121 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:11:00] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 1 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 122 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 132 places in 214 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 146 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 133 places in 235 ms of which 5 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 142 places in 182 ms of which 5 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 157 places in 193 ms of which 6 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 143 places in 155 ms of which 4 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 3 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 5 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 5 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 5 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 4 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 3 ms to minimize.
SMT process timed out in 20587ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 20598ms
[2024-06-01 14:11:09] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:11:09] [INFO ] Invariant cache hit.
[2024-06-01 14:11:10] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-06-01 14:11:10] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:11:10] [INFO ] Invariant cache hit.
[2024-06-01 14:11:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:11:12] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
Running 576 sub problems to find dead transitions.
[2024-06-01 14:11:12] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2024-06-01 14:11:12] [INFO ] Invariant cache hit.
[2024-06-01 14:11:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 4 ms to minimize.
[2024-06-01 14:11:16] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:11:16] [INFO ] Deduced a trap composed of 118 places in 187 ms of which 5 ms to minimize.
[2024-06-01 14:11:16] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 3 ms to minimize.
[2024-06-01 14:11:16] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 121 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 122 places in 189 ms of which 4 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 5 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 121 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 125 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 109 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 121 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 130 places in 212 ms of which 4 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 136 places in 276 ms of which 5 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 3 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 143 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 3 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 4 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 124 places in 194 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:31] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:11:31] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 3 ms to minimize.
[2024-06-01 14:11:31] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:11:31] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:11:31] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 4 ms to minimize.
[2024-06-01 14:11:32] [INFO ] Deduced a trap composed of 132 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:11:32] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:11:32] [INFO ] Deduced a trap composed of 146 places in 196 ms of which 4 ms to minimize.
[2024-06-01 14:11:32] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 5 ms to minimize.
[2024-06-01 14:11:32] [INFO ] Deduced a trap composed of 133 places in 195 ms of which 4 ms to minimize.
[2024-06-01 14:11:33] [INFO ] Deduced a trap composed of 142 places in 197 ms of which 5 ms to minimize.
[2024-06-01 14:11:33] [INFO ] Deduced a trap composed of 157 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:11:33] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:11:33] [INFO ] Deduced a trap composed of 143 places in 219 ms of which 4 ms to minimize.
[2024-06-01 14:11:33] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 5 ms to minimize.
[2024-06-01 14:11:34] [INFO ] Deduced a trap composed of 135 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:11:34] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 4 ms to minimize.
[2024-06-01 14:11:34] [INFO ] Deduced a trap composed of 135 places in 186 ms of which 4 ms to minimize.
[2024-06-01 14:11:34] [INFO ] Deduced a trap composed of 142 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:11:35] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:35] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:11:36] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:11:36] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:11:36] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 4 ms to minimize.
[2024-06-01 14:11:36] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:11:36] [INFO ] Deduced a trap composed of 133 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 4 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 157 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 153 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 134 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 116 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 128 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 150 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:11:42] [INFO ] Deduced a trap composed of 147 places in 184 ms of which 4 ms to minimize.
[2024-06-01 14:11:43] [INFO ] Deduced a trap composed of 139 places in 979 ms of which 28 ms to minimize.
SMT process timed out in 30989ms, After SMT, problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 31001ms
Finished structural reductions in LTL mode , in 1 iterations and 53755 ms. Remains : 298/298 places, 578/578 transitions.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-07 finished in 260207 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(F(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)))))'
[2024-06-01 14:11:43] [INFO ] Flatten gal took : 80 ms
[2024-06-01 14:11:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 14:11:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 818 transitions and 3532 arcs took 6 ms.
Total runtime 2896866 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-LTLFireability-02
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-LTLFireability-07
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717251183205
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S02J04T06-LTLFireability-02
ltl formula formula --ltl=/tmp/11296/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 462 places, 818 transitions and 3532 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11296/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11296/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.050 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11296/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11296/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-COL-S02J04T06-LTLFireability-06
ltl formula formula --ltl=/tmp/11296/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 462 places, 818 transitions and 3532 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.040 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11296/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11296/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11296/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11296/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 477 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 463, there are 821 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~47 levels ~10000 states ~11000 transitions
pnml2lts-mc( 1/ 4): ~47 levels ~20000 states ~22524 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 24983
pnml2lts-mc( 0/ 4): unique states count: 24983
pnml2lts-mc( 0/ 4): unique transitions count: 36334
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11537
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 25387
pnml2lts-mc( 0/ 4): - cum. max stack depth: 177
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 25387 states 37302 transitions, fanout: 1.469
pnml2lts-mc( 0/ 4): Total exploration time 0.550 sec (0.550 sec minimum, 0.550 sec on average)
pnml2lts-mc( 0/ 4): States per second: 46158, Transitions per second: 67822
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 10.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 830 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J04T06-LTLFireability-07
ltl formula formula --ltl=/tmp/11296/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 462 places, 818 transitions and 3532 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11296/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11296/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11296/ltl_2_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-COL-S02J04T06-LTLFireability-08
ltl formula formula --ltl=/tmp/11296/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 462 places, 818 transitions and 3532 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.040 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11296/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11296/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11296/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11296/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 477 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 463, there are 825 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~33 levels ~10000 states ~14580 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~20000 states ~32592 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~40000 states ~71276 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~80000 states ~159288 transitions
pnml2lts-mc( 3/ 4): ~136 levels ~160000 states ~376816 transitions
pnml2lts-mc( 3/ 4): ~140 levels ~320000 states ~855128 transitions
pnml2lts-mc( 3/ 4): ~140 levels ~640000 states ~2022840 transitions
pnml2lts-mc( 3/ 4): ~140 levels ~1280000 states ~4447056 transitions
pnml2lts-mc( 3/ 4): ~188 levels ~2560000 states ~8597772 transitions
pnml2lts-mc( 3/ 4): ~188 levels ~5120000 states ~14413232 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~152!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6434168
pnml2lts-mc( 0/ 4): unique states count: 6434782
pnml2lts-mc( 0/ 4): unique transitions count: 16752864
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 10319950
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6438906
pnml2lts-mc( 0/ 4): - cum. max stack depth: 736
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6438906 states 16765368 transitions, fanout: 2.604
pnml2lts-mc( 0/ 4): Total exploration time 76.320 sec (76.320 sec minimum, 76.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 84367, Transitions per second: 219672
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 52.0MB, 8.5 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 830 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 52.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J04T06-LTLFireability-09
ltl formula formula --ltl=/tmp/11296/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 462 places, 818 transitions and 3532 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.030 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11296/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11296/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11296/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11296/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 477 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 463, there are 835 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~27 levels ~10000 states ~31132 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~453!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13781
pnml2lts-mc( 0/ 4): unique states count: 15462
pnml2lts-mc( 0/ 4): unique transitions count: 49349
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 30209
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 15875
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1689
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15875 states 51426 transitions, fanout: 3.239
pnml2lts-mc( 0/ 4): Total exploration time 0.300 sec (0.300 sec minimum, 0.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 52917, Transitions per second: 171420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 14.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 830 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
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="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446300076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;