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.r289-tajo-171654445100084.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 greatspnxred
Input is PolyORBLF-COL-S02J04T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445100084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 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.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 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-S02J04T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716844636733

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:17:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 21:17:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:17:18] [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-05-27 21:17:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:17:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 664 ms
[2024-05-27 21:17:18] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 21:17:19] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 21:17:19] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 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 1535 ms. (26 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40001 steps (12 resets) in 429 ms. (93 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (10 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
[2024-05-27 21:17:19] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:17:19] [INFO ] Computed 26 invariants in 9 ms
[2024-05-27 21:17:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 21:17:20] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 0 solved, 3 unsolved in 470 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: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 0 solved, 3 unsolved in 218 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: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2269 ms.
Support contains 4 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 37 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-27 21:17:23] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-27 21:17:23] [INFO ] Computed 25 invariants in 4 ms
[2024-05-27 21:17:23] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-27 21:17:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 104 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-27 21:17:24] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-27 21:17:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 4/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 148 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 13/13 constraints]
After SMT, in 2409ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 2411ms
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 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2470 ms. Remains : 59/81 places, 39/65 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
[2024-05-27 21:17:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-27 21:17:25] [INFO ] Flatten gal took : 30 ms
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:17:25] [INFO ] Flatten gal took : 9 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-05-27 21:17:25] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 37 ms.
[2024-05-27 21:17:25] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 162 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 604 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 596 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 596 transition count 1098
Applied a total of 34 rules in 54 ms. Remains 596 /614 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:17:25] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-27 21:17:25] [INFO ] Computed 48 invariants in 47 ms
[2024-05-27 21:17:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 2 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 6 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 328 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 316 places in 267 ms of which 4 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 327 places in 236 ms of which 5 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 320 places in 246 ms of which 4 ms to minimize.
[2024-05-27 21:17:39] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:17:39] [INFO ] Deduced a trap composed of 183 places in 279 ms of which 5 ms to minimize.
[2024-05-27 21:17:40] [INFO ] Deduced a trap composed of 327 places in 358 ms of which 4 ms to minimize.
[2024-05-27 21:17:41] [INFO ] Deduced a trap composed of 379 places in 323 ms of which 5 ms to minimize.
[2024-05-27 21:17:41] [INFO ] Deduced a trap composed of 313 places in 319 ms of which 5 ms to minimize.
[2024-05-27 21:17:42] [INFO ] Deduced a trap composed of 388 places in 344 ms of which 4 ms to minimize.
[2024-05-27 21:17:42] [INFO ] Deduced a trap composed of 301 places in 258 ms of which 4 ms to minimize.
[2024-05-27 21:17:42] [INFO ] Deduced a trap composed of 314 places in 409 ms of which 4 ms to minimize.
[2024-05-27 21:17:43] [INFO ] Deduced a trap composed of 324 places in 312 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:17:43] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 12 ms to minimize.
[2024-05-27 21:17:44] [INFO ] Deduced a trap composed of 356 places in 256 ms of which 5 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 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.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 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.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 0.0)
(s123 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:17:55] [INFO ] Deduced a trap composed of 306 places in 287 ms of which 9 ms to minimize.
[2024-05-27 21:17:57] [INFO ] Deduced a trap composed of 330 places in 313 ms of which 4 ms to minimize.
[2024-05-27 21:17:57] [INFO ] Deduced a trap composed of 346 places in 240 ms of which 3 ms to minimize.
[2024-05-27 21:17:57] [INFO ] Deduced a trap composed of 343 places in 327 ms of which 8 ms to minimize.
[2024-05-27 21:17:58] [INFO ] Deduced a trap composed of 307 places in 290 ms of which 4 ms to minimize.
[2024-05-27 21:18:01] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-27 21:18:02] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-27 21:18:02] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:18:04] [INFO ] Deduced a trap composed of 352 places in 332 ms of which 5 ms to minimize.
[2024-05-27 21:18:05] [INFO ] Deduced a trap composed of 353 places in 293 ms of which 5 ms to minimize.
[2024-05-27 21:18:05] [INFO ] Deduced a trap composed of 355 places in 264 ms of which 3 ms to minimize.
[2024-05-27 21:18:05] [INFO ] Deduced a trap composed of 341 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:18:06] [INFO ] Deduced a trap composed of 421 places in 297 ms of which 5 ms to minimize.
[2024-05-27 21:18:06] [INFO ] Deduced a trap composed of 355 places in 279 ms of which 4 ms to minimize.
[2024-05-27 21:18:06] [INFO ] Deduced a trap composed of 427 places in 290 ms of which 12 ms to minimize.
[2024-05-27 21:18:06] [INFO ] Deduced a trap composed of 353 places in 261 ms of which 4 ms to minimize.
[2024-05-27 21:18:07] [INFO ] Deduced a trap composed of 373 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:18:07] [INFO ] Deduced a trap composed of 353 places in 256 ms of which 4 ms to minimize.
SMT process timed out in 41705ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41720ms
[2024-05-27 21:18:07] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:18:07] [INFO ] Invariant cache hit.
[2024-05-27 21:18:07] [INFO ] Implicit Places using invariants in 382 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 390 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/614 places, 1098/1114 transitions.
Applied a total of 0 rules in 12 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42182 ms. Remains : 588/614 places, 1098/1114 transitions.
Support contains 162 out of 588 places after structural reductions.
[2024-05-27 21:18:08] [INFO ] Flatten gal took : 146 ms
[2024-05-27 21:18:08] [INFO ] Flatten gal took : 134 ms
[2024-05-27 21:18:08] [INFO ] Input system was already deterministic with 1098 transitions.
RANDOM walk for 40000 steps (13 resets) in 698 ms. (57 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40001 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2024-05-27 21:18:08] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-27 21:18:08] [INFO ] Computed 40 invariants in 18 ms
[2024-05-27 21:18:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 462/470 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 30/500 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/584 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:18:09] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:18:09] [INFO ] Deduced a trap composed of 307 places in 243 ms of which 10 ms to minimize.
[2024-05-27 21:18:10] [INFO ] Deduced a trap composed of 128 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:18:10] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 4 ms to minimize.
[2024-05-27 21:18:10] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 3 ms to minimize.
[2024-05-27 21:18:10] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 4 ms to minimize.
[2024-05-27 21:18:11] [INFO ] Deduced a trap composed of 378 places in 278 ms of which 4 ms to minimize.
[2024-05-27 21:18:11] [INFO ] Deduced a trap composed of 343 places in 234 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/586 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1668/1670 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 586/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 462/470 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/500 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/584 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:18:12] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:18:12] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/586 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1082/1668 variables, 586/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1668 variables, 96/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1668 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1668 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 734 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 588/588 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 5281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 137 ms.
Support contains 8 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 588 transition count 1042
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 532 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 468 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 368 place count 404 transition count 914
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 376 place count 396 transition count 906
Iterating global reduction 2 with 8 rules applied. Total rules applied 384 place count 396 transition count 906
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 400 place count 396 transition count 890
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 416 place count 380 transition count 890
Applied a total of 416 rules in 170 ms. Remains 380 /588 variables (removed 208) and now considering 890/1098 (removed 208) transitions.
Running 888 sub problems to find dead transitions.
[2024-05-27 21:18:14] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
// Phase 1: matrix 874 rows 380 cols
[2024-05-27 21:18:14] [INFO ] Computed 40 invariants in 21 ms
[2024-05-27 21:18:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-27 21:18:21] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-05-27 21:18:21] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-05-27 21:18:21] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:18:21] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-05-27 21:18:22] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:18:22] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:18:22] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:18:22] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:18:22] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 2 ms to minimize.
[2024-05-27 21:18:23] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:18:27] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:18:27] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:18:28] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-05-27 21:18:28] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-27 21:18:31] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2024-05-27 21:18:31] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 54 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-27 21:18:45] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 2 ms to minimize.
[2024-05-27 21:18:45] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 3 ms to minimize.
[2024-05-27 21:18:46] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2024-05-27 21:18:46] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 58 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 20/20 constraints]
After SMT, in 41885ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 41903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42082 ms. Remains : 380/588 places, 890/1098 transitions.
RANDOM walk for 40000 steps (15 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 340312 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 340312 steps, saw 181349 distinct states, run finished after 3009 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-27 21:18:59] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-27 21:18:59] [INFO ] Invariant cache hit.
[2024-05-27 21:18:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:19:00] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-27 21:19:00] [INFO ] Deduced a trap composed of 38 places in 405 ms of which 1 ms to minimize.
[2024-05-27 21:19:00] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:19:00] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-05-27 21:19:00] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:19:00] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/375 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/378 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 874/1252 variables, 378/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 96/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1254 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1254 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:19:01] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/375 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/378 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 874/1252 variables, 378/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 96/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1252 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1254 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1254 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1254 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3223ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 20 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 380/380 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 19 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-27 21:19:02] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-27 21:19:02] [INFO ] Invariant cache hit.
[2024-05-27 21:19:03] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-27 21:19:03] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-27 21:19:03] [INFO ] Invariant cache hit.
[2024-05-27 21:19:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:19:07] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned []
Implicit Place search using SMT with State Equation took 4483 ms to find 0 implicit places.
[2024-05-27 21:19:07] [INFO ] Redundant transitions in 78 ms returned []
Running 888 sub problems to find dead transitions.
[2024-05-27 21:19:07] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-27 21:19:07] [INFO ] Invariant cache hit.
[2024-05-27 21:19:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:19:13] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:19:14] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:19:14] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 2 ms to minimize.
[2024-05-27 21:19:14] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 2 ms to minimize.
[2024-05-27 21:19:15] [INFO ] Deduced a trap composed of 140 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:19:15] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 2 ms to minimize.
[2024-05-27 21:19:15] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:19:15] [INFO ] Deduced a trap composed of 144 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:19:15] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:19:16] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:19:21] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 2 ms to minimize.
[2024-05-27 21:19:21] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 2 ms to minimize.
[2024-05-27 21:19:21] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 2 ms to minimize.
[2024-05-27 21:19:22] [INFO ] Deduced a trap composed of 149 places in 181 ms of which 2 ms to minimize.
[2024-05-27 21:19:22] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-27 21:19:25] [INFO ] Deduced a trap composed of 218 places in 176 ms of which 2 ms to minimize.
[2024-05-27 21:19:28] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 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 Real declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-27 21:19:45] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
SMT process timed out in 61671ms, After SMT, problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66301 ms. Remains : 380/380 places, 890/890 transitions.
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(X(G(p0))))'
Support contains 8 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:20:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-27 21:20:09] [INFO ] Computed 40 invariants in 19 ms
[2024-05-27 21:20:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:20:19] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-27 21:20:19] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-27 21:20:19] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:20:19] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:20:19] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:20:19] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:20:20] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:20:20] [INFO ] Deduced a trap composed of 325 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:20:20] [INFO ] Deduced a trap composed of 165 places in 256 ms of which 3 ms to minimize.
[2024-05-27 21:20:20] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:20:21] [INFO ] Deduced a trap composed of 346 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:20:21] [INFO ] Deduced a trap composed of 308 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:20:22] [INFO ] Deduced a trap composed of 307 places in 222 ms of which 4 ms to minimize.
[2024-05-27 21:20:22] [INFO ] Deduced a trap composed of 313 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:20:22] [INFO ] Deduced a trap composed of 299 places in 217 ms of which 3 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 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:20:32] [INFO ] Deduced a trap composed of 353 places in 255 ms of which 4 ms to minimize.
[2024-05-27 21:20:33] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-27 21:20:33] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-27 21:20:38] [INFO ] Deduced a trap composed of 324 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:20:38] [INFO ] Deduced a trap composed of 311 places in 215 ms of which 4 ms to minimize.
[2024-05-27 21:20:42] [INFO ] Deduced a trap composed of 313 places in 207 ms of which 4 ms to minimize.
[2024-05-27 21:20:43] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41675ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41695ms
[2024-05-27 21:20:51] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:20:51] [INFO ] Invariant cache hit.
[2024-05-27 21:20:51] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-27 21:20:51] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:20:51] [INFO ] Invariant cache hit.
[2024-05-27 21:20:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:20:59] [INFO ] Implicit Places using invariants and state equation in 8328 ms returned []
Implicit Place search using SMT with State Equation took 8703 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:20:59] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:20:59] [INFO ] Invariant cache hit.
[2024-05-27 21:20:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
[2024-05-27 21:21:09] [INFO ] Deduced a trap composed of 334 places in 209 ms of which 4 ms to minimize.
[2024-05-27 21:21:10] [INFO ] Deduced a trap composed of 339 places in 275 ms of which 4 ms to minimize.
[2024-05-27 21:21:10] [INFO ] Deduced a trap composed of 183 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:21:10] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 314 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:21:11] [INFO ] Deduced a trap composed of 334 places in 284 ms of which 3 ms to minimize.
[2024-05-27 21:21:12] [INFO ] Deduced a trap composed of 351 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:21:12] [INFO ] Deduced a trap composed of 338 places in 268 ms of which 3 ms to minimize.
[2024-05-27 21:21:12] [INFO ] Deduced a trap composed of 307 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:21:12] [INFO ] Deduced a trap composed of 324 places in 273 ms of which 4 ms to minimize.
[2024-05-27 21:21:13] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 4 ms to minimize.
[2024-05-27 21:21:13] [INFO ] Deduced a trap composed of 307 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:14] [INFO ] Deduced a trap composed of 283 places in 197 ms of which 3 ms to minimize.
[2024-05-27 21:21:14] [INFO ] Deduced a trap composed of 353 places in 220 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:41] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:21:51] [INFO ] Deduced a trap composed of 299 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:21:51] [INFO ] Deduced a trap composed of 397 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:21:52] [INFO ] Deduced a trap composed of 408 places in 228 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61302ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61318ms
Finished structural reductions in LTL mode , in 1 iterations and 111740 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-00 finished in 112054 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(X(F((p0 U (!X(p0) U p1)))))))'
Support contains 9 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 588 transition count 1074
Reduce places removed 24 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 40 rules applied. Total rules applied 64 place count 564 transition count 1058
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 80 place count 548 transition count 1058
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 80 place count 548 transition count 986
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 224 place count 476 transition count 986
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 304 place count 436 transition count 946
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 428 transition count 938
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 428 transition count 938
Applied a total of 320 rules in 165 ms. Remains 428 /588 variables (removed 160) and now considering 938/1098 (removed 160) transitions.
Running 936 sub problems to find dead transitions.
[2024-05-27 21:22:01] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 428 cols
[2024-05-27 21:22:01] [INFO ] Computed 40 invariants in 26 ms
[2024-05-27 21:22:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:22:09] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:22:10] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:22:10] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-27 21:22:10] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:22:10] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:22:10] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:22:10] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:22:12] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-05-27 21:22:13] [INFO ] Deduced a trap composed of 156 places in 180 ms of which 2 ms to minimize.
[2024-05-27 21:22:13] [INFO ] Deduced a trap composed of 163 places in 184 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:22:18] [INFO ] Deduced a trap composed of 266 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 49 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:22:27] [INFO ] Deduced a trap composed of 180 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:22:27] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-27 21:22:33] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1350 variables, and 52 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 14/14 constraints]
After SMT, in 41498ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 41516ms
[2024-05-27 21:22:43] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-05-27 21:22:43] [INFO ] Invariant cache hit.
[2024-05-27 21:22:43] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-27 21:22:43] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-05-27 21:22:43] [INFO ] Invariant cache hit.
[2024-05-27 21:22:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:22:48] [INFO ] Implicit Places using invariants and state equation in 5041 ms returned []
Implicit Place search using SMT with State Equation took 5388 ms to find 0 implicit places.
[2024-05-27 21:22:48] [INFO ] Redundant transitions in 14 ms returned []
Running 936 sub problems to find dead transitions.
[2024-05-27 21:22:48] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-05-27 21:22:48] [INFO ] Invariant cache hit.
[2024-05-27 21:22:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:22:55] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:22:56] [INFO ] Deduced a trap composed of 179 places in 169 ms of which 2 ms to minimize.
[2024-05-27 21:22:56] [INFO ] Deduced a trap composed of 179 places in 162 ms of which 2 ms to minimize.
[2024-05-27 21:22:56] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-05-27 21:22:57] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 149 places in 236 ms of which 2 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-05-27 21:23:00] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:23:11] [INFO ] Deduced a trap composed of 207 places in 193 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 53 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 936 unsolved
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 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
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 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
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/427 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 888 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/54 constraints. Problems are: Problem set: 48 solved, 888 unsolved
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 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 TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/428 variables, 1/55 constraints. Problems are: Problem set: 88 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1350 variables, and 55 constraints, problems are : Problem set: 88 solved, 848 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 15/15 constraints]
After SMT, in 61351ms problems are : Problem set: 88 solved, 848 unsolved
Search for dead transitions found 88 dead transitions in 61368ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 428/588 places, 850/1098 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 410 transition count 818
Applied a total of 16 rules in 17 ms. Remains 410 /428 variables (removed 18) and now considering 818/850 (removed 32) transitions.
[2024-05-27 21:23:50] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
// Phase 1: matrix 802 rows 410 cols
[2024-05-27 21:23:50] [INFO ] Computed 40 invariants in 8 ms
[2024-05-27 21:23:50] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-27 21:23:50] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:23:50] [INFO ] Invariant cache hit.
[2024-05-27 21:23:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:23:53] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 410/588 places, 818/1098 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112332 ms. Remains : 410/588 places, 818/1098 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-01
Product exploration explored 100000 steps with 10906 reset in 391 ms.
Product exploration explored 100000 steps with 10909 reset in 326 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 p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 289 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 141 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 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
[2024-05-27 21:23:55] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:23:55] [INFO ] Invariant cache hit.
[2024-05-27 21:23:55] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 21:23:55] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 84 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2024-05-27 21:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 80 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2024-05-27 21:23:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:23:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 133 ms returned sat
[2024-05-27 21:23:58] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 629 ms
[2024-05-27 21:23:59] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 424 transitions) in 56 ms.
[2024-05-27 21:24:01] [INFO ] Added : 126 causal constraints over 26 iterations in 1573 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 9 out of 410 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 818/818 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-27 21:24:01] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:24:01] [INFO ] Invariant cache hit.
[2024-05-27 21:24:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:05] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:24:05] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:24:06] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:24:06] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:24:06] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:24:06] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:24:07] [INFO ] Deduced a trap composed of 226 places in 145 ms of which 3 ms to minimize.
[2024-05-27 21:24:07] [INFO ] Deduced a trap composed of 193 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:24:07] [INFO ] Deduced a trap composed of 225 places in 153 ms of which 3 ms to minimize.
[2024-05-27 21:24:07] [INFO ] Deduced a trap composed of 239 places in 144 ms of which 2 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 230 places in 175 ms of which 2 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 230 places in 175 ms of which 3 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:24:08] [INFO ] Deduced a trap composed of 175 places in 143 ms of which 3 ms to minimize.
[2024-05-27 21:24:09] [INFO ] Deduced a trap composed of 180 places in 141 ms of which 2 ms to minimize.
[2024-05-27 21:24:09] [INFO ] Deduced a trap composed of 180 places in 140 ms of which 3 ms to minimize.
[2024-05-27 21:24:09] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:10] [INFO ] Deduced a trap composed of 191 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:24:10] [INFO ] Deduced a trap composed of 204 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:24:10] [INFO ] Deduced a trap composed of 217 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:24:11] [INFO ] Deduced a trap composed of 197 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:24:11] [INFO ] Deduced a trap composed of 219 places in 154 ms of which 3 ms to minimize.
[2024-05-27 21:24:11] [INFO ] Deduced a trap composed of 207 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:24:11] [INFO ] Deduced a trap composed of 203 places in 182 ms of which 2 ms to minimize.
[2024-05-27 21:24:11] [INFO ] Deduced a trap composed of 218 places in 139 ms of which 2 ms to minimize.
[2024-05-27 21:24:12] [INFO ] Deduced a trap composed of 200 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:24:12] [INFO ] Deduced a trap composed of 214 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:24:12] [INFO ] Deduced a trap composed of 208 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:24:12] [INFO ] Deduced a trap composed of 221 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:24:13] [INFO ] Deduced a trap composed of 209 places in 220 ms of which 2 ms to minimize.
[2024-05-27 21:24:13] [INFO ] Deduced a trap composed of 193 places in 182 ms of which 2 ms to minimize.
[2024-05-27 21:24:13] [INFO ] Deduced a trap composed of 190 places in 197 ms of which 4 ms to minimize.
[2024-05-27 21:24:14] [INFO ] Deduced a trap composed of 248 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:24:15] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:24:15] [INFO ] Deduced a trap composed of 124 places in 198 ms of which 2 ms to minimize.
[2024-05-27 21:24:16] [INFO ] Deduced a trap composed of 138 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:24:16] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/1212 variables, and 78 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/410 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 40/78 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:23] [INFO ] Deduced a trap composed of 172 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:24:23] [INFO ] Deduced a trap composed of 178 places in 146 ms of which 3 ms to minimize.
[2024-05-27 21:24:23] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:24:24] [INFO ] Deduced a trap composed of 169 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 189 places in 191 ms of which 2 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 209 places in 174 ms of which 3 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 217 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:24:25] [INFO ] Deduced a trap composed of 195 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:24:26] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 3 ms to minimize.
[2024-05-27 21:24:26] [INFO ] Deduced a trap composed of 225 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 5 ms to minimize.
[2024-05-27 21:24:29] [INFO ] Deduced a trap composed of 155 places in 249 ms of which 4 ms to minimize.
[2024-05-27 21:24:29] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:24:29] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 3 ms to minimize.
[2024-05-27 21:24:29] [INFO ] Deduced a trap composed of 144 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:24:30] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 2 ms to minimize.
[2024-05-27 21:24:30] [INFO ] Deduced a trap composed of 179 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:24:30] [INFO ] Deduced a trap composed of 206 places in 204 ms of which 7 ms to minimize.
[2024-05-27 21:24:30] [INFO ] Deduced a trap composed of 186 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:32] [INFO ] Deduced a trap composed of 184 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:24:32] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:24:33] [INFO ] Deduced a trap composed of 197 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:24:33] [INFO ] Deduced a trap composed of 228 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:24:33] [INFO ] Deduced a trap composed of 207 places in 158 ms of which 2 ms to minimize.
[2024-05-27 21:24:33] [INFO ] Deduced a trap composed of 203 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:24:33] [INFO ] Deduced a trap composed of 211 places in 154 ms of which 2 ms to minimize.
[2024-05-27 21:24:33] [INFO ] Deduced a trap composed of 202 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:24:34] [INFO ] Deduced a trap composed of 219 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:24:34] [INFO ] Deduced a trap composed of 195 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:24:34] [INFO ] Deduced a trap composed of 194 places in 169 ms of which 2 ms to minimize.
[2024-05-27 21:24:34] [INFO ] Deduced a trap composed of 182 places in 179 ms of which 3 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 3 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 3 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 200 places in 166 ms of which 3 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 210 places in 148 ms of which 3 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 209 places in 208 ms of which 3 ms to minimize.
[2024-05-27 21:24:36] [INFO ] Deduced a trap composed of 190 places in 175 ms of which 3 ms to minimize.
[2024-05-27 21:24:36] [INFO ] Deduced a trap composed of 193 places in 168 ms of which 3 ms to minimize.
[2024-05-27 21:24:36] [INFO ] Deduced a trap composed of 193 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:39] [INFO ] Deduced a trap composed of 212 places in 221 ms of which 4 ms to minimize.
[2024-05-27 21:24:39] [INFO ] Deduced a trap composed of 195 places in 194 ms of which 3 ms to minimize.
[2024-05-27 21:24:39] [INFO ] Deduced a trap composed of 214 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:24:39] [INFO ] Deduced a trap composed of 192 places in 192 ms of which 2 ms to minimize.
[2024-05-27 21:24:40] [INFO ] Deduced a trap composed of 193 places in 186 ms of which 2 ms to minimize.
[2024-05-27 21:24:40] [INFO ] Deduced a trap composed of 217 places in 147 ms of which 3 ms to minimize.
[2024-05-27 21:24:40] [INFO ] Deduced a trap composed of 210 places in 146 ms of which 2 ms to minimize.
[2024-05-27 21:24:40] [INFO ] Deduced a trap composed of 207 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:24:41] [INFO ] Deduced a trap composed of 224 places in 128 ms of which 2 ms to minimize.
[2024-05-27 21:24:41] [INFO ] Deduced a trap composed of 208 places in 198 ms of which 3 ms to minimize.
[2024-05-27 21:24:41] [INFO ] Deduced a trap composed of 224 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:24:41] [INFO ] Deduced a trap composed of 218 places in 196 ms of which 4 ms to minimize.
[2024-05-27 21:24:41] [INFO ] Deduced a trap composed of 209 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 40887ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40897ms
[2024-05-27 21:24:41] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:24:41] [INFO ] Invariant cache hit.
[2024-05-27 21:24:42] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-27 21:24:42] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:24:42] [INFO ] Invariant cache hit.
[2024-05-27 21:24:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:24:45] [INFO ] Implicit Places using invariants and state equation in 3594 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
[2024-05-27 21:24:46] [INFO ] Redundant transitions in 57 ms returned []
Running 816 sub problems to find dead transitions.
[2024-05-27 21:24:46] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:24:46] [INFO ] Invariant cache hit.
[2024-05-27 21:24:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:51] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:24:51] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:24:51] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-27 21:24:52] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:24:53] [INFO ] Deduced a trap composed of 226 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:24:53] [INFO ] Deduced a trap composed of 193 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:24:53] [INFO ] Deduced a trap composed of 225 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:24:53] [INFO ] Deduced a trap composed of 239 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 234 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 230 places in 158 ms of which 2 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 230 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:24:55] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 2 ms to minimize.
[2024-05-27 21:24:55] [INFO ] Deduced a trap composed of 180 places in 155 ms of which 3 ms to minimize.
[2024-05-27 21:24:55] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 2 ms to minimize.
[2024-05-27 21:24:55] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:24:56] [INFO ] Deduced a trap composed of 191 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:24:56] [INFO ] Deduced a trap composed of 204 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:24:57] [INFO ] Deduced a trap composed of 217 places in 193 ms of which 3 ms to minimize.
[2024-05-27 21:24:57] [INFO ] Deduced a trap composed of 197 places in 189 ms of which 3 ms to minimize.
[2024-05-27 21:24:57] [INFO ] Deduced a trap composed of 219 places in 179 ms of which 3 ms to minimize.
[2024-05-27 21:24:57] [INFO ] Deduced a trap composed of 207 places in 178 ms of which 2 ms to minimize.
[2024-05-27 21:24:57] [INFO ] Deduced a trap composed of 203 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:24:58] [INFO ] Deduced a trap composed of 218 places in 167 ms of which 2 ms to minimize.
[2024-05-27 21:24:58] [INFO ] Deduced a trap composed of 200 places in 157 ms of which 2 ms to minimize.
[2024-05-27 21:24:58] [INFO ] Deduced a trap composed of 214 places in 151 ms of which 3 ms to minimize.
[2024-05-27 21:24:58] [INFO ] Deduced a trap composed of 208 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:24:58] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:24:59] [INFO ] Deduced a trap composed of 209 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:24:59] [INFO ] Deduced a trap composed of 193 places in 190 ms of which 3 ms to minimize.
[2024-05-27 21:24:59] [INFO ] Deduced a trap composed of 190 places in 157 ms of which 3 ms to minimize.
[2024-05-27 21:25:01] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 3 ms to minimize.
[2024-05-27 21:25:02] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:25:02] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:25:02] [INFO ] Deduced a trap composed of 138 places in 227 ms of which 3 ms to minimize.
[2024-05-27 21:25:02] [INFO ] Deduced a trap composed of 124 places in 174 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:25:08] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:25:08] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:25:08] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 3 ms to minimize.
[2024-05-27 21:25:08] [INFO ] Deduced a trap composed of 210 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:25:08] [INFO ] Deduced a trap composed of 187 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:25:09] [INFO ] Deduced a trap composed of 194 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:25:09] [INFO ] Deduced a trap composed of 192 places in 162 ms of which 3 ms to minimize.
[2024-05-27 21:25:09] [INFO ] Deduced a trap composed of 233 places in 146 ms of which 2 ms to minimize.
[2024-05-27 21:25:10] [INFO ] Deduced a trap composed of 189 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:25:10] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:25:11] [INFO ] Deduced a trap composed of 177 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:25:11] [INFO ] Deduced a trap composed of 195 places in 231 ms of which 4 ms to minimize.
[2024-05-27 21:25:11] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 3 ms to minimize.
[2024-05-27 21:25:11] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:25:12] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:25:12] [INFO ] Deduced a trap composed of 186 places in 173 ms of which 2 ms to minimize.
[2024-05-27 21:25:12] [INFO ] Deduced a trap composed of 200 places in 183 ms of which 3 ms to minimize.
[2024-05-27 21:25:12] [INFO ] Deduced a trap composed of 124 places in 245 ms of which 3 ms to minimize.
[2024-05-27 21:25:12] [INFO ] Deduced a trap composed of 169 places in 180 ms of which 3 ms to minimize.
[2024-05-27 21:25:13] [INFO ] Deduced a trap composed of 182 places in 210 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-27 21:25:14] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 2 ms to minimize.
[2024-05-27 21:25:14] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 2 ms to minimize.
[2024-05-27 21:25:14] [INFO ] Deduced a trap composed of 181 places in 189 ms of which 3 ms to minimize.
[2024-05-27 21:25:14] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:25:14] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 2 ms to minimize.
[2024-05-27 21:25:15] [INFO ] Deduced a trap composed of 183 places in 142 ms of which 2 ms to minimize.
[2024-05-27 21:25:15] [INFO ] Deduced a trap composed of 199 places in 146 ms of which 2 ms to minimize.
[2024-05-27 21:25:15] [INFO ] Deduced a trap composed of 179 places in 188 ms of which 2 ms to minimize.
[2024-05-27 21:25:15] [INFO ] Deduced a trap composed of 194 places in 161 ms of which 2 ms to minimize.
[2024-05-27 21:25:15] [INFO ] Deduced a trap composed of 193 places in 251 ms of which 6 ms to minimize.
[2024-05-27 21:25:16] [INFO ] Deduced a trap composed of 183 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:25:16] [INFO ] Deduced a trap composed of 199 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:25:16] [INFO ] Deduced a trap composed of 223 places in 204 ms of which 3 ms to minimize.
[2024-05-27 21:25:17] [INFO ] Deduced a trap composed of 195 places in 217 ms of which 2 ms to minimize.
SMT process timed out in 30981ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 30993ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75969 ms. Remains : 410/410 places, 818/818 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 p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 189 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 106 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 172 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 96 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1)]
[2024-05-27 21:25:17] [INFO ] Flow matrix only has 802 transitions (discarded 16 similar events)
[2024-05-27 21:25:17] [INFO ] Invariant cache hit.
[2024-05-27 21:25:18] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 21:25:18] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 65 ms returned sat
[2024-05-27 21:25:19] [INFO ] [Real]Absence check using state equation in 1523 ms returned sat
[2024-05-27 21:25:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:25:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 21:25:20] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 114 ms returned sat
[2024-05-27 21:25:21] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2024-05-27 21:25:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:25:21] [INFO ] [Nat]Added 96 Read/Feed constraints in 109 ms returned sat
[2024-05-27 21:25:21] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2024-05-27 21:25:21] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:25:22] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:25:22] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:25:22] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:25:22] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:25:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 802 ms
[2024-05-27 21:25:22] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 424 transitions) in 93 ms.
[2024-05-27 21:25:24] [INFO ] Added : 126 causal constraints over 26 iterations in 1656 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10848 reset in 377 ms.
Product exploration explored 100000 steps with 10501 reset in 331 ms.
Support contains 9 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 410 transition count 810
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 402 transition count 810
Applied a total of 16 rules in 22 ms. Remains 402 /410 variables (removed 8) and now considering 810/818 (removed 8) transitions.
Running 808 sub problems to find dead transitions.
[2024-05-27 21:25:25] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2024-05-27 21:25:25] [INFO ] Computed 40 invariants in 29 ms
[2024-05-27 21:25:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:25:32] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-05-27 21:25:32] [INFO ] Deduced a trap composed of 218 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:25:32] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:25:32] [INFO ] Deduced a trap composed of 212 places in 227 ms of which 2 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 206 places in 280 ms of which 2 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 199 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:25:33] [INFO ] Deduced a trap composed of 197 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 219 places in 173 ms of which 3 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 231 places in 205 ms of which 3 ms to minimize.
[2024-05-27 21:25:34] [INFO ] Deduced a trap composed of 200 places in 170 ms of which 2 ms to minimize.
[2024-05-27 21:25:35] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:25:35] [INFO ] Deduced a trap composed of 202 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:25:35] [INFO ] Deduced a trap composed of 205 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:25:35] [INFO ] Deduced a trap composed of 250 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:25:37] [INFO ] Deduced a trap composed of 195 places in 141 ms of which 3 ms to minimize.
[2024-05-27 21:25:37] [INFO ] Deduced a trap composed of 195 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:25:38] [INFO ] Deduced a trap composed of 192 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:25:38] [INFO ] Deduced a trap composed of 180 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:25:38] [INFO ] Deduced a trap composed of 216 places in 170 ms of which 3 ms to minimize.
[2024-05-27 21:25:38] [INFO ] Deduced a trap composed of 171 places in 173 ms of which 3 ms to minimize.
[2024-05-27 21:25:38] [INFO ] Deduced a trap composed of 216 places in 160 ms of which 2 ms to minimize.
[2024-05-27 21:25:39] [INFO ] Deduced a trap composed of 177 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:25:39] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:25:39] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:25:39] [INFO ] Deduced a trap composed of 209 places in 166 ms of which 3 ms to minimize.
[2024-05-27 21:25:39] [INFO ] Deduced a trap composed of 190 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:25:40] [INFO ] Deduced a trap composed of 220 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:25:40] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 2 ms to minimize.
[2024-05-27 21:25:40] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:25:40] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 2 ms to minimize.
[2024-05-27 21:25:40] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-27 21:25:41] [INFO ] Deduced a trap composed of 190 places in 154 ms of which 2 ms to minimize.
[2024-05-27 21:25:41] [INFO ] Deduced a trap composed of 196 places in 154 ms of which 2 ms to minimize.
[2024-05-27 21:25:41] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 2 ms to minimize.
(s110 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.0)
(s7 0.0)
(s8 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1196 variables, and 78 constraints, problems are : Problem set: 0 solved, 808 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/402 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/78 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:25:47] [INFO ] Deduced a trap composed of 174 places in 275 ms of which 3 ms to minimize.
[2024-05-27 21:25:47] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 3 ms to minimize.
[2024-05-27 21:25:47] [INFO ] Deduced a trap composed of 199 places in 134 ms of which 2 ms to minimize.
[2024-05-27 21:25:48] [INFO ] Deduced a trap composed of 217 places in 157 ms of which 2 ms to minimize.
[2024-05-27 21:25:48] [INFO ] Deduced a trap composed of 197 places in 197 ms of which 3 ms to minimize.
[2024-05-27 21:25:48] [INFO ] Deduced a trap composed of 205 places in 189 ms of which 3 ms to minimize.
[2024-05-27 21:25:48] [INFO ] Deduced a trap composed of 208 places in 170 ms of which 2 ms to minimize.
[2024-05-27 21:25:49] [INFO ] Deduced a trap composed of 213 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:25:49] [INFO ] Deduced a trap composed of 203 places in 190 ms of which 2 ms to minimize.
[2024-05-27 21:25:49] [INFO ] Deduced a trap composed of 225 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:25:49] [INFO ] Deduced a trap composed of 207 places in 155 ms of which 3 ms to minimize.
[2024-05-27 21:25:49] [INFO ] Deduced a trap composed of 218 places in 209 ms of which 2 ms to minimize.
[2024-05-27 21:25:50] [INFO ] Deduced a trap composed of 196 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:25:50] [INFO ] Deduced a trap composed of 213 places in 146 ms of which 2 ms to minimize.
[2024-05-27 21:25:50] [INFO ] Deduced a trap composed of 213 places in 183 ms of which 3 ms to minimize.
[2024-05-27 21:25:50] [INFO ] Deduced a trap composed of 202 places in 155 ms of which 3 ms to minimize.
[2024-05-27 21:25:50] [INFO ] Deduced a trap composed of 212 places in 153 ms of which 2 ms to minimize.
[2024-05-27 21:25:51] [INFO ] Deduced a trap composed of 210 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:25:51] [INFO ] Deduced a trap composed of 194 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:25:51] [INFO ] Deduced a trap composed of 241 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:25:52] [INFO ] Deduced a trap composed of 189 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:25:52] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 2 ms to minimize.
[2024-05-27 21:25:52] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:25:52] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-05-27 21:25:52] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:25:53] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 3 ms to minimize.
[2024-05-27 21:25:53] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 2 ms to minimize.
[2024-05-27 21:25:53] [INFO ] Deduced a trap composed of 186 places in 135 ms of which 3 ms to minimize.
[2024-05-27 21:25:53] [INFO ] Deduced a trap composed of 205 places in 198 ms of which 3 ms to minimize.
[2024-05-27 21:25:53] [INFO ] Deduced a trap composed of 212 places in 170 ms of which 2 ms to minimize.
[2024-05-27 21:25:54] [INFO ] Deduced a trap composed of 191 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:25:54] [INFO ] Deduced a trap composed of 207 places in 151 ms of which 2 ms to minimize.
[2024-05-27 21:25:54] [INFO ] Deduced a trap composed of 209 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:25:54] [INFO ] Deduced a trap composed of 202 places in 151 ms of which 2 ms to minimize.
[2024-05-27 21:25:54] [INFO ] Deduced a trap composed of 190 places in 198 ms of which 3 ms to minimize.
[2024-05-27 21:25:54] [INFO ] Deduced a trap composed of 257 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:25:55] [INFO ] Deduced a trap composed of 192 places in 151 ms of which 3 ms to minimize.
[2024-05-27 21:25:55] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:25:55] [INFO ] Deduced a trap composed of 192 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:25:55] [INFO ] Deduced a trap composed of 199 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:25:56] [INFO ] Deduced a trap composed of 171 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:25:56] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 3 ms to minimize.
[2024-05-27 21:25:57] [INFO ] Deduced a trap composed of 189 places in 136 ms of which 2 ms to minimize.
[2024-05-27 21:25:57] [INFO ] Deduced a trap composed of 200 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:25:57] [INFO ] Deduced a trap composed of 170 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:25:57] [INFO ] Deduced a trap composed of 213 places in 184 ms of which 3 ms to minimize.
[2024-05-27 21:25:57] [INFO ] Deduced a trap composed of 214 places in 174 ms of which 3 ms to minimize.
[2024-05-27 21:25:57] [INFO ] Deduced a trap composed of 212 places in 142 ms of which 2 ms to minimize.
[2024-05-27 21:25:58] [INFO ] Deduced a trap composed of 200 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:25:58] [INFO ] Deduced a trap composed of 198 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:25:58] [INFO ] Deduced a trap composed of 202 places in 146 ms of which 2 ms to minimize.
[2024-05-27 21:25:58] [INFO ] Deduced a trap composed of 207 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:25:58] [INFO ] Deduced a trap composed of 204 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:25:59] [INFO ] Deduced a trap composed of 185 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:25:59] [INFO ] Deduced a trap composed of 221 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:25:59] [INFO ] Deduced a trap composed of 189 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:25:59] [INFO ] Deduced a trap composed of 229 places in 149 ms of which 2 ms to minimize.
[2024-05-27 21:25:59] [INFO ] Deduced a trap composed of 221 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:26:00] [INFO ] Deduced a trap composed of 204 places in 140 ms of which 2 ms to minimize.
[2024-05-27 21:26:00] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:26:01] [INFO ] Deduced a trap composed of 192 places in 241 ms of which 2 ms to minimize.
[2024-05-27 21:26:02] [INFO ] Deduced a trap composed of 144 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:26:02] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-05-27 21:26:03] [INFO ] Deduced a trap composed of 207 places in 234 ms of which 6 ms to minimize.
[2024-05-27 21:26:03] [INFO ] Deduced a trap composed of 211 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:26:03] [INFO ] Deduced a trap composed of 199 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:26:04] [INFO ] Deduced a trap composed of 203 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:26:04] [INFO ] Deduced a trap composed of 215 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:26:04] [INFO ] Deduced a trap composed of 214 places in 204 ms of which 2 ms to minimize.
[2024-05-27 21:26:04] [INFO ] Deduced a trap composed of 208 places in 210 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 199 places in 186 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 198 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 224 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 211 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:26:06] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 3 ms to minimize.
SMT process timed out in 40996ms, After SMT, problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 41007ms
[2024-05-27 21:26:06] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
[2024-05-27 21:26:06] [INFO ] Invariant cache hit.
[2024-05-27 21:26:06] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-27 21:26:06] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
[2024-05-27 21:26:06] [INFO ] Invariant cache hit.
[2024-05-27 21:26:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:26:09] [INFO ] Implicit Places using invariants and state equation in 3352 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
[2024-05-27 21:26:09] [INFO ] Redundant transitions in 14 ms returned []
Running 808 sub problems to find dead transitions.
[2024-05-27 21:26:09] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
[2024-05-27 21:26:09] [INFO ] Invariant cache hit.
[2024-05-27 21:26:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 232 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 226 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 224 places in 181 ms of which 3 ms to minimize.
[2024-05-27 21:26:15] [INFO ] Deduced a trap composed of 220 places in 153 ms of which 3 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 229 places in 146 ms of which 2 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 223 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 189 places in 208 ms of which 2 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 187 places in 170 ms of which 2 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:26:16] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 175 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 190 places in 151 ms of which 2 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 176 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-05-27 21:26:17] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:26:18] [INFO ] Deduced a trap composed of 209 places in 173 ms of which 3 ms to minimize.
[2024-05-27 21:26:19] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:26:19] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:26:19] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:26:19] [INFO ] Deduced a trap composed of 161 places in 135 ms of which 2 ms to minimize.
[2024-05-27 21:26:20] [INFO ] Deduced a trap composed of 204 places in 131 ms of which 2 ms to minimize.
[2024-05-27 21:26:21] [INFO ] Deduced a trap composed of 195 places in 142 ms of which 2 ms to minimize.
[2024-05-27 21:26:21] [INFO ] Deduced a trap composed of 198 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:26:21] [INFO ] Deduced a trap composed of 214 places in 142 ms of which 17 ms to minimize.
[2024-05-27 21:26:21] [INFO ] Deduced a trap composed of 222 places in 139 ms of which 2 ms to minimize.
[2024-05-27 21:26:21] [INFO ] Deduced a trap composed of 218 places in 194 ms of which 3 ms to minimize.
[2024-05-27 21:26:21] [INFO ] Deduced a trap composed of 222 places in 142 ms of which 3 ms to minimize.
[2024-05-27 21:26:22] [INFO ] Deduced a trap composed of 215 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:26:22] [INFO ] Deduced a trap composed of 189 places in 154 ms of which 3 ms to minimize.
[2024-05-27 21:26:22] [INFO ] Deduced a trap composed of 201 places in 152 ms of which 3 ms to minimize.
[2024-05-27 21:26:22] [INFO ] Deduced a trap composed of 221 places in 153 ms of which 3 ms to minimize.
[2024-05-27 21:26:22] [INFO ] Deduced a trap composed of 211 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:26:23] [INFO ] Deduced a trap composed of 206 places in 177 ms of which 2 ms to minimize.
[2024-05-27 21:26:23] [INFO ] Deduced a trap composed of 234 places in 158 ms of which 2 ms to minimize.
[2024-05-27 21:26:23] [INFO ] Deduced a trap composed of 217 places in 168 ms of which 14 ms to minimize.
[2024-05-27 21:26:23] [INFO ] Deduced a trap composed of 199 places in 198 ms of which 2 ms to minimize.
[2024-05-27 21:26:23] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:26:29] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-05-27 21:26:30] [INFO ] Deduced a trap composed of 189 places in 157 ms of which 2 ms to minimize.
[2024-05-27 21:26:30] [INFO ] Deduced a trap composed of 217 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:26:30] [INFO ] Deduced a trap composed of 217 places in 184 ms of which 3 ms to minimize.
[2024-05-27 21:26:30] [INFO ] Deduced a trap composed of 213 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:26:30] [INFO ] Deduced a trap composed of 221 places in 192 ms of which 2 ms to minimize.
[2024-05-27 21:26:31] [INFO ] Deduced a trap composed of 186 places in 162 ms of which 2 ms to minimize.
[2024-05-27 21:26:31] [INFO ] Deduced a trap composed of 217 places in 161 ms of which 2 ms to minimize.
[2024-05-27 21:26:31] [INFO ] Deduced a trap composed of 220 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:26:31] [INFO ] Deduced a trap composed of 213 places in 187 ms of which 3 ms to minimize.
[2024-05-27 21:26:31] [INFO ] Deduced a trap composed of 210 places in 187 ms of which 3 ms to minimize.
[2024-05-27 21:26:31] [INFO ] Deduced a trap composed of 231 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:26:32] [INFO ] Deduced a trap composed of 186 places in 205 ms of which 3 ms to minimize.
[2024-05-27 21:26:32] [INFO ] Deduced a trap composed of 183 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:26:32] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 3 ms to minimize.
[2024-05-27 21:26:32] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:26:33] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 3 ms to minimize.
[2024-05-27 21:26:33] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:26:33] [INFO ] Deduced a trap composed of 219 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:26:33] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-27 21:26:36] [INFO ] Deduced a trap composed of 178 places in 159 ms of which 3 ms to minimize.
[2024-05-27 21:26:37] [INFO ] Deduced a trap composed of 199 places in 165 ms of which 2 ms to minimize.
[2024-05-27 21:26:37] [INFO ] Deduced a trap composed of 291 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:26:37] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:26:37] [INFO ] Deduced a trap composed of 202 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:26:37] [INFO ] Deduced a trap composed of 226 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:26:38] [INFO ] Deduced a trap composed of 232 places in 167 ms of which 2 ms to minimize.
[2024-05-27 21:26:38] [INFO ] Deduced a trap composed of 235 places in 165 ms of which 3 ms to minimize.
[2024-05-27 21:26:38] [INFO ] Deduced a trap composed of 209 places in 236 ms of which 3 ms to minimize.
[2024-05-27 21:26:38] [INFO ] Deduced a trap composed of 197 places in 142 ms of which 2 ms to minimize.
[2024-05-27 21:26:38] [INFO ] Deduced a trap composed of 183 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:26:39] [INFO ] Deduced a trap composed of 183 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:26:39] [INFO ] Deduced a trap composed of 189 places in 139 ms of which 2 ms to minimize.
[2024-05-27 21:26:39] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:26:39] [INFO ] Deduced a trap composed of 185 places in 194 ms of which 3 ms to minimize.
[2024-05-27 21:26:40] [INFO ] Deduced a trap composed of 197 places in 150 ms of which 3 ms to minimize.
[2024-05-27 21:26:40] [INFO ] Deduced a trap composed of 157 places in 245 ms of which 3 ms to minimize.
[2024-05-27 21:26:40] [INFO ] Deduced a trap composed of 203 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:26:40] [INFO ] Deduced a trap composed of 185 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 30882ms, After SMT, problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 30897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 402/410 places, 810/818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75655 ms. Remains : 402/410 places, 810/818 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-01 finished in 279260 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((F(p0)&&X((!p0 U (p1||G(!p0)))))))'
Support contains 17 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 7 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:26:40] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-27 21:26:40] [INFO ] Computed 40 invariants in 31 ms
[2024-05-27 21:26:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 0 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 325 places in 424 ms of which 19 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 165 places in 395 ms of which 32 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:26:54] [INFO ] Deduced a trap composed of 346 places in 434 ms of which 4 ms to minimize.
[2024-05-27 21:26:55] [INFO ] Deduced a trap composed of 308 places in 265 ms of which 3 ms to minimize.
[2024-05-27 21:26:55] [INFO ] Deduced a trap composed of 307 places in 427 ms of which 20 ms to minimize.
[2024-05-27 21:26:56] [INFO ] Deduced a trap composed of 313 places in 432 ms of which 20 ms to minimize.
[2024-05-27 21:26:56] [INFO ] Deduced a trap composed of 299 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:27:04] [INFO ] Deduced a trap composed of 353 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:27:05] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 4 ms to minimize.
[2024-05-27 21:27:05] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-27 21:27:11] [INFO ] Deduced a trap composed of 324 places in 319 ms of which 3 ms to minimize.
[2024-05-27 21:27:11] [INFO ] Deduced a trap composed of 311 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:27:15] [INFO ] Deduced a trap composed of 313 places in 282 ms of which 4 ms to minimize.
[2024-05-27 21:27:16] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 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 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41676ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41688ms
[2024-05-27 21:27:22] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:27:22] [INFO ] Invariant cache hit.
[2024-05-27 21:27:22] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-27 21:27:22] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:27:22] [INFO ] Invariant cache hit.
[2024-05-27 21:27:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:27:31] [INFO ] Implicit Places using invariants and state equation in 8170 ms returned []
Implicit Place search using SMT with State Equation took 8568 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:27:31] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:27:31] [INFO ] Invariant cache hit.
[2024-05-27 21:27:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:27:41] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:27:41] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:27:41] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:27:41] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:27:42] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:27:42] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:27:42] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:27:42] [INFO ] Deduced a trap composed of 334 places in 305 ms of which 4 ms to minimize.
[2024-05-27 21:27:43] [INFO ] Deduced a trap composed of 339 places in 296 ms of which 4 ms to minimize.
[2024-05-27 21:27:43] [INFO ] Deduced a trap composed of 183 places in 281 ms of which 5 ms to minimize.
[2024-05-27 21:27:43] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:27:44] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:27:44] [INFO ] Deduced a trap composed of 314 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:27:44] [INFO ] Deduced a trap composed of 334 places in 223 ms of which 3 ms to minimize.
[2024-05-27 21:27:45] [INFO ] Deduced a trap composed of 351 places in 226 ms of which 4 ms to minimize.
[2024-05-27 21:27:45] [INFO ] Deduced a trap composed of 338 places in 295 ms of which 4 ms to minimize.
[2024-05-27 21:27:45] [INFO ] Deduced a trap composed of 307 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:27:46] [INFO ] Deduced a trap composed of 324 places in 300 ms of which 4 ms to minimize.
[2024-05-27 21:27:46] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 3 ms to minimize.
[2024-05-27 21:27:46] [INFO ] Deduced a trap composed of 307 places in 232 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:27:47] [INFO ] Deduced a trap composed of 283 places in 213 ms of which 4 ms to minimize.
[2024-05-27 21:27:48] [INFO ] Deduced a trap composed of 353 places in 263 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.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 1.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 0.0)
(s123 0.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 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 9.0)
(s163 0.0)
(s164 1.0)
(s165 1.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 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 (/ 1.0 3.0))
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 1.0 3.0))
(s207 0.0)
(s208 0.0)
(s209 1.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 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.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)
(s233 0.0)
(s234 0.0)
(s235 0.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 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 (/ 1.0 3.0))
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:28:13] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:28:24] [INFO ] Deduced a trap composed of 299 places in 227 ms of which 3 ms to minimize.
[2024-05-27 21:28:24] [INFO ] Deduced a trap composed of 397 places in 218 ms of which 4 ms to minimize.
[2024-05-27 21:28:24] [INFO ] Deduced a trap composed of 408 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61294ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61307ms
Finished structural reductions in LTL mode , in 1 iterations and 111577 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-04
Product exploration explored 100000 steps with 3420 reset in 268 ms.
Product exploration explored 100000 steps with 3316 reset in 280 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) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) 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 236 steps (0 resets) in 4 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 177 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-27 21:28:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:28:33] [INFO ] Invariant cache hit.
[2024-05-27 21:28:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:28:34] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 108 ms returned sat
[2024-05-27 21:28:35] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2024-05-27 21:28:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:28:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:28:35] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 96 ms returned sat
[2024-05-27 21:28:37] [INFO ] [Nat]Absence check using state equation in 1851 ms returned sat
[2024-05-27 21:28:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:28:37] [INFO ] [Nat]Added 96 Read/Feed constraints in 310 ms returned sat
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 98 places in 330 ms of which 4 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 932 ms
[2024-05-27 21:28:39] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 100 ms.
[2024-05-27 21:28:45] [INFO ] Added : 215 causal constraints over 43 iterations in 7059 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 96 place count 540 transition count 986
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 224 place count 476 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 336 place count 420 transition count 930
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 344 place count 412 transition count 922
Iterating global reduction 3 with 8 rules applied. Total rules applied 352 place count 412 transition count 922
Applied a total of 352 rules in 94 ms. Remains 412 /588 variables (removed 176) and now considering 922/1098 (removed 176) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-27 21:28:46] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-05-27 21:28:46] [INFO ] Computed 40 invariants in 16 ms
[2024-05-27 21:28:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:28:53] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:28:54] [INFO ] Deduced a trap composed of 188 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:28:54] [INFO ] Deduced a trap composed of 189 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:28:54] [INFO ] Deduced a trap composed of 189 places in 202 ms of which 5 ms to minimize.
[2024-05-27 21:28:55] [INFO ] Deduced a trap composed of 183 places in 240 ms of which 3 ms to minimize.
[2024-05-27 21:28:55] [INFO ] Deduced a trap composed of 183 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:28:55] [INFO ] Deduced a trap composed of 183 places in 181 ms of which 2 ms to minimize.
[2024-05-27 21:28:55] [INFO ] Deduced a trap composed of 189 places in 203 ms of which 2 ms to minimize.
[2024-05-27 21:28:55] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 2 ms to minimize.
[2024-05-27 21:28:56] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:28:57] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:29:02] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 3 ms to minimize.
[2024-05-27 21:29:03] [INFO ] Deduced a trap composed of 195 places in 153 ms of which 3 ms to minimize.
[2024-05-27 21:29:03] [INFO ] Deduced a trap composed of 169 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:29:11] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 3 ms to minimize.
[2024-05-27 21:29:16] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:29:25] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 920 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 410/1318 variables, and 61 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 23/23 constraints]
After SMT, in 41529ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41544ms
[2024-05-27 21:29:27] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:29:27] [INFO ] Invariant cache hit.
[2024-05-27 21:29:27] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-27 21:29:27] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:29:27] [INFO ] Invariant cache hit.
[2024-05-27 21:29:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:29:31] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 3882 ms to find 0 implicit places.
[2024-05-27 21:29:31] [INFO ] Redundant transitions in 6 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-27 21:29:31] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:29:31] [INFO ] Invariant cache hit.
[2024-05-27 21:29:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 0 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 0 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 176 places in 247 ms of which 2 ms to minimize.
[2024-05-27 21:29:38] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:29:40] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2024-05-27 21:29:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:29:40] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 1 ms to minimize.
[2024-05-27 21:29:46] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 2 ms to minimize.
[2024-05-27 21:29:46] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 4 ms to minimize.
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:29:54] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.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 0.0)
(s123 0.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:30:14] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-27 21:30:15] [INFO ] Deduced a trap composed of 250 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:30:18] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 61209ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 412/588 places, 922/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106759 ms. Remains : 412/588 places, 922/1098 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 112 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 4 ms. (34 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 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-27 21:30:33] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:30:33] [INFO ] Invariant cache hit.
[2024-05-27 21:30:33] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-27 21:30:33] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 53 ms returned sat
[2024-05-27 21:30:34] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2024-05-27 21:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:30:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-27 21:30:34] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 58 ms returned sat
[2024-05-27 21:30:36] [INFO ] [Nat]Absence check using state equation in 1668 ms returned sat
[2024-05-27 21:30:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:30:36] [INFO ] [Nat]Added 96 Read/Feed constraints in 335 ms returned sat
[2024-05-27 21:30:36] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-27 21:30:37] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-05-27 21:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 685 ms
[2024-05-27 21:30:37] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 528 transitions) in 72 ms.
[2024-05-27 21:30:40] [INFO ] Added : 146 causal constraints over 30 iterations in 2660 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2434 reset in 353 ms.
Product exploration explored 100000 steps with 2437 reset in 312 ms.
Support contains 8 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 22 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-27 21:30:40] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:30:40] [INFO ] Invariant cache hit.
[2024-05-27 21:30:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:30:47] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 176 places in 245 ms of which 2 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:30:49] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-27 21:30:50] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:30:50] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-05-27 21:30:55] [INFO ] Deduced a trap composed of 147 places in 279 ms of which 3 ms to minimize.
[2024-05-27 21:30:56] [INFO ] Deduced a trap composed of 173 places in 290 ms of which 3 ms to minimize.
[2024-05-27 21:30:57] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:30:57] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 54 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:31:08] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:31:09] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2024-05-27 21:31:10] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:31:14] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-27 21:31:17] [INFO ] Deduced a trap composed of 250 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 59 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 21/21 constraints]
After SMT, in 41153ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41163ms
[2024-05-27 21:31:22] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:31:22] [INFO ] Invariant cache hit.
[2024-05-27 21:31:22] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-27 21:31:22] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:31:22] [INFO ] Invariant cache hit.
[2024-05-27 21:31:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:31:25] [INFO ] Implicit Places using invariants and state equation in 3555 ms returned []
Implicit Place search using SMT with State Equation took 3869 ms to find 0 implicit places.
[2024-05-27 21:31:25] [INFO ] Redundant transitions in 5 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-27 21:31:25] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:31:25] [INFO ] Invariant cache hit.
[2024-05-27 21:31:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:31:32] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:31:33] [INFO ] Deduced a trap composed of 176 places in 251 ms of which 3 ms to minimize.
[2024-05-27 21:31:33] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:31:34] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:31:34] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:31:34] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-05-27 21:31:40] [INFO ] Deduced a trap composed of 147 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:31:40] [INFO ] Deduced a trap composed of 173 places in 163 ms of which 3 ms to minimize.
[2024-05-27 21:31:41] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 2 ms to minimize.
[2024-05-27 21:31:41] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:31:48] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-27 21:32:09] [INFO ] Deduced a trap composed of 250 places in 173 ms of which 2 ms to minimize.
[2024-05-27 21:32:11] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 61269ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106349 ms. Remains : 412/412 places, 922/922 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-04 finished in 346535 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(F(p1))||p0)))'
Support contains 18 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 23 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:32:27] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-27 21:32:27] [INFO ] Computed 40 invariants in 24 ms
[2024-05-27 21:32:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 0 ms to minimize.
[2024-05-27 21:32:37] [INFO ] Deduced a trap composed of 325 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:32:38] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:32:38] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:32:39] [INFO ] Deduced a trap composed of 346 places in 304 ms of which 4 ms to minimize.
[2024-05-27 21:32:39] [INFO ] Deduced a trap composed of 308 places in 268 ms of which 4 ms to minimize.
[2024-05-27 21:32:39] [INFO ] Deduced a trap composed of 307 places in 233 ms of which 4 ms to minimize.
[2024-05-27 21:32:40] [INFO ] Deduced a trap composed of 313 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:32:40] [INFO ] Deduced a trap composed of 299 places in 221 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:32:50] [INFO ] Deduced a trap composed of 353 places in 216 ms of which 4 ms to minimize.
[2024-05-27 21:32:51] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-27 21:32:51] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-27 21:32:57] [INFO ] Deduced a trap composed of 324 places in 329 ms of which 4 ms to minimize.
[2024-05-27 21:32:57] [INFO ] Deduced a trap composed of 311 places in 318 ms of which 3 ms to minimize.
[2024-05-27 21:33:02] [INFO ] Deduced a trap composed of 313 places in 246 ms of which 3 ms to minimize.
[2024-05-27 21:33:03] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41707ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41739ms
[2024-05-27 21:33:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:33:09] [INFO ] Invariant cache hit.
[2024-05-27 21:33:09] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-27 21:33:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:33:09] [INFO ] Invariant cache hit.
[2024-05-27 21:33:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:33:17] [INFO ] Implicit Places using invariants and state equation in 8089 ms returned []
Implicit Place search using SMT with State Equation took 8513 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:33:17] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:33:17] [INFO ] Invariant cache hit.
[2024-05-27 21:33:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:33:27] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-05-27 21:33:27] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:33:27] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:33:27] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:33:27] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:33:28] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:33:28] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:33:28] [INFO ] Deduced a trap composed of 334 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:33:28] [INFO ] Deduced a trap composed of 339 places in 251 ms of which 4 ms to minimize.
[2024-05-27 21:33:29] [INFO ] Deduced a trap composed of 183 places in 219 ms of which 4 ms to minimize.
[2024-05-27 21:33:29] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-05-27 21:33:30] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-05-27 21:33:30] [INFO ] Deduced a trap composed of 314 places in 217 ms of which 4 ms to minimize.
[2024-05-27 21:33:30] [INFO ] Deduced a trap composed of 334 places in 236 ms of which 3 ms to minimize.
[2024-05-27 21:33:31] [INFO ] Deduced a trap composed of 351 places in 244 ms of which 3 ms to minimize.
[2024-05-27 21:33:31] [INFO ] Deduced a trap composed of 338 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:33:31] [INFO ] Deduced a trap composed of 307 places in 233 ms of which 4 ms to minimize.
[2024-05-27 21:33:31] [INFO ] Deduced a trap composed of 324 places in 231 ms of which 4 ms to minimize.
[2024-05-27 21:33:32] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:33:32] [INFO ] Deduced a trap composed of 307 places in 257 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 283 places in 240 ms of which 3 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 353 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:34:00] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:34:10] [INFO ] Deduced a trap composed of 299 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:34:10] [INFO ] Deduced a trap composed of 397 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:34:10] [INFO ] Deduced a trap composed of 408 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61375ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61385ms
Finished structural reductions in LTL mode , in 1 iterations and 111669 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-05
Product exploration explored 100000 steps with 1754 reset in 278 ms.
Product exploration explored 100000 steps with 1756 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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 245 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 95 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 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
[2024-05-27 21:34:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:34:20] [INFO ] Invariant cache hit.
[2024-05-27 21:34:20] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:34:20] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 83 ms returned sat
[2024-05-27 21:34:22] [INFO ] [Real]Absence check using state equation in 2078 ms returned sat
[2024-05-27 21:34:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:34:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:34:23] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 199 ms returned sat
[2024-05-27 21:34:27] [INFO ] [Nat]Absence check using state equation in 4292 ms returned sat
[2024-05-27 21:34:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:34:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 447 ms returned sat
[2024-05-27 21:34:28] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2024-05-27 21:34:28] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
[2024-05-27 21:34:28] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:34:29] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-27 21:34:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1026 ms
[2024-05-27 21:34:29] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 80 ms.
Could not prove EG (NOT p1)
Support contains 10 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 place count 540 transition count 978
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 240 place count 468 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 320 place count 428 transition count 938
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 78 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-27 21:34:37] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-05-27 21:34:37] [INFO ] Computed 40 invariants in 15 ms
[2024-05-27 21:34:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 4 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 195 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 3 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 213 places in 172 ms of which 3 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:34:51] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 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 Real declared 418/1334 variables, and 50 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:35:01] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2024-05-27 21:35:06] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 3 ms to minimize.
[2024-05-27 21:35:10] [INFO ] Deduced a trap composed of 148 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 928 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 418/1334 variables, and 53 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 15/15 constraints]
After SMT, in 41177ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41188ms
[2024-05-27 21:35:19] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:35:19] [INFO ] Invariant cache hit.
[2024-05-27 21:35:19] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-27 21:35:19] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:35:19] [INFO ] Invariant cache hit.
[2024-05-27 21:35:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:35:23] [INFO ] Implicit Places using invariants and state equation in 4474 ms returned []
Implicit Place search using SMT with State Equation took 4856 ms to find 0 implicit places.
[2024-05-27 21:35:24] [INFO ] Redundant transitions in 13 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-27 21:35:24] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:35:24] [INFO ] Invariant cache hit.
[2024-05-27 21:35:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:35:32] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:35:32] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 3 ms to minimize.
[2024-05-27 21:35:33] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:35:37] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:35:41] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
SMT process timed out in 31286ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 31301ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 930/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77455 ms. Remains : 420/588 places, 930/1098 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 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 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 169 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
[2024-05-27 21:35:55] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:35:55] [INFO ] Invariant cache hit.
[2024-05-27 21:35:56] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 21:35:56] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 246 ms returned sat
[2024-05-27 21:35:57] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2024-05-27 21:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-27 21:35:57] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 54 ms returned sat
[2024-05-27 21:35:59] [INFO ] [Nat]Absence check using state equation in 1727 ms returned sat
[2024-05-27 21:35:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:35:59] [INFO ] [Nat]Added 96 Read/Feed constraints in 122 ms returned sat
[2024-05-27 21:35:59] [INFO ] Computed and/alt/rep : 392/1333/384 causal constraints (skipped 528 transitions) in 90 ms.
[2024-05-27 21:36:03] [INFO ] Added : 156 causal constraints over 32 iterations in 3473 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2506 reset in 460 ms.
Product exploration explored 100000 steps with 2513 reset in 443 ms.
Support contains 10 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 930/930 transitions.
Applied a total of 0 rules in 15 ms. Remains 420 /420 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-27 21:36:04] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:36:04] [INFO ] Invariant cache hit.
[2024-05-27 21:36:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:36:11] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:36:11] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:36:11] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:36:11] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:36:11] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 2 ms to minimize.
[2024-05-27 21:36:12] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:36:16] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:36:20] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 50 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
SMT process timed out in 41294ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41305ms
[2024-05-27 21:36:45] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:36:45] [INFO ] Invariant cache hit.
[2024-05-27 21:36:45] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-27 21:36:45] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:36:45] [INFO ] Invariant cache hit.
[2024-05-27 21:36:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:36:51] [INFO ] Implicit Places using invariants and state equation in 5089 ms returned []
Implicit Place search using SMT with State Equation took 5503 ms to find 0 implicit places.
[2024-05-27 21:36:51] [INFO ] Redundant transitions in 11 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-27 21:36:51] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:36:51] [INFO ] Invariant cache hit.
[2024-05-27 21:36:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:36:58] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:36:58] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:36:58] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:36:58] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-05-27 21:36:59] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:36:59] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:36:59] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:36:59] [INFO ] Deduced a trap composed of 172 places in 191 ms of which 2 ms to minimize.
[2024-05-27 21:36:59] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 3 ms to minimize.
[2024-05-27 21:37:00] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:37:03] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 3 ms to minimize.
[2024-05-27 21:37:08] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.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 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 1.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 0.0)
(s123 0.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 9.0)
(s147 0.0)
(s148 1.0)
(s149 1.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 0.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 1.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 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.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)
(s233 0.0)
(s234 0.0)
(s235 0.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 1.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 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 4.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 0.0)
(s297 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
SMT process timed out in 31541ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 31554ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78406 ms. Remains : 420/420 places, 930/930 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-05 finished in 295371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U X(p1))&&G(p2))))'
Support contains 67 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 7 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:37:22] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-27 21:37:22] [INFO ] Computed 40 invariants in 12 ms
[2024-05-27 21:37:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:37:31] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-27 21:37:31] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-27 21:37:31] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-27 21:37:31] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-27 21:37:32] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:37:32] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:37:32] [INFO ] Deduced a trap composed of 64 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:37:32] [INFO ] Deduced a trap composed of 325 places in 235 ms of which 14 ms to minimize.
[2024-05-27 21:37:32] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 3 ms to minimize.
[2024-05-27 21:37:33] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:37:33] [INFO ] Deduced a trap composed of 346 places in 218 ms of which 4 ms to minimize.
[2024-05-27 21:37:34] [INFO ] Deduced a trap composed of 308 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:37:34] [INFO ] Deduced a trap composed of 307 places in 296 ms of which 4 ms to minimize.
[2024-05-27 21:37:34] [INFO ] Deduced a trap composed of 313 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:37:35] [INFO ] Deduced a trap composed of 299 places in 280 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:37:45] [INFO ] Deduced a trap composed of 353 places in 275 ms of which 5 ms to minimize.
[2024-05-27 21:37:46] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:37:46] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-05-27 21:37:52] [INFO ] Deduced a trap composed of 324 places in 271 ms of which 3 ms to minimize.
[2024-05-27 21:37:52] [INFO ] Deduced a trap composed of 311 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:37:57] [INFO ] Deduced a trap composed of 313 places in 259 ms of which 4 ms to minimize.
[2024-05-27 21:37:58] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41099ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41113ms
[2024-05-27 21:38:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:38:03] [INFO ] Invariant cache hit.
[2024-05-27 21:38:04] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-27 21:38:04] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:38:04] [INFO ] Invariant cache hit.
[2024-05-27 21:38:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:38:12] [INFO ] Implicit Places using invariants and state equation in 8464 ms returned []
Implicit Place search using SMT with State Equation took 8802 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:38:12] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:38:12] [INFO ] Invariant cache hit.
[2024-05-27 21:38:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:38:21] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:38:22] [INFO ] Deduced a trap composed of 334 places in 249 ms of which 4 ms to minimize.
[2024-05-27 21:38:23] [INFO ] Deduced a trap composed of 339 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:38:23] [INFO ] Deduced a trap composed of 183 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:38:23] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:38:24] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-27 21:38:24] [INFO ] Deduced a trap composed of 314 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:38:24] [INFO ] Deduced a trap composed of 334 places in 221 ms of which 3 ms to minimize.
[2024-05-27 21:38:25] [INFO ] Deduced a trap composed of 351 places in 246 ms of which 3 ms to minimize.
[2024-05-27 21:38:25] [INFO ] Deduced a trap composed of 338 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:38:25] [INFO ] Deduced a trap composed of 307 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:38:25] [INFO ] Deduced a trap composed of 324 places in 252 ms of which 3 ms to minimize.
[2024-05-27 21:38:26] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:38:26] [INFO ] Deduced a trap composed of 307 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 283 places in 213 ms of which 4 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 353 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:38:55] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:39:05] [INFO ] Deduced a trap composed of 299 places in 230 ms of which 4 ms to minimize.
[2024-05-27 21:39:05] [INFO ] Deduced a trap composed of 397 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:39:06] [INFO ] Deduced a trap composed of 408 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61525ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61542ms
Finished structural reductions in LTL mode , in 1 iterations and 111471 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-07 finished in 111703 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)&&F(G((G(p0) U X(!p1)))))))'
Support contains 22 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 place count 540 transition count 978
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 240 place count 468 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 320 place count 428 transition count 938
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 63 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-27 21:39:14] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-05-27 21:39:14] [INFO ] Computed 40 invariants in 8 ms
[2024-05-27 21:39:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:39:21] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:39:21] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:39:21] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:39:21] [INFO ] Deduced a trap composed of 195 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:39:21] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:39:21] [INFO ] Deduced a trap composed of 213 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:39:22] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:39:26] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:39:33] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 51 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:39:38] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-27 21:39:41] [INFO ] Deduced a trap composed of 179 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:39:41] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:39:47] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:39:48] [INFO ] Deduced a trap composed of 177 places in 193 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:39:54] [INFO ] Deduced a trap composed of 260 places in 201 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(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 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(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 9)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(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 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 4)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41202ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41211ms
[2024-05-27 21:39:55] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:39:55] [INFO ] Invariant cache hit.
[2024-05-27 21:39:55] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-27 21:39:55] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:39:55] [INFO ] Invariant cache hit.
[2024-05-27 21:39:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:40:00] [INFO ] Implicit Places using invariants and state equation in 4308 ms returned []
Implicit Place search using SMT with State Equation took 4607 ms to find 0 implicit places.
[2024-05-27 21:40:00] [INFO ] Redundant transitions in 7 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-27 21:40:00] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:40:00] [INFO ] Invariant cache hit.
[2024-05-27 21:40:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:40:06] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:40:06] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:40:06] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:40:06] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:40:06] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:40:07] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:40:07] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:40:07] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 2 ms to minimize.
[2024-05-27 21:40:07] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 3 ms to minimize.
[2024-05-27 21:40:08] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:40:12] [INFO ] Deduced a trap composed of 158 places in 319 ms of which 7 ms to minimize.
[2024-05-27 21:40:16] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
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 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 TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 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
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/51 constraints. Problems are: Problem set: 48 solved, 880 unsolved
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 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.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 0.0)
(s123 0.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 9.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.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 1.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 0.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 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.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 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.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)
(s233 0.0)
(s234 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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1334 variables, and 51 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 48 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-27 21:40:32] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-27 21:40:37] [INFO ] Deduced a trap composed of 171 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/52 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-27 21:40:43] [INFO ] Deduced a trap composed of 270 places in 163 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 6 (OVERLAPS) 1/419 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 880 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 419/1334 variables, and 54 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 15/15 constraints]
After SMT, in 61212ms problems are : Problem set: 48 solved, 880 unsolved
Search for dead transitions found 48 dead transitions in 61231ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 882/1098 transitions.
Applied a total of 0 rules in 11 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-27 21:41:01] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 107167 ms. Remains : 420/588 places, 882/1098 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR p1 p0), p0, p1, p1, (AND (NOT p0) p1), p1, false]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-08
Product exploration explored 100000 steps with 28574 reset in 355 ms.
Product exploration explored 100000 steps with 28617 reset in 346 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)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 176 ms. Reduced automaton from 7 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR p0 p1), p0, p1, p1, (AND (NOT p0) p1), p1, false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (14 resets) in 518 ms. (77 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1000 ms. (39 steps per ms) remains 1/1 properties
[2024-05-27 21:41:03] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
// Phase 1: matrix 866 rows 420 cols
[2024-05-27 21:41:03] [INFO ] Computed 40 invariants in 12 ms
[2024-05-27 21:41:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/221 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/244 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 416/1286 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms 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)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 410 ms. Reduced automaton from 8 states, 29 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR p0 p1), p0, p1, p1]
Stuttering acceptance computed with spot in 116 ms :[(OR p0 p1), p0, p1, p1]
Support contains 22 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running 880 sub problems to find dead transitions.
[2024-05-27 21:41:04] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:41:04] [INFO ] Invariant cache hit.
[2024-05-27 21:41:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:41:11] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:41:11] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 5 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:41:12] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-05-27 21:41:13] [INFO ] Deduced a trap composed of 263 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:41:14] [INFO ] Deduced a trap composed of 132 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:41:15] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 4 ms to minimize.
[2024-05-27 21:41:19] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:41:19] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:41:19] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 4 ms to minimize.
[2024-05-27 21:41:20] [INFO ] Deduced a trap composed of 199 places in 210 ms of which 3 ms to minimize.
[2024-05-27 21:41:20] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:41:20] [INFO ] Deduced a trap composed of 149 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 56 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:41:29] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-27 21:41:29] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:41:43] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 3 ms to minimize.
[2024-05-27 21:41:44] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 60 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 22/22 constraints]
After SMT, in 40918ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 40926ms
[2024-05-27 21:41:45] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:41:45] [INFO ] Invariant cache hit.
[2024-05-27 21:41:45] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-27 21:41:45] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:41:45] [INFO ] Invariant cache hit.
[2024-05-27 21:41:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:41:51] [INFO ] Implicit Places using invariants and state equation in 5464 ms returned []
Implicit Place search using SMT with State Equation took 5824 ms to find 0 implicit places.
[2024-05-27 21:41:51] [INFO ] Redundant transitions in 9 ms returned []
Running 880 sub problems to find dead transitions.
[2024-05-27 21:41:51] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:41:51] [INFO ] Invariant cache hit.
[2024-05-27 21:41:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:41:58] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:41:58] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:41:58] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-05-27 21:41:58] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:41:58] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:41:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:41:59] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2024-05-27 21:41:59] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:41:59] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:42:00] [INFO ] Deduced a trap composed of 263 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:42:01] [INFO ] Deduced a trap composed of 132 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:42:03] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 2 ms to minimize.
[2024-05-27 21:42:06] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:42:07] [INFO ] Deduced a trap composed of 202 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:42:07] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 2 ms to minimize.
[2024-05-27 21:42:07] [INFO ] Deduced a trap composed of 199 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:42:08] [INFO ] Deduced a trap composed of 179 places in 186 ms of which 2 ms to minimize.
[2024-05-27 21:42:08] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:42:14] [INFO ] Deduced a trap composed of 211 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 880 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 Real declared 418/1286 variables, and 57 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:42:24] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-27 21:42:25] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:42:25] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:42:45] [INFO ] Deduced a trap composed of 222 places in 273 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 Int declared 418/1286 variables, and 61 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 23/23 constraints]
After SMT, in 61049ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 61061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107844 ms. Remains : 420/420 places, 882/882 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)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR p0 p1), p0, p1, p1]
RANDOM walk for 168 steps (0 resets) in 10 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR p0 p1), p0, p1, p1]
Stuttering acceptance computed with spot in 153 ms :[(OR p0 p1), p0, p1, p1]
Stuttering acceptance computed with spot in 225 ms :[(OR p0 p1), p0, p1, p1]
Product exploration explored 100000 steps with 33248 reset in 491 ms.
Product exploration explored 100000 steps with 33399 reset in 458 ms.
Support contains 22 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 882/882 transitions.
Applied a total of 0 rules in 11 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running 880 sub problems to find dead transitions.
[2024-05-27 21:42:54] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:42:54] [INFO ] Invariant cache hit.
[2024-05-27 21:42:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:43:02] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:43:02] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:43:02] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:43:02] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:43:03] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:43:03] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:43:03] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:43:03] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:43:03] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:43:04] [INFO ] Deduced a trap composed of 263 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:43:05] [INFO ] Deduced a trap composed of 132 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:43:06] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 3 ms to minimize.
[2024-05-27 21:43:10] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 2 ms to minimize.
[2024-05-27 21:43:10] [INFO ] Deduced a trap composed of 202 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:43:10] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 2 ms to minimize.
[2024-05-27 21:43:11] [INFO ] Deduced a trap composed of 199 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:43:11] [INFO ] Deduced a trap composed of 179 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:43:11] [INFO ] Deduced a trap composed of 149 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 56 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:43:20] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:43:20] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:43:35] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 4 ms to minimize.
SMT process timed out in 41245ms, After SMT, problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 41257ms
[2024-05-27 21:43:35] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:43:35] [INFO ] Invariant cache hit.
[2024-05-27 21:43:36] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-27 21:43:36] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:43:36] [INFO ] Invariant cache hit.
[2024-05-27 21:43:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:43:41] [INFO ] Implicit Places using invariants and state equation in 5578 ms returned []
Implicit Place search using SMT with State Equation took 5866 ms to find 0 implicit places.
[2024-05-27 21:43:41] [INFO ] Redundant transitions in 9 ms returned []
Running 880 sub problems to find dead transitions.
[2024-05-27 21:43:41] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-27 21:43:41] [INFO ] Invariant cache hit.
[2024-05-27 21:43:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:43:49] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:43:49] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:43:50] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:43:51] [INFO ] Deduced a trap composed of 263 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:43:52] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 2 ms to minimize.
[2024-05-27 21:43:54] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 2 ms to minimize.
[2024-05-27 21:43:57] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:43:58] [INFO ] Deduced a trap composed of 202 places in 232 ms of which 4 ms to minimize.
[2024-05-27 21:43:58] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 3 ms to minimize.
[2024-05-27 21:43:58] [INFO ] Deduced a trap composed of 199 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:43:58] [INFO ] Deduced a trap composed of 179 places in 162 ms of which 2 ms to minimize.
[2024-05-27 21:43:59] [INFO ] Deduced a trap composed of 149 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:44:06] [INFO ] Deduced a trap composed of 211 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 57 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:44:15] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-27 21:44:15] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 4 ms to minimize.
[2024-05-27 21:44:15] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-27 21:44:37] [INFO ] Deduced a trap composed of 222 places in 283 ms of which 4 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 Int declared 418/1286 variables, and 61 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 23/23 constraints]
After SMT, in 61096ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 61108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108263 ms. Remains : 420/420 places, 882/882 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-08 finished in 328621 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 8 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 8 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:44:43] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-27 21:44:43] [INFO ] Computed 40 invariants in 19 ms
[2024-05-27 21:44:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:44:53] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-27 21:44:53] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-05-27 21:44:53] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-27 21:44:54] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:44:54] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-05-27 21:44:54] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-05-27 21:44:54] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:44:54] [INFO ] Deduced a trap composed of 325 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:44:55] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:44:55] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 0 ms to minimize.
[2024-05-27 21:44:56] [INFO ] Deduced a trap composed of 346 places in 227 ms of which 4 ms to minimize.
[2024-05-27 21:44:56] [INFO ] Deduced a trap composed of 308 places in 282 ms of which 5 ms to minimize.
[2024-05-27 21:44:56] [INFO ] Deduced a trap composed of 307 places in 234 ms of which 4 ms to minimize.
[2024-05-27 21:44:57] [INFO ] Deduced a trap composed of 313 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:44:57] [INFO ] Deduced a trap composed of 299 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:45:06] [INFO ] Deduced a trap composed of 353 places in 235 ms of which 4 ms to minimize.
[2024-05-27 21:45:07] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:45:07] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-05-27 21:45:12] [INFO ] Deduced a trap composed of 324 places in 223 ms of which 3 ms to minimize.
[2024-05-27 21:45:13] [INFO ] Deduced a trap composed of 311 places in 255 ms of which 4 ms to minimize.
[2024-05-27 21:45:17] [INFO ] Deduced a trap composed of 313 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:45:19] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(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 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(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 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 1)
(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 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 1)
(s164 0)
(s165 1)
(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 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(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 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(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 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(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 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(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 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41478ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41495ms
[2024-05-27 21:45:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:45:24] [INFO ] Invariant cache hit.
[2024-05-27 21:45:24] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-27 21:45:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:45:24] [INFO ] Invariant cache hit.
[2024-05-27 21:45:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:45:32] [INFO ] Implicit Places using invariants and state equation in 7826 ms returned []
Implicit Place search using SMT with State Equation took 8253 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:45:32] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-27 21:45:32] [INFO ] Invariant cache hit.
[2024-05-27 21:45:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:45:42] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:45:43] [INFO ] Deduced a trap composed of 334 places in 265 ms of which 4 ms to minimize.
[2024-05-27 21:45:43] [INFO ] Deduced a trap composed of 339 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:45:44] [INFO ] Deduced a trap composed of 183 places in 254 ms of which 4 ms to minimize.
[2024-05-27 21:45:44] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:45:44] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-27 21:45:45] [INFO ] Deduced a trap composed of 314 places in 243 ms of which 4 ms to minimize.
[2024-05-27 21:45:45] [INFO ] Deduced a trap composed of 334 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 351 places in 237 ms of which 3 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 338 places in 264 ms of which 5 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 307 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:45:46] [INFO ] Deduced a trap composed of 324 places in 241 ms of which 4 ms to minimize.
[2024-05-27 21:45:47] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 3 ms to minimize.
[2024-05-27 21:45:47] [INFO ] Deduced a trap composed of 307 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:45:48] [INFO ] Deduced a trap composed of 283 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:45:48] [INFO ] Deduced a trap composed of 353 places in 254 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:46:17] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:46:28] [INFO ] Deduced a trap composed of 299 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:46:28] [INFO ] Deduced a trap composed of 397 places in 227 ms of which 3 ms to minimize.
[2024-05-27 21:46:29] [INFO ] Deduced a trap composed of 408 places in 267 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61533ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61551ms
Finished structural reductions in LTL mode , in 1 iterations and 111315 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-12 finished in 111435 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&&G(p1))) U p2)))'
Support contains 35 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 place count 540 transition count 978
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 240 place count 468 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 320 place count 428 transition count 938
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 44 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-27 21:46:34] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-05-27 21:46:34] [INFO ] Computed 40 invariants in 19 ms
[2024-05-27 21:46:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:46:41] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-05-27 21:46:42] [INFO ] Deduced a trap composed of 195 places in 191 ms of which 3 ms to minimize.
[2024-05-27 21:46:42] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 2 ms to minimize.
[2024-05-27 21:46:42] [INFO ] Deduced a trap composed of 213 places in 187 ms of which 3 ms to minimize.
[2024-05-27 21:46:42] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:46:47] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:46:55] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 2 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 418/1334 variables, and 51 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:46:58] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-27 21:47:01] [INFO ] Deduced a trap composed of 179 places in 180 ms of which 2 ms to minimize.
[2024-05-27 21:47:01] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:47:09] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:47:10] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:47:15] [INFO ] Deduced a trap composed of 260 places in 228 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 Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41386ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41398ms
[2024-05-27 21:47:15] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:47:15] [INFO ] Invariant cache hit.
[2024-05-27 21:47:16] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-27 21:47:16] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:47:16] [INFO ] Invariant cache hit.
[2024-05-27 21:47:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:47:20] [INFO ] Implicit Places using invariants and state equation in 4512 ms returned []
Implicit Place search using SMT with State Equation took 4807 ms to find 0 implicit places.
[2024-05-27 21:47:20] [INFO ] Redundant transitions in 14 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-27 21:47:20] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-27 21:47:20] [INFO ] Invariant cache hit.
[2024-05-27 21:47:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:47:28] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 3 ms to minimize.
[2024-05-27 21:47:29] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:47:33] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 3 ms to minimize.
[2024-05-27 21:47:37] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
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 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 TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 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
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/51 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1334 variables, and 51 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 48 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-27 21:47:53] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-27 21:47:58] [INFO ] Deduced a trap composed of 171 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/52 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-27 21:48:04] [INFO ] Deduced a trap composed of 270 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 6 (OVERLAPS) 1/419 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1334 variables, and 54 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 15/15 constraints]
After SMT, in 61372ms problems are : Problem set: 48 solved, 880 unsolved
Search for dead transitions found 48 dead transitions in 61391ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 882/1098 transitions.
Applied a total of 0 rules in 11 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-27 21:48:22] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 107701 ms. Remains : 420/588 places, 882/1098 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-14
Stuttering criterion allowed to conclude after 8059 steps with 0 reset in 39 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-14 finished in 107926 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(X(F((p0 U (!X(p0) U p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((!p0 U (p1||G(!p0)))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T08-LTLFireability-04
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Support contains 17 out of 588 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 96 place count 540 transition count 986
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 224 place count 476 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 336 place count 420 transition count 930
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 344 place count 412 transition count 922
Iterating global reduction 3 with 8 rules applied. Total rules applied 352 place count 412 transition count 922
Applied a total of 352 rules in 78 ms. Remains 412 /588 variables (removed 176) and now considering 922/1098 (removed 176) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-27 21:48:22] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-05-27 21:48:22] [INFO ] Computed 40 invariants in 13 ms
[2024-05-27 21:48:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:48:30] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-27 21:48:30] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-27 21:48:30] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-27 21:48:30] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:48:30] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:48:31] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:48:31] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:48:31] [INFO ] Deduced a trap composed of 188 places in 236 ms of which 4 ms to minimize.
[2024-05-27 21:48:31] [INFO ] Deduced a trap composed of 189 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:48:32] [INFO ] Deduced a trap composed of 189 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:48:32] [INFO ] Deduced a trap composed of 183 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:48:32] [INFO ] Deduced a trap composed of 183 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:48:32] [INFO ] Deduced a trap composed of 183 places in 207 ms of which 2 ms to minimize.
[2024-05-27 21:48:32] [INFO ] Deduced a trap composed of 189 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:48:33] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 3 ms to minimize.
[2024-05-27 21:48:33] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:48:34] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 2 ms to minimize.
[2024-05-27 21:48:40] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 2 ms to minimize.
[2024-05-27 21:48:41] [INFO ] Deduced a trap composed of 195 places in 192 ms of which 2 ms to minimize.
[2024-05-27 21:48:41] [INFO ] Deduced a trap composed of 169 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 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 Real declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:48:48] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-27 21:48:55] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:49:04] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 61 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 23/23 constraints]
After SMT, in 41690ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41707ms
[2024-05-27 21:49:04] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:49:04] [INFO ] Invariant cache hit.
[2024-05-27 21:49:04] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-27 21:49:04] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:49:04] [INFO ] Invariant cache hit.
[2024-05-27 21:49:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:49:08] [INFO ] Implicit Places using invariants and state equation in 3904 ms returned []
Implicit Place search using SMT with State Equation took 4264 ms to find 0 implicit places.
Running 920 sub problems to find dead transitions.
[2024-05-27 21:49:08] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:49:08] [INFO ] Invariant cache hit.
[2024-05-27 21:49:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:49:16] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:49:17] [INFO ] Deduced a trap composed of 176 places in 210 ms of which 2 ms to minimize.
[2024-05-27 21:49:17] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:49:18] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-27 21:49:18] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:49:19] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:49:24] [INFO ] Deduced a trap composed of 147 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:49:25] [INFO ] Deduced a trap composed of 173 places in 236 ms of which 3 ms to minimize.
[2024-05-27 21:49:26] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 3 ms to minimize.
[2024-05-27 21:49:26] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:49:34] [INFO ] Deduced a trap composed of 158 places in 204 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:49:52] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:49:53] [INFO ] Deduced a trap composed of 250 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:49:56] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 61726ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61748ms
Starting structural reductions in LI_LTL mode, iteration 1 : 412/588 places, 922/1098 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 107805 ms. Remains : 412/588 places, 922/1098 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-04
Product exploration explored 100000 steps with 4558 reset in 387 ms.
Product exploration explored 100000 steps with 4616 reset in 402 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) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 172 steps (0 resets) in 4 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 173 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 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
[2024-05-27 21:50:12] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:50:12] [INFO ] Invariant cache hit.
[2024-05-27 21:50:12] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2024-05-27 21:50:12] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 70 ms returned sat
[2024-05-27 21:50:13] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2024-05-27 21:50:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:50:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2024-05-27 21:50:14] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 63 ms returned sat
[2024-05-27 21:50:15] [INFO ] [Nat]Absence check using state equation in 1870 ms returned sat
[2024-05-27 21:50:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:50:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 355 ms returned sat
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:50:16] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-05-27 21:50:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 794 ms
[2024-05-27 21:50:17] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 528 transitions) in 91 ms.
[2024-05-27 21:50:19] [INFO ] Added : 146 causal constraints over 30 iterations in 2456 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 412 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 16 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-27 21:50:19] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:50:19] [INFO ] Invariant cache hit.
[2024-05-27 21:50:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:50:27] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:50:28] [INFO ] Deduced a trap composed of 176 places in 251 ms of which 3 ms to minimize.
[2024-05-27 21:50:28] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:50:29] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2024-05-27 21:50:29] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:50:30] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2024-05-27 21:50:36] [INFO ] Deduced a trap composed of 147 places in 217 ms of which 2 ms to minimize.
[2024-05-27 21:50:37] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 3 ms to minimize.
[2024-05-27 21:50:37] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:50:37] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 54 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:50:51] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-27 21:50:51] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-05-27 21:51:00] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 57 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 19/19 constraints]
After SMT, in 41790ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41804ms
[2024-05-27 21:51:01] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:51:01] [INFO ] Invariant cache hit.
[2024-05-27 21:51:01] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-27 21:51:01] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:51:01] [INFO ] Invariant cache hit.
[2024-05-27 21:51:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:51:05] [INFO ] Implicit Places using invariants and state equation in 3620 ms returned []
Implicit Place search using SMT with State Equation took 3981 ms to find 0 implicit places.
[2024-05-27 21:51:05] [INFO ] Redundant transitions in 6 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-27 21:51:05] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:51:05] [INFO ] Invariant cache hit.
[2024-05-27 21:51:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:51:12] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-27 21:51:12] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 176 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:51:13] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 3 ms to minimize.
[2024-05-27 21:51:15] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:51:15] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:51:15] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:51:21] [INFO ] Deduced a trap composed of 147 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:51:22] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 2 ms to minimize.
[2024-05-27 21:51:22] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2024-05-27 21:51:22] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:51:30] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:51:48] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:51:49] [INFO ] Deduced a trap composed of 250 places in 212 ms of which 2 ms to minimize.
[2024-05-27 21:51:52] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 61416ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61427ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107253 ms. Remains : 412/412 places, 922/922 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 128 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 4 ms. (32 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 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-05-27 21:52:07] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:52:07] [INFO ] Invariant cache hit.
[2024-05-27 21:52:07] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-27 21:52:07] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 71 ms returned sat
[2024-05-27 21:52:08] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2024-05-27 21:52:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:52:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-27 21:52:08] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 62 ms returned sat
[2024-05-27 21:52:10] [INFO ] [Nat]Absence check using state equation in 1880 ms returned sat
[2024-05-27 21:52:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:52:11] [INFO ] [Nat]Added 96 Read/Feed constraints in 354 ms returned sat
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:52:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2024-05-27 21:52:11] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 528 transitions) in 43 ms.
[2024-05-27 21:52:13] [INFO ] Added : 146 causal constraints over 30 iterations in 1947 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2434 reset in 293 ms.
Product exploration explored 100000 steps with 2432 reset in 366 ms.
Support contains 8 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-27 21:52:14] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:52:14] [INFO ] Invariant cache hit.
[2024-05-27 21:52:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:52:21] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:52:22] [INFO ] Deduced a trap composed of 176 places in 409 ms of which 32 ms to minimize.
[2024-05-27 21:52:22] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 2 ms to minimize.
[2024-05-27 21:52:23] [INFO ] Deduced a trap composed of 88 places in 195 ms of which 2 ms to minimize.
[2024-05-27 21:52:23] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:52:24] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 2 ms to minimize.
[2024-05-27 21:52:31] [INFO ] Deduced a trap composed of 147 places in 294 ms of which 6 ms to minimize.
[2024-05-27 21:52:32] [INFO ] Deduced a trap composed of 173 places in 300 ms of which 4 ms to minimize.
[2024-05-27 21:52:32] [INFO ] Deduced a trap composed of 162 places in 275 ms of which 4 ms to minimize.
[2024-05-27 21:52:32] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 54 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:52:41] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 17/17 constraints]
After SMT, in 41271ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41282ms
[2024-05-27 21:52:55] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:52:55] [INFO ] Invariant cache hit.
[2024-05-27 21:52:55] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-27 21:52:55] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:52:55] [INFO ] Invariant cache hit.
[2024-05-27 21:52:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:52:59] [INFO ] Implicit Places using invariants and state equation in 3871 ms returned []
Implicit Place search using SMT with State Equation took 4190 ms to find 0 implicit places.
[2024-05-27 21:52:59] [INFO ] Redundant transitions in 6 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-27 21:52:59] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-27 21:52:59] [INFO ] Invariant cache hit.
[2024-05-27 21:52:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:53:06] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2024-05-27 21:53:07] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:53:07] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 2 ms to minimize.
[2024-05-27 21:53:07] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 2 ms to minimize.
[2024-05-27 21:53:08] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-27 21:53:08] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-27 21:53:09] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-05-27 21:53:14] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 2 ms to minimize.
[2024-05-27 21:53:15] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 2 ms to minimize.
[2024-05-27 21:53:15] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 3 ms to minimize.
[2024-05-27 21:53:15] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:53:23] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
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.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 0.0)
(s123 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-27 21:53:42] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2024-05-27 21:53:42] [INFO ] Deduced a trap composed of 250 places in 185 ms of which 2 ms to minimize.
[2024-05-27 21:53:45] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 920 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 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 61248ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61257ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106765 ms. Remains : 412/412 places, 922/922 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-04 finished in 338585 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(F(p1))||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' '!(G((F(!p0)&&F(G((G(p0) U X(!p1)))))))'
[2024-05-27 21:54:01] [INFO ] Flatten gal took : 81 ms
[2024-05-27 21:54:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-27 21:54:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 588 places, 1098 transitions and 4770 arcs took 11 ms.
Total runtime 2203387 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 588
TRANSITIONS: 1098
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.003s]


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


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

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

Process ID: 5482
MODEL NAME: /home/mcc/execution/418/model
588 places, 1098 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-S02J04T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J04T08, 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 r289-tajo-171654445100084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;