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-171654445900403.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 PolyORBNT-COL-S10J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716879717689

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:01:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 07:01:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:01:59] [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-28 07:01:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:01:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 688 ms
[2024-05-28 07:01:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 07:02:00] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 07:02:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40010 steps (2282 resets) in 1856 ms. (21 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4004 steps (78 resets) in 89 ms. (44 steps per ms) remains 9/24 properties
BEST_FIRST walk for 4002 steps (80 resets) in 76 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (79 resets) in 91 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (85 resets) in 67 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (76 resets) in 35 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (78 resets) in 30 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (80 resets) in 38 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4007 steps (77 resets) in 24 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (77 resets) in 22 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (102 resets) in 27 ms. (142 steps per ms) remains 9/9 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:02:00] [INFO ] Computed 13 invariants in 10 ms
[2024-05-28 07:02:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/21 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/25 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 46/86 variables, and 12 constraints, problems are : Problem set: 9 solved, 0 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 252ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 07:02:01] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 07:02:01] [INFO ] Flatten gal took : 23 ms
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 07:02:01] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:02:01] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 228 ms.
[2024-05-28 07:02:01] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 23 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 185 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1649
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1649
Applied a total of 12 rules in 107 ms. Remains 463 /474 variables (removed 11) and now considering 1649/1650 (removed 1) transitions.
Running 1638 sub problems to find dead transitions.
[2024-05-28 07:02:01] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
// Phase 1: matrix 1640 rows 463 cols
[2024-05-28 07:02:01] [INFO ] Computed 62 invariants in 71 ms
[2024-05-28 07:02:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2103 variables, and 51 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1638/638 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/2103 variables, and 51 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/638 constraints, Known Traps: 0/0 constraints]
After SMT, in 58365ms problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 58404ms
[2024-05-28 07:03:00] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 07:03:00] [INFO ] Invariant cache hit.
[2024-05-28 07:03:00] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-28 07:03:00] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 07:03:00] [INFO ] Invariant cache hit.
[2024-05-28 07:03:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:03:03] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 3365 ms to find 0 implicit places.
Running 1638 sub problems to find dead transitions.
[2024-05-28 07:03:03] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 07:03:03] [INFO ] Invariant cache hit.
[2024-05-28 07:03:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 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
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1146 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 558 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/2103 variables, and 61 constraints, problems are : Problem set: 558 solved, 1080 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1638/638 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 558 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 558 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 558 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 558 solved, 1080 unsolved
[2024-05-28 07:04:06] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 31 ms to minimize.
[2024-05-28 07:04:14] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 558 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/2103 variables, and 63 constraints, problems are : Problem set: 558 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/638 constraints, Known Traps: 2/2 constraints]
After SMT, in 79937ms problems are : Problem set: 558 solved, 1080 unsolved
Search for dead transitions found 558 dead transitions in 79984ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1091/1650 transitions.
Applied a total of 0 rules in 12 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141922 ms. Remains : 463/474 places, 1091/1650 transitions.
Support contains 185 out of 463 places after structural reductions.
[2024-05-28 07:04:23] [INFO ] Flatten gal took : 151 ms
[2024-05-28 07:04:23] [INFO ] Flatten gal took : 130 ms
[2024-05-28 07:04:24] [INFO ] Input system was already deterministic with 1091 transitions.
RANDOM walk for 40000 steps (2240 resets) in 3572 ms. (11 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4002 steps (39 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (38 resets) in 64 ms. (61 steps per ms) remains 9/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 22 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (41 resets) in 22 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (40 resets) in 29 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (40 resets) in 27 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (40 resets) in 19 ms. (200 steps per ms) remains 9/9 properties
[2024-05-28 07:04:25] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-05-28 07:04:25] [INFO ] Computed 62 invariants in 25 ms
[2024-05-28 07:04:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 334/426 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 28/454 variables, 10/57 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 6 (OVERLAPS) 8/462 variables, 5/62 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1082/1544 variables, 462/524 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 1/525 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1544 variables, 0/525 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/1545 variables, 1/526 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1545 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1545 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1545/1545 variables, and 526 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 463/463 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 164/213 variables, 24/24 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/25 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 211/424 variables, 22/47 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 27/451 variables, 9/56 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 10/461 variables, 5/61 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/462 variables, 1/62 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1082/1544 variables, 462/524 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1544 variables, 1/525 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1544 variables, 4/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1544 variables, 0/529 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/1545 variables, 1/530 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1545/1545 variables, and 533 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 463/463 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7733ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1091/1091 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 463 transition count 1067
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 439 transition count 1067
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 48 place count 439 transition count 1042
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 98 place count 414 transition count 1042
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 412 transition count 1040
Applied a total of 102 rules in 143 ms. Remains 412 /463 variables (removed 51) and now considering 1040/1091 (removed 51) transitions.
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:04:33] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
// Phase 1: matrix 1031 rows 412 cols
[2024-05-28 07:04:33] [INFO ] Computed 62 invariants in 15 ms
[2024-05-28 07:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:04:45] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 6 ms to minimize.
[2024-05-28 07:04:45] [INFO ] Deduced a trap composed of 128 places in 241 ms of which 12 ms to minimize.
[2024-05-28 07:04:46] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 3 ms to minimize.
[2024-05-28 07:04:46] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:04:46] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:04:46] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:04:46] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:04:47] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 2 ms to minimize.
[2024-05-28 07:04:47] [INFO ] Deduced a trap composed of 128 places in 192 ms of which 5 ms to minimize.
[2024-05-28 07:04:47] [INFO ] Deduced a trap composed of 128 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:04:47] [INFO ] Deduced a trap composed of 123 places in 217 ms of which 2 ms to minimize.
[2024-05-28 07:04:47] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 3 ms to minimize.
[2024-05-28 07:04:47] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:04:48] [INFO ] Deduced a trap composed of 118 places in 172 ms of which 3 ms to minimize.
[2024-05-28 07:04:48] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:04:48] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:04:48] [INFO ] Deduced a trap composed of 113 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:04:48] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:04:49] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:04:49] [INFO ] Deduced a trap composed of 128 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:04:49] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 4 ms to minimize.
[2024-05-28 07:04:49] [INFO ] Deduced a trap composed of 118 places in 180 ms of which 2 ms to minimize.
[2024-05-28 07:04:50] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:04:50] [INFO ] Deduced a trap composed of 118 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:04:50] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:04:50] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:04:50] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:04:50] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 3 ms to minimize.
[2024-05-28 07:04:51] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:04:51] [INFO ] Deduced a trap composed of 123 places in 222 ms of which 2 ms to minimize.
[2024-05-28 07:04:51] [INFO ] Deduced a trap composed of 113 places in 163 ms of which 3 ms to minimize.
[2024-05-28 07:04:51] [INFO ] Deduced a trap composed of 113 places in 165 ms of which 5 ms to minimize.
[2024-05-28 07:04:51] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 7 ms to minimize.
[2024-05-28 07:04:52] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:04:52] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:04:52] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 2 ms to minimize.
[2024-05-28 07:04:52] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 2 ms to minimize.
[2024-05-28 07:04:52] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:04:52] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 2 ms to minimize.
[2024-05-28 07:04:53] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:04:58] [INFO ] Deduced a trap composed of 108 places in 205 ms of which 3 ms to minimize.
[2024-05-28 07:04:59] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 3 ms to minimize.
[2024-05-28 07:04:59] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 3 ms to minimize.
SMT process timed out in 26206ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 26219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26365 ms. Remains : 412/463 places, 1040/1091 transitions.
RANDOM walk for 4336 steps (310 resets) in 102 ms. (42 steps per ms) remains 0/7 properties
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 13 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 9 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:04:59] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-05-28 07:04:59] [INFO ] Computed 62 invariants in 14 ms
[2024-05-28 07:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:05:28] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 4 ms to minimize.
[2024-05-28 07:05:29] [INFO ] Deduced a trap composed of 20 places in 342 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/1545 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 46528ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 46541ms
[2024-05-28 07:05:46] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:05:46] [INFO ] Invariant cache hit.
[2024-05-28 07:05:46] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-28 07:05:46] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:05:46] [INFO ] Invariant cache hit.
[2024-05-28 07:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:05:48] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:05:48] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:05:48] [INFO ] Invariant cache hit.
[2024-05-28 07:05:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:06:35] [INFO ] Deduced a trap composed of 12 places in 332 ms of which 4 ms to minimize.
[2024-05-28 07:06:42] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 65843ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 65871ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 8 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114860 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 4 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-02 finished in 115230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 21 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 463 transition count 1066
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 438 transition count 1066
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 438 transition count 1041
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 413 transition count 1041
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 410 transition count 1038
Applied a total of 106 rules in 106 ms. Remains 410 /463 variables (removed 53) and now considering 1038/1091 (removed 53) transitions.
Running 1027 sub problems to find dead transitions.
[2024-05-28 07:06:55] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
// Phase 1: matrix 1029 rows 410 cols
[2024-05-28 07:06:55] [INFO ] Computed 62 invariants in 31 ms
[2024-05-28 07:06:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:07:07] [INFO ] Deduced a trap composed of 131 places in 200 ms of which 5 ms to minimize.
[2024-05-28 07:07:07] [INFO ] Deduced a trap composed of 116 places in 188 ms of which 4 ms to minimize.
[2024-05-28 07:07:07] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:07:07] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:07:07] [INFO ] Deduced a trap composed of 121 places in 225 ms of which 3 ms to minimize.
[2024-05-28 07:07:08] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 3 ms to minimize.
[2024-05-28 07:07:08] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 3 ms to minimize.
[2024-05-28 07:07:08] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 3 ms to minimize.
[2024-05-28 07:07:08] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:07:08] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 4 ms to minimize.
[2024-05-28 07:07:09] [INFO ] Deduced a trap composed of 126 places in 186 ms of which 2 ms to minimize.
[2024-05-28 07:07:09] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:07:09] [INFO ] Deduced a trap composed of 126 places in 179 ms of which 2 ms to minimize.
[2024-05-28 07:07:09] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-05-28 07:07:09] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:07:10] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 3 ms to minimize.
[2024-05-28 07:07:10] [INFO ] Deduced a trap composed of 121 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:07:10] [INFO ] Deduced a trap composed of 116 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:07:10] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:07:10] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:07:16] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 3 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 166 places in 176 ms of which 2 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:07:17] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:07:18] [INFO ] Deduced a trap composed of 163 places in 150 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.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 (/ 2.0 3.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 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 2.0 3.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 (/ 1.0 3.0))
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 (/ 1.0 3.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 1.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 4.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 9.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1439 variables, and 78 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 26/78 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:07:21] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 3 ms to minimize.
[2024-05-28 07:07:21] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 2 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 164 places in 233 ms of which 3 ms to minimize.
[2024-05-28 07:07:22] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 6 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 3 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 3 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 3 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 116 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:07:23] [INFO ] Deduced a trap composed of 121 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 3 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 111 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 3 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 111 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:07:24] [INFO ] Deduced a trap composed of 116 places in 176 ms of which 3 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 136 places in 566 ms of which 2 ms to minimize.
[2024-05-28 07:07:25] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:07:26] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:07:27] [INFO ] Deduced a trap composed of 164 places in 338 ms of which 3 ms to minimize.
[2024-05-28 07:07:27] [INFO ] Deduced a trap composed of 173 places in 306 ms of which 3 ms to minimize.
[2024-05-28 07:07:28] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 3 ms to minimize.
[2024-05-28 07:07:28] [INFO ] Deduced a trap composed of 135 places in 314 ms of which 3 ms to minimize.
[2024-05-28 07:07:28] [INFO ] Deduced a trap composed of 126 places in 326 ms of which 3 ms to minimize.
[2024-05-28 07:07:29] [INFO ] Deduced a trap composed of 179 places in 287 ms of which 3 ms to minimize.
[2024-05-28 07:07:29] [INFO ] Deduced a trap composed of 170 places in 275 ms of which 3 ms to minimize.
[2024-05-28 07:07:29] [INFO ] Deduced a trap composed of 135 places in 319 ms of which 3 ms to minimize.
[2024-05-28 07:07:30] [INFO ] Deduced a trap composed of 121 places in 288 ms of which 3 ms to minimize.
[2024-05-28 07:07:30] [INFO ] Deduced a trap composed of 168 places in 318 ms of which 3 ms to minimize.
[2024-05-28 07:07:30] [INFO ] Deduced a trap composed of 135 places in 313 ms of which 3 ms to minimize.
[2024-05-28 07:07:31] [INFO ] Deduced a trap composed of 126 places in 299 ms of which 3 ms to minimize.
[2024-05-28 07:07:31] [INFO ] Deduced a trap composed of 185 places in 293 ms of which 3 ms to minimize.
[2024-05-28 07:07:31] [INFO ] Deduced a trap composed of 170 places in 303 ms of which 3 ms to minimize.
[2024-05-28 07:07:32] [INFO ] Deduced a trap composed of 131 places in 264 ms of which 3 ms to minimize.
[2024-05-28 07:07:32] [INFO ] Deduced a trap composed of 125 places in 260 ms of which 3 ms to minimize.
[2024-05-28 07:07:32] [INFO ] Deduced a trap composed of 121 places in 241 ms of which 3 ms to minimize.
[2024-05-28 07:07:32] [INFO ] Deduced a trap composed of 120 places in 234 ms of which 2 ms to minimize.
[2024-05-28 07:07:33] [INFO ] Deduced a trap composed of 116 places in 232 ms of which 3 ms to minimize.
[2024-05-28 07:07:33] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 172 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 172 places in 173 ms of which 3 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:07:35] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 3 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 111 places in 227 ms of which 3 ms to minimize.
[2024-05-28 07:07:37] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 3 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 116 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:07:38] [INFO ] Deduced a trap composed of 131 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 116 places in 206 ms of which 2 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 171 places in 165 ms of which 3 ms to minimize.
[2024-05-28 07:07:39] [INFO ] Deduced a trap composed of 132 places in 168 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 400/1439 variables, and 135 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 83/83 constraints]
After SMT, in 45462ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 45479ms
[2024-05-28 07:07:40] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-28 07:07:40] [INFO ] Invariant cache hit.
[2024-05-28 07:07:40] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 07:07:40] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-28 07:07:40] [INFO ] Invariant cache hit.
[2024-05-28 07:07:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:07:42] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
[2024-05-28 07:07:42] [INFO ] Redundant transitions in 85 ms returned []
Running 1027 sub problems to find dead transitions.
[2024-05-28 07:07:42] [INFO ] Flow matrix only has 1029 transitions (discarded 9 similar events)
[2024-05-28 07:07:42] [INFO ] Invariant cache hit.
[2024-05-28 07:07:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 116 places in 201 ms of which 3 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 121 places in 197 ms of which 2 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:07:56] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 3 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 121 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 3 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 3 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:07:57] [INFO ] Deduced a trap composed of 106 places in 179 ms of which 3 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 4 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 3 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 126 places in 191 ms of which 2 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:07:58] [INFO ] Deduced a trap composed of 170 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 3 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 2 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:07:59] [INFO ] Deduced a trap composed of 116 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 3 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:08:00] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:08:01] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 111 places in 189 ms of which 3 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 3 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:08:02] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 2 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 2 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:08:03] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 5 (OVERLAPS) 9/409 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:08:16] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.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 (/ 2.0 3.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 1.0)
(s69 0.0)
(s70 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 409/1439 variables, and 102 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:08:21] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 13 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 175 places in 293 ms of which 3 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 162 places in 282 ms of which 3 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 93 places in 292 ms of which 3 ms to minimize.
[2024-05-28 07:08:25] [INFO ] Deduced a trap composed of 142 places in 297 ms of which 3 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 151 places in 287 ms of which 2 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 74 places in 269 ms of which 2 ms to minimize.
[2024-05-28 07:08:26] [INFO ] Deduced a trap composed of 79 places in 329 ms of which 3 ms to minimize.
[2024-05-28 07:08:27] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 3 ms to minimize.
[2024-05-28 07:08:27] [INFO ] Deduced a trap composed of 95 places in 325 ms of which 3 ms to minimize.
[2024-05-28 07:08:27] [INFO ] Deduced a trap composed of 86 places in 326 ms of which 4 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 79 places in 345 ms of which 3 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 93 places in 314 ms of which 3 ms to minimize.
[2024-05-28 07:08:28] [INFO ] Deduced a trap composed of 121 places in 331 ms of which 4 ms to minimize.
[2024-05-28 07:08:29] [INFO ] Deduced a trap composed of 180 places in 316 ms of which 3 ms to minimize.
[2024-05-28 07:08:34] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:08:35] [INFO ] Deduced a trap composed of 141 places in 315 ms of which 3 ms to minimize.
[2024-05-28 07:08:36] [INFO ] Deduced a trap composed of 121 places in 286 ms of which 3 ms to minimize.
[2024-05-28 07:08:36] [INFO ] Deduced a trap composed of 130 places in 290 ms of which 3 ms to minimize.
[2024-05-28 07:08:36] [INFO ] Deduced a trap composed of 116 places in 263 ms of which 3 ms to minimize.
[2024-05-28 07:08:37] [INFO ] Deduced a trap composed of 116 places in 243 ms of which 2 ms to minimize.
[2024-05-28 07:08:37] [INFO ] Deduced a trap composed of 125 places in 296 ms of which 6 ms to minimize.
[2024-05-28 07:08:37] [INFO ] Deduced a trap composed of 126 places in 309 ms of which 3 ms to minimize.
[2024-05-28 07:08:38] [INFO ] Deduced a trap composed of 138 places in 250 ms of which 2 ms to minimize.
[2024-05-28 07:08:39] [INFO ] Deduced a trap composed of 120 places in 297 ms of which 3 ms to minimize.
[2024-05-28 07:08:39] [INFO ] Deduced a trap composed of 141 places in 301 ms of which 3 ms to minimize.
[2024-05-28 07:08:39] [INFO ] Deduced a trap composed of 117 places in 318 ms of which 3 ms to minimize.
[2024-05-28 07:08:40] [INFO ] Deduced a trap composed of 117 places in 363 ms of which 4 ms to minimize.
[2024-05-28 07:08:40] [INFO ] Deduced a trap composed of 150 places in 345 ms of which 3 ms to minimize.
[2024-05-28 07:08:40] [INFO ] Deduced a trap composed of 131 places in 327 ms of which 3 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 145 places in 318 ms of which 2 ms to minimize.
[2024-05-28 07:08:41] [INFO ] Deduced a trap composed of 126 places in 285 ms of which 2 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 116 places in 295 ms of which 3 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 3 ms to minimize.
[2024-05-28 07:08:42] [INFO ] Deduced a trap composed of 146 places in 282 ms of which 3 ms to minimize.
[2024-05-28 07:08:43] [INFO ] Deduced a trap composed of 126 places in 317 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2024-05-28 07:08:44] [INFO ] Deduced a trap composed of 135 places in 198 ms of which 3 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 177 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:08:45] [INFO ] Deduced a trap composed of 117 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 123 places in 215 ms of which 3 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 117 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:08:46] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 3 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 123 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 180 places in 178 ms of which 3 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 123 places in 189 ms of which 3 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:08:47] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 3 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 3 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 117 places in 259 ms of which 3 ms to minimize.
[2024-05-28 07:08:48] [INFO ] Deduced a trap composed of 141 places in 245 ms of which 2 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 120 places in 255 ms of which 2 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 117 places in 314 ms of which 3 ms to minimize.
[2024-05-28 07:08:49] [INFO ] Deduced a trap composed of 123 places in 261 ms of which 3 ms to minimize.
[2024-05-28 07:08:50] [INFO ] Deduced a trap composed of 117 places in 356 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1439 variables, and 149 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 97/97 constraints]
After SMT, in 67402ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 67421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 410/463 places, 1038/1091 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115443 ms. Remains : 410/463 places, 1038/1091 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-06
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-06 finished in 115515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&X(X(X(F(!p1))))))'
Support contains 22 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 20 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:08:50] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-05-28 07:08:50] [INFO ] Computed 62 invariants in 27 ms
[2024-05-28 07:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.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 1.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 1.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 4.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 9.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 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:09:20] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 3 ms to minimize.
[2024-05-28 07:09:20] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/1545 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 47042ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 47064ms
[2024-05-28 07:09:37] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:09:37] [INFO ] Invariant cache hit.
[2024-05-28 07:09:37] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 07:09:37] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:09:37] [INFO ] Invariant cache hit.
[2024-05-28 07:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:09:40] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 2547 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:09:40] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:09:40] [INFO ] Invariant cache hit.
[2024-05-28 07:09:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 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 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:10:27] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 4 ms to minimize.
[2024-05-28 07:10:34] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 66618ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 66633ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 11 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116287 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) p1), (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, p1]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-09
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-09 finished in 116553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1||G(F((G(p2)||(p2&&F(!p3))))))))))'
Support contains 67 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 14 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:10:47] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:10:47] [INFO ] Invariant cache hit.
[2024-05-28 07:10:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:11:23] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
[2024-05-28 07:11:30] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 45851ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 45867ms
[2024-05-28 07:11:32] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:11:32] [INFO ] Invariant cache hit.
[2024-05-28 07:11:33] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-28 07:11:33] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:11:33] [INFO ] Invariant cache hit.
[2024-05-28 07:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:11:34] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:11:34] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:11:34] [INFO ] Invariant cache hit.
[2024-05-28 07:11:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:12:21] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 3 ms to minimize.
[2024-05-28 07:12:27] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 66046ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 66075ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 15 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113785 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 653 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-10
Stuttering criterion allowed to conclude after 149 steps with 10 reset in 6 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-10 finished in 114477 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)||F(G(p1)))))'
Support contains 23 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 19 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:12:41] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:12:41] [INFO ] Invariant cache hit.
[2024-05-28 07:12:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:13:18] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2024-05-28 07:13:25] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 46761ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 46781ms
[2024-05-28 07:13:28] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:13:28] [INFO ] Invariant cache hit.
[2024-05-28 07:13:28] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 07:13:28] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:13:28] [INFO ] Invariant cache hit.
[2024-05-28 07:13:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:13:30] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:13:30] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:13:30] [INFO ] Invariant cache hit.
[2024-05-28 07:13:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
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 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:14:16] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 3 ms to minimize.
[2024-05-28 07:14:22] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 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 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 65752ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 65766ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 11 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114763 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-11
Product exploration explored 100000 steps with 5598 reset in 674 ms.
Product exploration explored 100000 steps with 5594 reset in 681 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 p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2239 resets) in 636 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (418 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (422 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 306140 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 306140 steps, saw 87293 distinct states, run finished after 3005 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-28 07:14:41] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2024-05-28 07:14:41] [INFO ] Computed 62 invariants in 11 ms
[2024-05-28 07:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 188/211 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 212/423 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/450 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/461 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:14:41] [INFO ] Deduced a trap composed of 218 places in 264 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/462 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1025/1487 variables, 462/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1487 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1487 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1488 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1488 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1488/1488 variables, and 527 constraints, problems are : Problem set: 0 solved, 2 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 463/463 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 188/211 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 212/423 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/450 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/461 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:14:42] [INFO ] Deduced a trap composed of 125 places in 255 ms of which 3 ms to minimize.
[2024-05-28 07:14:43] [INFO ] Deduced a trap composed of 125 places in 252 ms of which 3 ms to minimize.
[2024-05-28 07:14:43] [INFO ] Deduced a trap composed of 116 places in 255 ms of which 3 ms to minimize.
[2024-05-28 07:14:43] [INFO ] Deduced a trap composed of 125 places in 383 ms of which 7 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 228 places in 362 ms of which 25 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 244 places in 268 ms of which 3 ms to minimize.
[2024-05-28 07:14:44] [INFO ] Deduced a trap composed of 240 places in 338 ms of which 6 ms to minimize.
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 228 places in 339 ms of which 6 ms to minimize.
[2024-05-28 07:14:45] [INFO ] Deduced a trap composed of 224 places in 358 ms of which 7 ms to minimize.
[2024-05-28 07:14:46] [INFO ] Deduced a trap composed of 236 places in 500 ms of which 6 ms to minimize.
[2024-05-28 07:14:46] [INFO ] Deduced a trap composed of 220 places in 350 ms of which 5 ms to minimize.
[2024-05-28 07:14:47] [INFO ] Deduced a trap composed of 228 places in 594 ms of which 3 ms to minimize.
[2024-05-28 07:14:47] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 21 ms to minimize.
[2024-05-28 07:14:47] [INFO ] Deduced a trap composed of 232 places in 209 ms of which 7 ms to minimize.
SMT process timed out in 5937ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1034/1034 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 463 transition count 1010
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 48 place count 439 transition count 985
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 98 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 412 transition count 983
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 412 transition count 982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 411 transition count 982
Applied a total of 104 rules in 91 ms. Remains 411 /463 variables (removed 52) and now considering 982/1034 (removed 52) transitions.
Running 971 sub problems to find dead transitions.
[2024-05-28 07:14:47] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-28 07:14:47] [INFO ] Computed 62 invariants in 11 ms
[2024-05-28 07:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:14:57] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 3 ms to minimize.
[2024-05-28 07:14:57] [INFO ] Deduced a trap composed of 132 places in 180 ms of which 3 ms to minimize.
[2024-05-28 07:14:58] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 2 ms to minimize.
[2024-05-28 07:14:58] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 3 ms to minimize.
[2024-05-28 07:14:58] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 3 ms to minimize.
[2024-05-28 07:14:58] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 3 ms to minimize.
[2024-05-28 07:14:58] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 3 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 3 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 3 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:14:59] [INFO ] Deduced a trap composed of 117 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 127 places in 261 ms of which 3 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:15:00] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:15:01] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:15:06] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1384 variables, and 73 constraints, problems are : Problem set: 0 solved, 971 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 21/73 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:15:13] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 2 ms to minimize.
[2024-05-28 07:15:13] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 3 ms to minimize.
[2024-05-28 07:15:13] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 3 ms to minimize.
[2024-05-28 07:15:13] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 169 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 2 ms to minimize.
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 3 ms to minimize.
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:15:14] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 169 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 169 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:15:15] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:15:16] [INFO ] Deduced a trap composed of 169 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:15:16] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:15:16] [INFO ] Deduced a trap composed of 163 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:15:16] [INFO ] Deduced a trap composed of 117 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 117 places in 173 ms of which 3 ms to minimize.
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 3 ms to minimize.
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 2 ms to minimize.
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 2 ms to minimize.
[2024-05-28 07:15:17] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 3 ms to minimize.
[2024-05-28 07:15:18] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:15:18] [INFO ] Deduced a trap composed of 117 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:15:18] [INFO ] Deduced a trap composed of 163 places in 219 ms of which 3 ms to minimize.
[2024-05-28 07:15:18] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 2 ms to minimize.
[2024-05-28 07:15:18] [INFO ] Deduced a trap composed of 108 places in 227 ms of which 2 ms to minimize.
[2024-05-28 07:15:19] [INFO ] Deduced a trap composed of 126 places in 224 ms of which 3 ms to minimize.
[2024-05-28 07:15:19] [INFO ] Deduced a trap composed of 122 places in 224 ms of which 2 ms to minimize.
[2024-05-28 07:15:19] [INFO ] Deduced a trap composed of 121 places in 233 ms of which 2 ms to minimize.
[2024-05-28 07:15:19] [INFO ] Deduced a trap composed of 123 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:15:20] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 2 ms to minimize.
[2024-05-28 07:15:20] [INFO ] Deduced a trap composed of 122 places in 210 ms of which 2 ms to minimize.
[2024-05-28 07:15:20] [INFO ] Deduced a trap composed of 108 places in 231 ms of which 3 ms to minimize.
[2024-05-28 07:15:20] [INFO ] Deduced a trap composed of 113 places in 237 ms of which 2 ms to minimize.
[2024-05-28 07:15:21] [INFO ] Deduced a trap composed of 113 places in 232 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:15:21] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2024-05-28 07:15:22] [INFO ] Deduced a trap composed of 122 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:15:22] [INFO ] Deduced a trap composed of 107 places in 226 ms of which 2 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 131 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 127 places in 243 ms of which 3 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 107 places in 236 ms of which 2 ms to minimize.
[2024-05-28 07:15:23] [INFO ] Deduced a trap composed of 126 places in 234 ms of which 3 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 122 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 112 places in 234 ms of which 2 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 2 ms to minimize.
[2024-05-28 07:15:24] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 2 ms to minimize.
[2024-05-28 07:15:25] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 2 ms to minimize.
[2024-05-28 07:15:25] [INFO ] Deduced a trap composed of 170 places in 232 ms of which 2 ms to minimize.
[2024-05-28 07:15:25] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2024-05-28 07:15:25] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 2 ms to minimize.
[2024-05-28 07:15:26] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 2 ms to minimize.
[2024-05-28 07:15:26] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 2 ms to minimize.
[2024-05-28 07:15:26] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 2 ms to minimize.
[2024-05-28 07:15:26] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 2 ms to minimize.
[2024-05-28 07:15:27] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:15:27] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:15:27] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:15:27] [INFO ] Deduced a trap composed of 169 places in 171 ms of which 2 ms to minimize.
[2024-05-28 07:15:28] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 3 ms to minimize.
[2024-05-28 07:15:28] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:15:28] [INFO ] Deduced a trap composed of 169 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:15:28] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:15:28] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 3 ms to minimize.
[2024-05-28 07:15:28] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 2 ms to minimize.
[2024-05-28 07:15:29] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:15:29] [INFO ] Deduced a trap composed of 169 places in 146 ms of which 3 ms to minimize.
[2024-05-28 07:15:29] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:15:29] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:15:29] [INFO ] Deduced a trap composed of 173 places in 173 ms of which 3 ms to minimize.
[2024-05-28 07:15:30] [INFO ] Deduced a trap composed of 175 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:15:30] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
[2024-05-28 07:15:30] [INFO ] Deduced a trap composed of 163 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:15:30] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:15:30] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 3 ms to minimize.
[2024-05-28 07:15:30] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 07:15:31] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 2 ms to minimize.
[2024-05-28 07:15:31] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 3 ms to minimize.
[2024-05-28 07:15:31] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:15:31] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 2 ms to minimize.
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:15:32] [INFO ] Deduced a trap composed of 117 places in 154 ms of which 13 ms to minimize.
SMT process timed out in 44877ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 44887ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44981 ms. Remains : 411/463 places, 982/1034 transitions.
RANDOM walk for 2721 steps (207 resets) in 33 ms. (80 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 23 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1034/1034 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 463 transition count 1010
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 439 transition count 1010
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 48 place count 439 transition count 985
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 98 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 412 transition count 983
Applied a total of 102 rules in 55 ms. Remains 412 /463 variables (removed 51) and now considering 983/1034 (removed 51) transitions.
Running 972 sub problems to find dead transitions.
[2024-05-28 07:15:32] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2024-05-28 07:15:32] [INFO ] Computed 62 invariants in 9 ms
[2024-05-28 07:15:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:15:43] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 3 ms to minimize.
[2024-05-28 07:15:43] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:15:43] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:15:43] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:15:43] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 3 ms to minimize.
[2024-05-28 07:15:44] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:15:44] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 2 ms to minimize.
[2024-05-28 07:15:44] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:15:44] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 3 ms to minimize.
[2024-05-28 07:15:44] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 2 ms to minimize.
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 118 places in 177 ms of which 2 ms to minimize.
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:15:45] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:15:46] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 4 ms to minimize.
[2024-05-28 07:15:46] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:15:46] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 2 ms to minimize.
[2024-05-28 07:15:46] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:15:47] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:15:47] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:15:47] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 3 ms to minimize.
[2024-05-28 07:15:47] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2024-05-28 07:15:47] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:15:47] [INFO ] Deduced a trap composed of 166 places in 161 ms of which 3 ms to minimize.
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 3 ms to minimize.
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 172 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:15:48] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:15:49] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 2 ms to minimize.
[2024-05-28 07:15:49] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:15:49] [INFO ] Deduced a trap composed of 166 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:15:49] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:15:49] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:15:49] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:15:50] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2024-05-28 07:15:50] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 3 ms to minimize.
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:15:56] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 2 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:15:57] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 2 ms to minimize.
SMT process timed out in 24775ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 24785ms
[2024-05-28 07:15:57] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:15:57] [INFO ] Invariant cache hit.
[2024-05-28 07:15:57] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-28 07:15:57] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:15:57] [INFO ] Invariant cache hit.
[2024-05-28 07:15:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:15:59] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2024-05-28 07:15:59] [INFO ] Redundant transitions in 35 ms returned []
Running 972 sub problems to find dead transitions.
[2024-05-28 07:15:59] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:15:59] [INFO ] Invariant cache hit.
[2024-05-28 07:15:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:10] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:16:10] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 2 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 133 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 133 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 3 ms to minimize.
[2024-05-28 07:16:11] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 2 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 3 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 128 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:16:12] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 3 ms to minimize.
[2024-05-28 07:16:13] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 2 ms to minimize.
[2024-05-28 07:16:13] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 3 ms to minimize.
[2024-05-28 07:16:13] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:16:13] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:16:13] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:16:14] [INFO ] Deduced a trap composed of 123 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:14] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:16:14] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:16:14] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:16:15] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:16:15] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 2 ms to minimize.
[2024-05-28 07:16:15] [INFO ] Deduced a trap composed of 118 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:16:15] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:16:15] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 2 ms to minimize.
[2024-05-28 07:16:15] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:16:16] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 8 ms to minimize.
[2024-05-28 07:16:16] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 3 ms to minimize.
[2024-05-28 07:16:16] [INFO ] Deduced a trap composed of 143 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:16:16] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:16:16] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 3 ms to minimize.
[2024-05-28 07:16:16] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:16:17] [INFO ] Deduced a trap composed of 113 places in 163 ms of which 2 ms to minimize.
[2024-05-28 07:16:17] [INFO ] Deduced a trap composed of 113 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:16:17] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 3 ms to minimize.
[2024-05-28 07:16:17] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 3 ms to minimize.
[2024-05-28 07:16:17] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:16:23] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 2 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 172 places in 140 ms of which 3 ms to minimize.
[2024-05-28 07:16:24] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 2 ms to minimize.
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 170 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 3 ms to minimize.
[2024-05-28 07:16:25] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 3 ms to minimize.
[2024-05-28 07:16:26] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 3 ms to minimize.
[2024-05-28 07:16:26] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:16:26] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:16:26] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:16:26] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:27] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 2 ms to minimize.
[2024-05-28 07:16:27] [INFO ] Deduced a trap composed of 123 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:16:27] [INFO ] Deduced a trap composed of 123 places in 213 ms of which 3 ms to minimize.
[2024-05-28 07:16:27] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 3 ms to minimize.
[2024-05-28 07:16:28] [INFO ] Deduced a trap composed of 118 places in 172 ms of which 3 ms to minimize.
[2024-05-28 07:16:28] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 3 ms to minimize.
[2024-05-28 07:16:29] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 2 ms to minimize.
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 3 ms to minimize.
[2024-05-28 07:16:30] [INFO ] Deduced a trap composed of 118 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:16:31] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 2 ms to minimize.
[2024-05-28 07:16:31] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:16:31] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:32] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-05-28 07:16:32] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 3 ms to minimize.
[2024-05-28 07:16:33] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:16:33] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 3 ms to minimize.
[2024-05-28 07:16:33] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 3 ms to minimize.
[2024-05-28 07:16:33] [INFO ] Deduced a trap composed of 128 places in 195 ms of which 3 ms to minimize.
[2024-05-28 07:16:33] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2024-05-28 07:16:33] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:16:34] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:16:34] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:16:34] [INFO ] Deduced a trap composed of 103 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:16:34] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 3 ms to minimize.
[2024-05-28 07:16:34] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 3 ms to minimize.
(s26 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1386 variables, and 145 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 93/145 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:36] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:16:36] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:16:36] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:16:36] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 172 places in 172 ms of which 3 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 172 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 6 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:16:37] [INFO ] Deduced a trap composed of 122 places in 218 ms of which 2 ms to minimize.
[2024-05-28 07:16:38] [INFO ] Deduced a trap composed of 114 places in 261 ms of which 2 ms to minimize.
[2024-05-28 07:16:38] [INFO ] Deduced a trap composed of 188 places in 272 ms of which 3 ms to minimize.
[2024-05-28 07:16:38] [INFO ] Deduced a trap composed of 107 places in 265 ms of which 3 ms to minimize.
[2024-05-28 07:16:39] [INFO ] Deduced a trap composed of 177 places in 263 ms of which 2 ms to minimize.
[2024-05-28 07:16:39] [INFO ] Deduced a trap composed of 125 places in 212 ms of which 3 ms to minimize.
[2024-05-28 07:16:39] [INFO ] Deduced a trap composed of 191 places in 285 ms of which 3 ms to minimize.
[2024-05-28 07:16:39] [INFO ] Deduced a trap composed of 131 places in 252 ms of which 3 ms to minimize.
[2024-05-28 07:16:40] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 2 ms to minimize.
[2024-05-28 07:16:40] [INFO ] Deduced a trap composed of 185 places in 234 ms of which 2 ms to minimize.
[2024-05-28 07:16:40] [INFO ] Deduced a trap composed of 180 places in 227 ms of which 2 ms to minimize.
[2024-05-28 07:16:40] [INFO ] Deduced a trap composed of 131 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:41] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-05-28 07:16:41] [INFO ] Deduced a trap composed of 113 places in 232 ms of which 3 ms to minimize.
[2024-05-28 07:16:41] [INFO ] Deduced a trap composed of 122 places in 294 ms of which 3 ms to minimize.
[2024-05-28 07:16:42] [INFO ] Deduced a trap composed of 108 places in 225 ms of which 2 ms to minimize.
[2024-05-28 07:16:42] [INFO ] Deduced a trap composed of 118 places in 293 ms of which 3 ms to minimize.
[2024-05-28 07:16:42] [INFO ] Deduced a trap composed of 119 places in 296 ms of which 3 ms to minimize.
[2024-05-28 07:16:43] [INFO ] Deduced a trap composed of 108 places in 262 ms of which 2 ms to minimize.
[2024-05-28 07:16:43] [INFO ] Deduced a trap composed of 128 places in 206 ms of which 2 ms to minimize.
[2024-05-28 07:16:43] [INFO ] Deduced a trap composed of 103 places in 265 ms of which 3 ms to minimize.
[2024-05-28 07:16:43] [INFO ] Deduced a trap composed of 117 places in 330 ms of which 3 ms to minimize.
[2024-05-28 07:16:44] [INFO ] Deduced a trap composed of 109 places in 278 ms of which 3 ms to minimize.
[2024-05-28 07:16:44] [INFO ] Deduced a trap composed of 128 places in 270 ms of which 3 ms to minimize.
[2024-05-28 07:16:44] [INFO ] Deduced a trap composed of 117 places in 300 ms of which 4 ms to minimize.
[2024-05-28 07:16:45] [INFO ] Deduced a trap composed of 119 places in 263 ms of which 2 ms to minimize.
[2024-05-28 07:16:45] [INFO ] Deduced a trap composed of 132 places in 240 ms of which 3 ms to minimize.
[2024-05-28 07:16:45] [INFO ] Deduced a trap composed of 123 places in 281 ms of which 3 ms to minimize.
[2024-05-28 07:16:45] [INFO ] Deduced a trap composed of 119 places in 280 ms of which 3 ms to minimize.
[2024-05-28 07:16:46] [INFO ] Deduced a trap composed of 127 places in 288 ms of which 3 ms to minimize.
[2024-05-28 07:16:46] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 3 ms to minimize.
[2024-05-28 07:16:46] [INFO ] Deduced a trap composed of 132 places in 241 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:47] [INFO ] Deduced a trap composed of 133 places in 332 ms of which 3 ms to minimize.
[2024-05-28 07:16:47] [INFO ] Deduced a trap composed of 118 places in 291 ms of which 3 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 122 places in 252 ms of which 3 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 113 places in 220 ms of which 2 ms to minimize.
[2024-05-28 07:16:48] [INFO ] Deduced a trap composed of 127 places in 213 ms of which 2 ms to minimize.
[2024-05-28 07:16:49] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 3 ms to minimize.
[2024-05-28 07:16:49] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 3 ms to minimize.
[2024-05-28 07:16:49] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-05-28 07:16:49] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 3 ms to minimize.
[2024-05-28 07:16:50] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 3 ms to minimize.
[2024-05-28 07:16:50] [INFO ] Deduced a trap composed of 133 places in 289 ms of which 3 ms to minimize.
[2024-05-28 07:16:50] [INFO ] Deduced a trap composed of 114 places in 225 ms of which 2 ms to minimize.
[2024-05-28 07:16:50] [INFO ] Deduced a trap composed of 119 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:16:51] [INFO ] Deduced a trap composed of 118 places in 290 ms of which 2 ms to minimize.
[2024-05-28 07:16:51] [INFO ] Deduced a trap composed of 113 places in 226 ms of which 2 ms to minimize.
[2024-05-28 07:16:51] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 3 ms to minimize.
[2024-05-28 07:16:51] [INFO ] Deduced a trap composed of 117 places in 211 ms of which 2 ms to minimize.
[2024-05-28 07:16:52] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 2 ms to minimize.
[2024-05-28 07:16:52] [INFO ] Deduced a trap composed of 122 places in 240 ms of which 2 ms to minimize.
[2024-05-28 07:16:52] [INFO ] Deduced a trap composed of 124 places in 229 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:53] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:16:53] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:16:53] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:16:53] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:16:53] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 3 ms to minimize.
[2024-05-28 07:16:53] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 3 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 3 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:16:54] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 117 places in 269 ms of which 2 ms to minimize.
[2024-05-28 07:16:55] [INFO ] Deduced a trap composed of 127 places in 234 ms of which 2 ms to minimize.
[2024-05-28 07:16:56] [INFO ] Deduced a trap composed of 113 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:16:56] [INFO ] Deduced a trap composed of 134 places in 260 ms of which 2 ms to minimize.
[2024-05-28 07:16:56] [INFO ] Deduced a trap composed of 127 places in 234 ms of which 3 ms to minimize.
[2024-05-28 07:16:56] [INFO ] Deduced a trap composed of 117 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:16:57] [INFO ] Deduced a trap composed of 112 places in 250 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:16:58] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:16:58] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 3 ms to minimize.
[2024-05-28 07:16:58] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 2 ms to minimize.
[2024-05-28 07:16:58] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 2 ms to minimize.
[2024-05-28 07:16:58] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:16:59] [INFO ] Deduced a trap composed of 123 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:16:59] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:16:59] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:16:59] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 2 ms to minimize.
[2024-05-28 07:16:59] [INFO ] Deduced a trap composed of 109 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:16:59] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:17:00] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:17:00] [INFO ] Deduced a trap composed of 128 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:17:00] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-05-28 07:17:00] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:17:00] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:17:01] [INFO ] Deduced a trap composed of 108 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:17:01] [INFO ] Deduced a trap composed of 129 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:17:01] [INFO ] Deduced a trap composed of 119 places in 221 ms of which 3 ms to minimize.
[2024-05-28 07:17:01] [INFO ] Deduced a trap composed of 134 places in 190 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:02] [INFO ] Deduced a trap composed of 113 places in 265 ms of which 2 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 122 places in 296 ms of which 3 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 119 places in 272 ms of which 3 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 2 ms to minimize.
[2024-05-28 07:17:03] [INFO ] Deduced a trap composed of 124 places in 300 ms of which 3 ms to minimize.
[2024-05-28 07:17:04] [INFO ] Deduced a trap composed of 122 places in 282 ms of which 3 ms to minimize.
[2024-05-28 07:17:04] [INFO ] Deduced a trap composed of 114 places in 297 ms of which 3 ms to minimize.
[2024-05-28 07:17:04] [INFO ] Deduced a trap composed of 134 places in 257 ms of which 2 ms to minimize.
[2024-05-28 07:17:05] [INFO ] Deduced a trap composed of 118 places in 250 ms of which 2 ms to minimize.
SMT process timed out in 65561ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 65571ms
Starting structural reductions in SI_LTL mode, iteration 1 : 412/463 places, 983/1034 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92455 ms. Remains : 412/463 places, 983/1034 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 975 steps (74 resets) in 15 ms. (60 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7174 reset in 840 ms.
Product exploration explored 100000 steps with 7121 reset in 817 ms.
Support contains 23 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 983/983 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 983/983 (removed 0) transitions.
Running 972 sub problems to find dead transitions.
[2024-05-28 07:17:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:17:07] [INFO ] Invariant cache hit.
[2024-05-28 07:17:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:17] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:17:17] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 3 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:17:18] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 3 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 2 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:17:19] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:17:20] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:17:20] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:17:20] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:17:20] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:17:20] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:21] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:17:21] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:17:21] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:17:21] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 3 ms to minimize.
[2024-05-28 07:17:21] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:17:22] [INFO ] Deduced a trap composed of 118 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:17:22] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:17:22] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 3 ms to minimize.
[2024-05-28 07:17:22] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:17:22] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:17:22] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 3 ms to minimize.
[2024-05-28 07:17:23] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:17:23] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:17:23] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:17:23] [INFO ] Deduced a trap composed of 118 places in 179 ms of which 2 ms to minimize.
[2024-05-28 07:17:23] [INFO ] Deduced a trap composed of 113 places in 189 ms of which 2 ms to minimize.
[2024-05-28 07:17:24] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 3 ms to minimize.
[2024-05-28 07:17:24] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-05-28 07:17:24] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:17:24] [INFO ] Deduced a trap composed of 123 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:30] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 2 ms to minimize.
[2024-05-28 07:17:31] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:17:31] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 3 ms to minimize.
[2024-05-28 07:17:31] [INFO ] Deduced a trap composed of 133 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:17:31] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:17:31] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:17:31] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 2 ms to minimize.
SMT process timed out in 24626ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 24636ms
[2024-05-28 07:17:31] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:17:31] [INFO ] Invariant cache hit.
[2024-05-28 07:17:32] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-28 07:17:32] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:17:32] [INFO ] Invariant cache hit.
[2024-05-28 07:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:17:33] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2024-05-28 07:17:33] [INFO ] Redundant transitions in 11 ms returned []
Running 972 sub problems to find dead transitions.
[2024-05-28 07:17:33] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
[2024-05-28 07:17:33] [INFO ] Invariant cache hit.
[2024-05-28 07:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:44] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 3 ms to minimize.
[2024-05-28 07:17:44] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 3 ms to minimize.
[2024-05-28 07:17:44] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:17:44] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-05-28 07:17:44] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 3 ms to minimize.
[2024-05-28 07:17:45] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 07:17:45] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:17:45] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 3 ms to minimize.
[2024-05-28 07:17:45] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:17:45] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:17:45] [INFO ] Deduced a trap composed of 123 places in 175 ms of which 2 ms to minimize.
[2024-05-28 07:17:46] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 2 ms to minimize.
[2024-05-28 07:17:46] [INFO ] Deduced a trap composed of 128 places in 254 ms of which 3 ms to minimize.
[2024-05-28 07:17:46] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 2 ms to minimize.
[2024-05-28 07:17:46] [INFO ] Deduced a trap composed of 128 places in 192 ms of which 3 ms to minimize.
[2024-05-28 07:17:46] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:17:47] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:17:47] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:17:47] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 3 ms to minimize.
[2024-05-28 07:17:47] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:47] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 3 ms to minimize.
[2024-05-28 07:17:48] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:17:48] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:17:48] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 3 ms to minimize.
[2024-05-28 07:17:48] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:17:48] [INFO ] Deduced a trap composed of 118 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:17:49] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 2 ms to minimize.
[2024-05-28 07:17:49] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 2 ms to minimize.
[2024-05-28 07:17:49] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:17:49] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:17:49] [INFO ] Deduced a trap composed of 113 places in 163 ms of which 3 ms to minimize.
[2024-05-28 07:17:49] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:17:50] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 3 ms to minimize.
[2024-05-28 07:17:50] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 3 ms to minimize.
[2024-05-28 07:17:50] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:17:50] [INFO ] Deduced a trap composed of 113 places in 226 ms of which 3 ms to minimize.
[2024-05-28 07:17:51] [INFO ] Deduced a trap composed of 113 places in 278 ms of which 3 ms to minimize.
[2024-05-28 07:17:51] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 2 ms to minimize.
[2024-05-28 07:17:51] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:17:51] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:17:57] [INFO ] Deduced a trap composed of 133 places in 254 ms of which 2 ms to minimize.
[2024-05-28 07:17:58] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 2 ms to minimize.
[2024-05-28 07:17:58] [INFO ] Deduced a trap composed of 133 places in 240 ms of which 2 ms to minimize.
[2024-05-28 07:17:58] [INFO ] Deduced a trap composed of 133 places in 208 ms of which 3 ms to minimize.
[2024-05-28 07:17:58] [INFO ] Deduced a trap composed of 133 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:17:59] [INFO ] Deduced a trap composed of 143 places in 245 ms of which 2 ms to minimize.
[2024-05-28 07:17:59] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 3 ms to minimize.
[2024-05-28 07:17:59] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:17:59] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 2 ms to minimize.
[2024-05-28 07:17:59] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 2 ms to minimize.
[2024-05-28 07:18:00] [INFO ] Deduced a trap composed of 170 places in 241 ms of which 4 ms to minimize.
[2024-05-28 07:18:00] [INFO ] Deduced a trap composed of 170 places in 246 ms of which 2 ms to minimize.
[2024-05-28 07:18:00] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 3 ms to minimize.
[2024-05-28 07:18:00] [INFO ] Deduced a trap composed of 170 places in 240 ms of which 3 ms to minimize.
[2024-05-28 07:18:01] [INFO ] Deduced a trap composed of 170 places in 241 ms of which 2 ms to minimize.
[2024-05-28 07:18:01] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 2 ms to minimize.
[2024-05-28 07:18:01] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 2 ms to minimize.
[2024-05-28 07:18:02] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-28 07:18:02] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2024-05-28 07:18:02] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:18:03] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 3 ms to minimize.
[2024-05-28 07:18:03] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 2 ms to minimize.
[2024-05-28 07:18:03] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:18:03] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 3 ms to minimize.
[2024-05-28 07:18:03] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 2 ms to minimize.
[2024-05-28 07:18:05] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 3 ms to minimize.
[2024-05-28 07:18:05] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:18:05] [INFO ] Deduced a trap composed of 118 places in 169 ms of which 2 ms to minimize.
[2024-05-28 07:18:05] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:18:05] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:18:05] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:18:06] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:18:06] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 3 ms to minimize.
[2024-05-28 07:18:06] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:18:06] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:18:06] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:18:06] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 3 ms to minimize.
[2024-05-28 07:18:07] [INFO ] Deduced a trap composed of 113 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:18:07] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 3 ms to minimize.
[2024-05-28 07:18:07] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 972 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 402/1386 variables, and 132 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 80/132 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:18:09] [INFO ] Deduced a trap composed of 103 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:18:10] [INFO ] Deduced a trap composed of 113 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:18:10] [INFO ] Deduced a trap composed of 122 places in 306 ms of which 3 ms to minimize.
[2024-05-28 07:18:10] [INFO ] Deduced a trap composed of 109 places in 258 ms of which 2 ms to minimize.
[2024-05-28 07:18:11] [INFO ] Deduced a trap composed of 112 places in 236 ms of which 2 ms to minimize.
[2024-05-28 07:18:11] [INFO ] Deduced a trap composed of 109 places in 219 ms of which 2 ms to minimize.
[2024-05-28 07:18:11] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 2 ms to minimize.
[2024-05-28 07:18:11] [INFO ] Deduced a trap composed of 114 places in 220 ms of which 2 ms to minimize.
[2024-05-28 07:18:11] [INFO ] Deduced a trap composed of 127 places in 203 ms of which 2 ms to minimize.
[2024-05-28 07:18:12] [INFO ] Deduced a trap composed of 103 places in 209 ms of which 2 ms to minimize.
[2024-05-28 07:18:12] [INFO ] Deduced a trap composed of 119 places in 232 ms of which 2 ms to minimize.
[2024-05-28 07:18:12] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 2 ms to minimize.
[2024-05-28 07:18:12] [INFO ] Deduced a trap composed of 114 places in 223 ms of which 3 ms to minimize.
[2024-05-28 07:18:13] [INFO ] Deduced a trap composed of 108 places in 209 ms of which 2 ms to minimize.
[2024-05-28 07:18:13] [INFO ] Deduced a trap composed of 113 places in 232 ms of which 3 ms to minimize.
[2024-05-28 07:18:13] [INFO ] Deduced a trap composed of 118 places in 240 ms of which 2 ms to minimize.
[2024-05-28 07:18:13] [INFO ] Deduced a trap composed of 132 places in 232 ms of which 2 ms to minimize.
[2024-05-28 07:18:14] [INFO ] Deduced a trap composed of 124 places in 225 ms of which 2 ms to minimize.
[2024-05-28 07:18:14] [INFO ] Deduced a trap composed of 103 places in 213 ms of which 2 ms to minimize.
[2024-05-28 07:18:14] [INFO ] Deduced a trap composed of 122 places in 228 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:18:15] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 2 ms to minimize.
[2024-05-28 07:18:16] [INFO ] Deduced a trap composed of 122 places in 284 ms of which 3 ms to minimize.
[2024-05-28 07:18:16] [INFO ] Deduced a trap composed of 147 places in 257 ms of which 2 ms to minimize.
[2024-05-28 07:18:17] [INFO ] Deduced a trap composed of 103 places in 253 ms of which 2 ms to minimize.
[2024-05-28 07:18:17] [INFO ] Deduced a trap composed of 103 places in 244 ms of which 2 ms to minimize.
[2024-05-28 07:18:17] [INFO ] Deduced a trap composed of 108 places in 242 ms of which 2 ms to minimize.
[2024-05-28 07:18:17] [INFO ] Deduced a trap composed of 112 places in 218 ms of which 2 ms to minimize.
[2024-05-28 07:18:18] [INFO ] Deduced a trap composed of 103 places in 221 ms of which 3 ms to minimize.
[2024-05-28 07:18:18] [INFO ] Deduced a trap composed of 118 places in 265 ms of which 2 ms to minimize.
[2024-05-28 07:18:18] [INFO ] Deduced a trap composed of 104 places in 276 ms of which 3 ms to minimize.
[2024-05-28 07:18:19] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 2 ms to minimize.
[2024-05-28 07:18:19] [INFO ] Deduced a trap composed of 123 places in 279 ms of which 2 ms to minimize.
[2024-05-28 07:18:19] [INFO ] Deduced a trap composed of 118 places in 274 ms of which 2 ms to minimize.
[2024-05-28 07:18:19] [INFO ] Deduced a trap composed of 123 places in 297 ms of which 3 ms to minimize.
[2024-05-28 07:18:20] [INFO ] Deduced a trap composed of 123 places in 265 ms of which 3 ms to minimize.
[2024-05-28 07:18:20] [INFO ] Deduced a trap composed of 127 places in 272 ms of which 2 ms to minimize.
[2024-05-28 07:18:20] [INFO ] Deduced a trap composed of 118 places in 267 ms of which 2 ms to minimize.
[2024-05-28 07:18:21] [INFO ] Deduced a trap composed of 127 places in 288 ms of which 3 ms to minimize.
[2024-05-28 07:18:21] [INFO ] Deduced a trap composed of 113 places in 275 ms of which 3 ms to minimize.
[2024-05-28 07:18:21] [INFO ] Deduced a trap composed of 147 places in 294 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:18:23] [INFO ] Deduced a trap composed of 122 places in 234 ms of which 3 ms to minimize.
[2024-05-28 07:18:23] [INFO ] Deduced a trap composed of 117 places in 237 ms of which 2 ms to minimize.
[2024-05-28 07:18:23] [INFO ] Deduced a trap composed of 113 places in 251 ms of which 3 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 109 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 123 places in 218 ms of which 3 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 119 places in 229 ms of which 2 ms to minimize.
[2024-05-28 07:18:24] [INFO ] Deduced a trap composed of 113 places in 230 ms of which 3 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 132 places in 228 ms of which 3 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 118 places in 233 ms of which 3 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 123 places in 228 ms of which 3 ms to minimize.
[2024-05-28 07:18:25] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 2 ms to minimize.
[2024-05-28 07:18:26] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 2 ms to minimize.
[2024-05-28 07:18:26] [INFO ] Deduced a trap composed of 118 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:18:26] [INFO ] Deduced a trap composed of 170 places in 248 ms of which 2 ms to minimize.
[2024-05-28 07:18:27] [INFO ] Deduced a trap composed of 123 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:18:27] [INFO ] Deduced a trap composed of 123 places in 229 ms of which 2 ms to minimize.
[2024-05-28 07:18:27] [INFO ] Deduced a trap composed of 118 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:18:27] [INFO ] Deduced a trap composed of 128 places in 236 ms of which 3 ms to minimize.
[2024-05-28 07:18:27] [INFO ] Deduced a trap composed of 112 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:18:28] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:18:29] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 4 ms to minimize.
[2024-05-28 07:18:29] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 4 ms to minimize.
[2024-05-28 07:18:29] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:18:29] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 2 ms to minimize.
[2024-05-28 07:18:29] [INFO ] Deduced a trap composed of 112 places in 259 ms of which 3 ms to minimize.
[2024-05-28 07:18:30] [INFO ] Deduced a trap composed of 127 places in 256 ms of which 3 ms to minimize.
[2024-05-28 07:18:30] [INFO ] Deduced a trap composed of 148 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:18:30] [INFO ] Deduced a trap composed of 99 places in 263 ms of which 2 ms to minimize.
[2024-05-28 07:18:30] [INFO ] Deduced a trap composed of 109 places in 250 ms of which 3 ms to minimize.
[2024-05-28 07:18:31] [INFO ] Deduced a trap composed of 104 places in 226 ms of which 2 ms to minimize.
[2024-05-28 07:18:31] [INFO ] Deduced a trap composed of 112 places in 251 ms of which 3 ms to minimize.
[2024-05-28 07:18:31] [INFO ] Deduced a trap composed of 169 places in 253 ms of which 3 ms to minimize.
[2024-05-28 07:18:31] [INFO ] Deduced a trap composed of 122 places in 215 ms of which 2 ms to minimize.
[2024-05-28 07:18:32] [INFO ] Deduced a trap composed of 122 places in 237 ms of which 3 ms to minimize.
[2024-05-28 07:18:32] [INFO ] Deduced a trap composed of 117 places in 261 ms of which 2 ms to minimize.
[2024-05-28 07:18:32] [INFO ] Deduced a trap composed of 112 places in 231 ms of which 3 ms to minimize.
[2024-05-28 07:18:32] [INFO ] Deduced a trap composed of 122 places in 230 ms of which 2 ms to minimize.
[2024-05-28 07:18:33] [INFO ] Deduced a trap composed of 167 places in 271 ms of which 2 ms to minimize.
[2024-05-28 07:18:33] [INFO ] Deduced a trap composed of 134 places in 230 ms of which 2 ms to minimize.
[2024-05-28 07:18:33] [INFO ] Deduced a trap composed of 134 places in 224 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 972 unsolved
[2024-05-28 07:18:36] [INFO ] Deduced a trap composed of 183 places in 260 ms of which 2 ms to minimize.
[2024-05-28 07:18:36] [INFO ] Deduced a trap composed of 183 places in 310 ms of which 2 ms to minimize.
[2024-05-28 07:18:36] [INFO ] Deduced a trap composed of 118 places in 286 ms of which 2 ms to minimize.
[2024-05-28 07:18:37] [INFO ] Deduced a trap composed of 190 places in 337 ms of which 3 ms to minimize.
[2024-05-28 07:18:38] [INFO ] Deduced a trap composed of 118 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1386 variables, and 217 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/972 constraints, Known Traps: 165/165 constraints]
After SMT, in 64677ms problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 64686ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91169 ms. Remains : 412/412 places, 983/983 transitions.
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-11 finished in 357229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G(p1))) U p2))'
Support contains 25 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 9 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:18:38] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
// Phase 1: matrix 1082 rows 463 cols
[2024-05-28 07:18:38] [INFO ] Computed 62 invariants in 10 ms
[2024-05-28 07:18:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.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 1.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 1.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 4.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 9.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 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 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 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.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 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:19:08] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 2 ms to minimize.
[2024-05-28 07:19:08] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/1545 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 47231ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 47249ms
[2024-05-28 07:19:25] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:19:25] [INFO ] Invariant cache hit.
[2024-05-28 07:19:26] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-28 07:19:26] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:19:26] [INFO ] Invariant cache hit.
[2024-05-28 07:19:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:19:28] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:19:28] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:19:28] [INFO ] Invariant cache hit.
[2024-05-28 07:19:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:20:15] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 3 ms to minimize.
[2024-05-28 07:20:22] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 66540ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 66564ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 7 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115928 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 71429 steps with 4002 reset in 424 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-12 finished in 116489 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 33 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 7 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:20:35] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:20:35] [INFO ] Invariant cache hit.
[2024-05-28 07:20:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:21:12] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
[2024-05-28 07:21:18] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 47058ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 47074ms
[2024-05-28 07:21:22] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:21:22] [INFO ] Invariant cache hit.
[2024-05-28 07:21:22] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-28 07:21:22] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:21:22] [INFO ] Invariant cache hit.
[2024-05-28 07:21:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:21:24] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:21:24] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:21:24] [INFO ] Invariant cache hit.
[2024-05-28 07:21:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:22:12] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 2 ms to minimize.
[2024-05-28 07:22:17] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
SMT process timed out in 66679ms, After SMT, problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 66705ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116016 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-13 finished in 116111 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 2 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:22:31] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:22:31] [INFO ] Invariant cache hit.
[2024-05-28 07:22:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:23:08] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2024-05-28 07:23:14] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 47056ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 47067ms
[2024-05-28 07:23:18] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:23:18] [INFO ] Invariant cache hit.
[2024-05-28 07:23:18] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-28 07:23:18] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:23:18] [INFO ] Invariant cache hit.
[2024-05-28 07:23:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:23:20] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:23:20] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:23:20] [INFO ] Invariant cache hit.
[2024-05-28 07:23:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:24:07] [INFO ] Deduced a trap composed of 12 places in 399 ms of which 3 ms to minimize.
[2024-05-28 07:24:13] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 65995ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 66019ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 8 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115261 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-14 finished in 115398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&G(p1))))'
Support contains 23 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1091/1091 transitions.
Applied a total of 0 rules in 12 ms. Remains 463 /463 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:24:26] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:24:26] [INFO ] Invariant cache hit.
[2024-05-28 07:24:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.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 1.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 1.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 4.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 9.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1545 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 07:25:04] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 3 ms to minimize.
[2024-05-28 07:25:11] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(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 1)
(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 1)
(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 1)
(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 1)
(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 1)
(s145 0)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(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 1)
(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 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 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 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(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 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 45934ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 45954ms
[2024-05-28 07:25:12] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:25:12] [INFO ] Invariant cache hit.
[2024-05-28 07:25:13] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-28 07:25:13] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:25:13] [INFO ] Invariant cache hit.
[2024-05-28 07:25:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:25:14] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 07:25:14] [INFO ] Flow matrix only has 1082 transitions (discarded 9 similar events)
[2024-05-28 07:25:14] [INFO ] Invariant cache hit.
[2024-05-28 07:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD543 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/463 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1545 variables, and 62 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 1023 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 46/46 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 5/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
At refinement iteration 3 (OVERLAPS) 10/462 variables, 10/61 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
[2024-05-28 07:26:01] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 4 ms to minimize.
[2024-05-28 07:26:08] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/63 constraints. Problems are: Problem set: 57 solved, 1023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1545 variables, and 63 constraints, problems are : Problem set: 57 solved, 1023 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 66429ms problems are : Problem set: 57 solved, 1023 unsolved
Search for dead transitions found 57 dead transitions in 66450ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1034/1091 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114453 ms. Remains : 463/463 places, 1034/1091 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 30374 steps with 1701 reset in 165 ms.
FORMULA PolyORBNT-COL-S10J20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-15 finished in 114759 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)||F(G(p1)))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S10J20-LTLCardinality-11
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 23 out of 463 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 463/463 places, 1091/1091 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 463 transition count 1067
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 439 transition count 1067
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 48 place count 439 transition count 1042
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 98 place count 414 transition count 1042
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 412 transition count 1040
Applied a total of 102 rules in 43 ms. Remains 412 /463 variables (removed 51) and now considering 1040/1091 (removed 51) transitions.
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:26:21] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
// Phase 1: matrix 1031 rows 412 cols
[2024-05-28 07:26:21] [INFO ] Computed 62 invariants in 10 ms
[2024-05-28 07:26:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:26:33] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 2 ms to minimize.
[2024-05-28 07:26:34] [INFO ] Deduced a trap composed of 128 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:26:34] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 3 ms to minimize.
[2024-05-28 07:26:34] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:26:34] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 2 ms to minimize.
[2024-05-28 07:26:34] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 3 ms to minimize.
[2024-05-28 07:26:35] [INFO ] Deduced a trap composed of 133 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:26:35] [INFO ] Deduced a trap composed of 123 places in 201 ms of which 3 ms to minimize.
[2024-05-28 07:26:35] [INFO ] Deduced a trap composed of 128 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:26:35] [INFO ] Deduced a trap composed of 128 places in 214 ms of which 2 ms to minimize.
[2024-05-28 07:26:35] [INFO ] Deduced a trap composed of 123 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:26:36] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 2 ms to minimize.
[2024-05-28 07:26:36] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 3 ms to minimize.
[2024-05-28 07:26:36] [INFO ] Deduced a trap composed of 118 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:26:36] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 3 ms to minimize.
[2024-05-28 07:26:36] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 3 ms to minimize.
[2024-05-28 07:26:37] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 3 ms to minimize.
[2024-05-28 07:26:37] [INFO ] Deduced a trap composed of 118 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:26:37] [INFO ] Deduced a trap composed of 123 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:26:37] [INFO ] Deduced a trap composed of 128 places in 322 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:26:38] [INFO ] Deduced a trap composed of 128 places in 281 ms of which 3 ms to minimize.
[2024-05-28 07:26:38] [INFO ] Deduced a trap composed of 118 places in 299 ms of which 3 ms to minimize.
[2024-05-28 07:26:39] [INFO ] Deduced a trap composed of 118 places in 336 ms of which 3 ms to minimize.
[2024-05-28 07:26:39] [INFO ] Deduced a trap composed of 118 places in 314 ms of which 2 ms to minimize.
[2024-05-28 07:26:39] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 2 ms to minimize.
[2024-05-28 07:26:40] [INFO ] Deduced a trap composed of 118 places in 244 ms of which 3 ms to minimize.
[2024-05-28 07:26:40] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:26:40] [INFO ] Deduced a trap composed of 118 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:26:40] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:26:40] [INFO ] Deduced a trap composed of 123 places in 190 ms of which 2 ms to minimize.
[2024-05-28 07:26:41] [INFO ] Deduced a trap composed of 113 places in 170 ms of which 2 ms to minimize.
[2024-05-28 07:26:41] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 3 ms to minimize.
[2024-05-28 07:26:41] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:26:41] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:26:41] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:26:41] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:26:42] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 3 ms to minimize.
[2024-05-28 07:26:42] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 3 ms to minimize.
[2024-05-28 07:26:42] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:26:42] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:26:48] [INFO ] Deduced a trap composed of 108 places in 206 ms of which 3 ms to minimize.
SMT process timed out in 26675ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 26687ms
[2024-05-28 07:26:48] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:26:48] [INFO ] Invariant cache hit.
[2024-05-28 07:26:48] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-28 07:26:48] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:26:48] [INFO ] Invariant cache hit.
[2024-05-28 07:26:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:26:50] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:26:50] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:26:50] [INFO ] Invariant cache hit.
[2024-05-28 07:26:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:03] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 3 ms to minimize.
[2024-05-28 07:27:03] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 2 ms to minimize.
[2024-05-28 07:27:03] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-28 07:27:03] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 15 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 2 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:04] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 2 ms to minimize.
[2024-05-28 07:27:05] [INFO ] Deduced a trap composed of 172 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:27:05] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2024-05-28 07:27:05] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 3 ms to minimize.
[2024-05-28 07:27:05] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:27:05] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:27:05] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:27:06] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:27:06] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:27:06] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:06] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 2 ms to minimize.
[2024-05-28 07:27:07] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 2 ms to minimize.
[2024-05-28 07:27:07] [INFO ] Deduced a trap composed of 113 places in 163 ms of which 2 ms to minimize.
[2024-05-28 07:27:07] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:27:07] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:27:07] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:27:08] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:27:08] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 3 ms to minimize.
[2024-05-28 07:27:08] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 3 ms to minimize.
[2024-05-28 07:27:08] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:27:08] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:27:08] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:27:09] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 3 ms to minimize.
[2024-05-28 07:27:09] [INFO ] Deduced a trap composed of 168 places in 133 ms of which 2 ms to minimize.
[2024-05-28 07:27:09] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:09] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:27:09] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:27:09] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 2 ms to minimize.
[2024-05-28 07:27:10] [INFO ] Deduced a trap composed of 108 places in 249 ms of which 2 ms to minimize.
[2024-05-28 07:27:10] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:17] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 2 ms to minimize.
[2024-05-28 07:27:17] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:27:18] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:27:18] [INFO ] Deduced a trap composed of 113 places in 164 ms of which 3 ms to minimize.
[2024-05-28 07:27:18] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 2 ms to minimize.
[2024-05-28 07:27:18] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 2 ms to minimize.
[2024-05-28 07:27:18] [INFO ] Deduced a trap composed of 113 places in 176 ms of which 2 ms to minimize.
[2024-05-28 07:27:19] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 3 ms to minimize.
[2024-05-28 07:27:19] [INFO ] Deduced a trap composed of 113 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:27:19] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:19] [INFO ] Deduced a trap composed of 172 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:19] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:27:19] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:27:20] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 2 ms to minimize.
[2024-05-28 07:27:20] [INFO ] Deduced a trap composed of 118 places in 189 ms of which 3 ms to minimize.
[2024-05-28 07:27:20] [INFO ] Deduced a trap composed of 118 places in 174 ms of which 3 ms to minimize.
[2024-05-28 07:27:20] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 2 ms to minimize.
[2024-05-28 07:27:20] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 2 ms to minimize.
[2024-05-28 07:27:20] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 3 ms to minimize.
[2024-05-28 07:27:21] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:21] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:27:21] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 3 ms to minimize.
[2024-05-28 07:27:22] [INFO ] Deduced a trap composed of 123 places in 214 ms of which 3 ms to minimize.
[2024-05-28 07:27:22] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 3 ms to minimize.
[2024-05-28 07:27:22] [INFO ] Deduced a trap composed of 113 places in 200 ms of which 3 ms to minimize.
[2024-05-28 07:27:22] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:27:22] [INFO ] Deduced a trap composed of 118 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:27:23] [INFO ] Deduced a trap composed of 123 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:27:23] [INFO ] Deduced a trap composed of 128 places in 200 ms of which 3 ms to minimize.
[2024-05-28 07:27:23] [INFO ] Deduced a trap composed of 128 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:27:23] [INFO ] Deduced a trap composed of 123 places in 324 ms of which 3 ms to minimize.
[2024-05-28 07:27:24] [INFO ] Deduced a trap composed of 128 places in 205 ms of which 3 ms to minimize.
[2024-05-28 07:27:24] [INFO ] Deduced a trap composed of 128 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:27:24] [INFO ] Deduced a trap composed of 123 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:27:24] [INFO ] Deduced a trap composed of 118 places in 228 ms of which 3 ms to minimize.
[2024-05-28 07:27:25] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 2 ms to minimize.
[2024-05-28 07:27:25] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 3 ms to minimize.
[2024-05-28 07:27:25] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 3 ms to minimize.
[2024-05-28 07:27:25] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 3 ms to minimize.
[2024-05-28 07:27:25] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:26] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:27:26] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 3 ms to minimize.
[2024-05-28 07:27:26] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 2 ms to minimize.
[2024-05-28 07:27:27] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 3 ms to minimize.
[2024-05-28 07:27:27] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 3 ms to minimize.
[2024-05-28 07:27:27] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:27:27] [INFO ] Deduced a trap composed of 118 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 37545ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 37568ms
Starting structural reductions in LI_LTL mode, iteration 1 : 412/463 places, 1040/1091 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 65867 ms. Remains : 412/463 places, 1040/1091 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J20-LTLCardinality-11
Product exploration explored 100000 steps with 7255 reset in 928 ms.
Product exploration explored 100000 steps with 7225 reset in 1040 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 p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 650 steps (49 resets) in 13 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 23 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 1040/1040 transitions.
Applied a total of 0 rules in 28 ms. Remains 412 /412 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:27:30] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:27:30] [INFO ] Invariant cache hit.
[2024-05-28 07:27:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:42] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:27:42] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 2 ms to minimize.
[2024-05-28 07:27:42] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:27:42] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:27:43] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:27:43] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 3 ms to minimize.
[2024-05-28 07:27:43] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:27:43] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 3 ms to minimize.
[2024-05-28 07:27:43] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:27:43] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:27:44] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:27:44] [INFO ] Deduced a trap composed of 172 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:27:44] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:27:44] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:27:44] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:27:44] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:27:45] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:27:45] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 3 ms to minimize.
[2024-05-28 07:27:45] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 2 ms to minimize.
[2024-05-28 07:27:45] [INFO ] Deduced a trap composed of 174 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:46] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:27:46] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:46] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:27:46] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:27:46] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:27:46] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:47] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:27:47] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:27:47] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:27:47] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:27:47] [INFO ] Deduced a trap composed of 123 places in 170 ms of which 3 ms to minimize.
[2024-05-28 07:27:47] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:27:48] [INFO ] Deduced a trap composed of 123 places in 189 ms of which 2 ms to minimize.
[2024-05-28 07:27:48] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:27:48] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:27:48] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:27:48] [INFO ] Deduced a trap composed of 118 places in 196 ms of which 3 ms to minimize.
[2024-05-28 07:27:49] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:27:49] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 2 ms to minimize.
[2024-05-28 07:27:49] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:27:55] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:27:55] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 3 ms to minimize.
[2024-05-28 07:27:55] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 2 ms to minimize.
[2024-05-28 07:27:55] [INFO ] Deduced a trap composed of 113 places in 214 ms of which 3 ms to minimize.
[2024-05-28 07:27:56] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 2 ms to minimize.
[2024-05-28 07:27:56] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 2 ms to minimize.
[2024-05-28 07:27:56] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 3 ms to minimize.
SMT process timed out in 26256ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 26275ms
[2024-05-28 07:27:56] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:27:56] [INFO ] Invariant cache hit.
[2024-05-28 07:27:56] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-28 07:27:56] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:27:56] [INFO ] Invariant cache hit.
[2024-05-28 07:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:27:58] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-05-28 07:27:58] [INFO ] Redundant transitions in 12 ms returned []
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:27:58] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:27:58] [INFO ] Invariant cache hit.
[2024-05-28 07:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:10] [INFO ] Deduced a trap composed of 128 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:28:10] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:28:10] [INFO ] Deduced a trap composed of 138 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:28:11] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 2 ms to minimize.
[2024-05-28 07:28:11] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 2 ms to minimize.
[2024-05-28 07:28:11] [INFO ] Deduced a trap composed of 138 places in 243 ms of which 2 ms to minimize.
[2024-05-28 07:28:11] [INFO ] Deduced a trap composed of 128 places in 260 ms of which 3 ms to minimize.
[2024-05-28 07:28:12] [INFO ] Deduced a trap composed of 123 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:28:12] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 2 ms to minimize.
[2024-05-28 07:28:12] [INFO ] Deduced a trap composed of 123 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:28:12] [INFO ] Deduced a trap composed of 123 places in 183 ms of which 3 ms to minimize.
[2024-05-28 07:28:12] [INFO ] Deduced a trap composed of 172 places in 278 ms of which 2 ms to minimize.
[2024-05-28 07:28:13] [INFO ] Deduced a trap composed of 128 places in 205 ms of which 3 ms to minimize.
[2024-05-28 07:28:13] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 3 ms to minimize.
[2024-05-28 07:28:13] [INFO ] Deduced a trap composed of 118 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:28:13] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:28:14] [INFO ] Deduced a trap composed of 128 places in 182 ms of which 3 ms to minimize.
[2024-05-28 07:28:14] [INFO ] Deduced a trap composed of 128 places in 180 ms of which 2 ms to minimize.
[2024-05-28 07:28:14] [INFO ] Deduced a trap composed of 133 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:28:14] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:15] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 2 ms to minimize.
[2024-05-28 07:28:15] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:28:15] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:28:15] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:28:15] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:28:15] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:28:16] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:28:16] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:28:16] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 3 ms to minimize.
[2024-05-28 07:28:16] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 2 ms to minimize.
[2024-05-28 07:28:16] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:28:16] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:28:17] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:28:17] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:28:17] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 3 ms to minimize.
[2024-05-28 07:28:17] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:28:17] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:28:17] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-05-28 07:28:18] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:28:18] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:24] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 2 ms to minimize.
[2024-05-28 07:28:24] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:28:25] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:28:25] [INFO ] Deduced a trap composed of 113 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:28:25] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 4 ms to minimize.
[2024-05-28 07:28:25] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:28:25] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:28:25] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 3 ms to minimize.
[2024-05-28 07:28:26] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 3 ms to minimize.
[2024-05-28 07:28:26] [INFO ] Deduced a trap composed of 113 places in 176 ms of which 2 ms to minimize.
[2024-05-28 07:28:26] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:28:26] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
[2024-05-28 07:28:26] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 3 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 3 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 113 places in 155 ms of which 3 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:28:27] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:28] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 2 ms to minimize.
[2024-05-28 07:28:28] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:28:28] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:28:28] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 4 ms to minimize.
[2024-05-28 07:28:29] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:28:29] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:28:29] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:28:29] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:28:29] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 3 ms to minimize.
[2024-05-28 07:28:29] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 3 ms to minimize.
[2024-05-28 07:28:30] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:28:30] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:28:30] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 2 ms to minimize.
[2024-05-28 07:28:30] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 3 ms to minimize.
[2024-05-28 07:28:30] [INFO ] Deduced a trap composed of 118 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:28:31] [INFO ] Deduced a trap composed of 118 places in 174 ms of which 2 ms to minimize.
[2024-05-28 07:28:31] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:28:31] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 2 ms to minimize.
[2024-05-28 07:28:31] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 3 ms to minimize.
[2024-05-28 07:28:31] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:32] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 2 ms to minimize.
[2024-05-28 07:28:32] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 3 ms to minimize.
[2024-05-28 07:28:32] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 3 ms to minimize.
[2024-05-28 07:28:32] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:28:33] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 2 ms to minimize.
[2024-05-28 07:28:33] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:28:33] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 3 ms to minimize.
[2024-05-28 07:28:33] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:28:33] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:28:33] [INFO ] Deduced a trap composed of 128 places in 166 ms of which 2 ms to minimize.
[2024-05-28 07:28:34] [INFO ] Deduced a trap composed of 123 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:28:34] [INFO ] Deduced a trap composed of 123 places in 166 ms of which 3 ms to minimize.
SMT process timed out in 35986ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 35999ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64204 ms. Remains : 412/412 places, 1040/1040 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1451 steps (106 resets) in 20 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 7228 reset in 904 ms.
Product exploration explored 100000 steps with 7267 reset in 884 ms.
Support contains 23 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 1040/1040 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:28:36] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:28:36] [INFO ] Invariant cache hit.
[2024-05-28 07:28:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:49] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 2 ms to minimize.
[2024-05-28 07:28:49] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:28:49] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-05-28 07:28:50] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 2 ms to minimize.
[2024-05-28 07:28:50] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 3 ms to minimize.
[2024-05-28 07:28:50] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-05-28 07:28:50] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 3 ms to minimize.
[2024-05-28 07:28:50] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 3 ms to minimize.
[2024-05-28 07:28:50] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2024-05-28 07:28:51] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 3 ms to minimize.
[2024-05-28 07:28:51] [INFO ] Deduced a trap composed of 123 places in 187 ms of which 4 ms to minimize.
[2024-05-28 07:28:51] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 3 ms to minimize.
[2024-05-28 07:28:51] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 2 ms to minimize.
[2024-05-28 07:28:51] [INFO ] Deduced a trap composed of 128 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:28:52] [INFO ] Deduced a trap composed of 118 places in 171 ms of which 3 ms to minimize.
[2024-05-28 07:28:52] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:28:52] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 3 ms to minimize.
[2024-05-28 07:28:52] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 3 ms to minimize.
[2024-05-28 07:28:52] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:28:52] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:28:53] [INFO ] Deduced a trap composed of 118 places in 205 ms of which 2 ms to minimize.
[2024-05-28 07:28:53] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 2 ms to minimize.
[2024-05-28 07:28:53] [INFO ] Deduced a trap composed of 113 places in 297 ms of which 2 ms to minimize.
[2024-05-28 07:28:54] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 4 ms to minimize.
[2024-05-28 07:28:54] [INFO ] Deduced a trap composed of 113 places in 248 ms of which 2 ms to minimize.
[2024-05-28 07:28:54] [INFO ] Deduced a trap composed of 118 places in 179 ms of which 2 ms to minimize.
[2024-05-28 07:28:54] [INFO ] Deduced a trap composed of 123 places in 266 ms of which 2 ms to minimize.
[2024-05-28 07:28:55] [INFO ] Deduced a trap composed of 128 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:28:55] [INFO ] Deduced a trap composed of 128 places in 260 ms of which 3 ms to minimize.
[2024-05-28 07:28:55] [INFO ] Deduced a trap composed of 133 places in 266 ms of which 2 ms to minimize.
[2024-05-28 07:28:55] [INFO ] Deduced a trap composed of 123 places in 220 ms of which 3 ms to minimize.
[2024-05-28 07:28:56] [INFO ] Deduced a trap composed of 128 places in 227 ms of which 3 ms to minimize.
[2024-05-28 07:28:56] [INFO ] Deduced a trap composed of 123 places in 253 ms of which 3 ms to minimize.
[2024-05-28 07:28:56] [INFO ] Deduced a trap composed of 168 places in 284 ms of which 2 ms to minimize.
[2024-05-28 07:28:56] [INFO ] Deduced a trap composed of 118 places in 290 ms of which 3 ms to minimize.
[2024-05-28 07:28:57] [INFO ] Deduced a trap composed of 118 places in 219 ms of which 3 ms to minimize.
[2024-05-28 07:28:57] [INFO ] Deduced a trap composed of 118 places in 200 ms of which 3 ms to minimize.
[2024-05-28 07:28:57] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 3 ms to minimize.
[2024-05-28 07:28:57] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:28:58] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1443 variables, and 92 constraints, problems are : Problem set: 0 solved, 1029 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1029/1029 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1029 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:05] [INFO ] Deduced a trap composed of 122 places in 379 ms of which 3 ms to minimize.
[2024-05-28 07:29:05] [INFO ] Deduced a trap composed of 113 places in 243 ms of which 2 ms to minimize.
[2024-05-28 07:29:06] [INFO ] Deduced a trap composed of 122 places in 230 ms of which 2 ms to minimize.
[2024-05-28 07:29:06] [INFO ] Deduced a trap composed of 113 places in 218 ms of which 3 ms to minimize.
[2024-05-28 07:29:06] [INFO ] Deduced a trap composed of 113 places in 220 ms of which 3 ms to minimize.
[2024-05-28 07:29:06] [INFO ] Deduced a trap composed of 117 places in 228 ms of which 3 ms to minimize.
[2024-05-28 07:29:07] [INFO ] Deduced a trap composed of 108 places in 240 ms of which 3 ms to minimize.
[2024-05-28 07:29:07] [INFO ] Deduced a trap composed of 108 places in 263 ms of which 2 ms to minimize.
[2024-05-28 07:29:07] [INFO ] Deduced a trap composed of 122 places in 366 ms of which 3 ms to minimize.
[2024-05-28 07:29:08] [INFO ] Deduced a trap composed of 109 places in 311 ms of which 3 ms to minimize.
[2024-05-28 07:29:08] [INFO ] Deduced a trap composed of 122 places in 288 ms of which 2 ms to minimize.
[2024-05-28 07:29:08] [INFO ] Deduced a trap composed of 109 places in 294 ms of which 3 ms to minimize.
[2024-05-28 07:29:09] [INFO ] Deduced a trap composed of 124 places in 271 ms of which 3 ms to minimize.
[2024-05-28 07:29:09] [INFO ] Deduced a trap composed of 104 places in 248 ms of which 2 ms to minimize.
[2024-05-28 07:29:09] [INFO ] Deduced a trap composed of 127 places in 212 ms of which 2 ms to minimize.
[2024-05-28 07:29:09] [INFO ] Deduced a trap composed of 108 places in 205 ms of which 2 ms to minimize.
[2024-05-28 07:29:10] [INFO ] Deduced a trap composed of 112 places in 274 ms of which 3 ms to minimize.
[2024-05-28 07:29:10] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 2 ms to minimize.
[2024-05-28 07:29:10] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 2 ms to minimize.
[2024-05-28 07:29:10] [INFO ] Deduced a trap composed of 132 places in 235 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:11] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2024-05-28 07:29:12] [INFO ] Deduced a trap composed of 174 places in 213 ms of which 2 ms to minimize.
[2024-05-28 07:29:12] [INFO ] Deduced a trap composed of 123 places in 228 ms of which 2 ms to minimize.
[2024-05-28 07:29:12] [INFO ] Deduced a trap composed of 174 places in 236 ms of which 2 ms to minimize.
[2024-05-28 07:29:12] [INFO ] Deduced a trap composed of 123 places in 241 ms of which 2 ms to minimize.
[2024-05-28 07:29:13] [INFO ] Deduced a trap composed of 147 places in 236 ms of which 2 ms to minimize.
[2024-05-28 07:29:13] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 2 ms to minimize.
[2024-05-28 07:29:13] [INFO ] Deduced a trap composed of 122 places in 231 ms of which 2 ms to minimize.
[2024-05-28 07:29:13] [INFO ] Deduced a trap composed of 132 places in 237 ms of which 3 ms to minimize.
[2024-05-28 07:29:14] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 2 ms to minimize.
[2024-05-28 07:29:14] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 2 ms to minimize.
[2024-05-28 07:29:14] [INFO ] Deduced a trap composed of 128 places in 221 ms of which 2 ms to minimize.
[2024-05-28 07:29:14] [INFO ] Deduced a trap composed of 129 places in 227 ms of which 2 ms to minimize.
[2024-05-28 07:29:15] [INFO ] Deduced a trap composed of 128 places in 202 ms of which 2 ms to minimize.
[2024-05-28 07:29:15] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 2 ms to minimize.
[2024-05-28 07:29:15] [INFO ] Deduced a trap composed of 118 places in 206 ms of which 2 ms to minimize.
[2024-05-28 07:29:15] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 2 ms to minimize.
[2024-05-28 07:29:15] [INFO ] Deduced a trap composed of 128 places in 199 ms of which 2 ms to minimize.
[2024-05-28 07:29:16] [INFO ] Deduced a trap composed of 108 places in 294 ms of which 3 ms to minimize.
[2024-05-28 07:29:16] [INFO ] Deduced a trap composed of 108 places in 268 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:17] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 2 ms to minimize.
[2024-05-28 07:29:17] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 2 ms to minimize.
[2024-05-28 07:29:17] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 3 ms to minimize.
[2024-05-28 07:29:17] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:29:17] [INFO ] Deduced a trap composed of 129 places in 219 ms of which 3 ms to minimize.
[2024-05-28 07:29:18] [INFO ] Deduced a trap composed of 132 places in 282 ms of which 3 ms to minimize.
[2024-05-28 07:29:18] [INFO ] Deduced a trap composed of 118 places in 250 ms of which 3 ms to minimize.
[2024-05-28 07:29:18] [INFO ] Deduced a trap composed of 127 places in 229 ms of which 2 ms to minimize.
[2024-05-28 07:29:18] [INFO ] Deduced a trap composed of 147 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:29:19] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 2 ms to minimize.
[2024-05-28 07:29:19] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 3 ms to minimize.
[2024-05-28 07:29:19] [INFO ] Deduced a trap composed of 133 places in 226 ms of which 3 ms to minimize.
[2024-05-28 07:29:19] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 2 ms to minimize.
[2024-05-28 07:29:20] [INFO ] Deduced a trap composed of 123 places in 222 ms of which 2 ms to minimize.
[2024-05-28 07:29:20] [INFO ] Deduced a trap composed of 113 places in 214 ms of which 3 ms to minimize.
[2024-05-28 07:29:20] [INFO ] Deduced a trap composed of 118 places in 269 ms of which 3 ms to minimize.
[2024-05-28 07:29:20] [INFO ] Deduced a trap composed of 133 places in 213 ms of which 2 ms to minimize.
[2024-05-28 07:29:20] [INFO ] Deduced a trap composed of 118 places in 206 ms of which 2 ms to minimize.
[2024-05-28 07:29:21] [INFO ] Deduced a trap composed of 118 places in 209 ms of which 2 ms to minimize.
[2024-05-28 07:29:21] [INFO ] Deduced a trap composed of 133 places in 283 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:22] [INFO ] Deduced a trap composed of 114 places in 292 ms of which 3 ms to minimize.
[2024-05-28 07:29:22] [INFO ] Deduced a trap composed of 122 places in 346 ms of which 3 ms to minimize.
[2024-05-28 07:29:22] [INFO ] Deduced a trap composed of 103 places in 318 ms of which 3 ms to minimize.
[2024-05-28 07:29:23] [INFO ] Deduced a trap composed of 108 places in 291 ms of which 3 ms to minimize.
[2024-05-28 07:29:23] [INFO ] Deduced a trap composed of 104 places in 339 ms of which 4 ms to minimize.
SMT process timed out in 46864ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 46874ms
[2024-05-28 07:29:23] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:29:23] [INFO ] Invariant cache hit.
[2024-05-28 07:29:23] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-28 07:29:23] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:29:23] [INFO ] Invariant cache hit.
[2024-05-28 07:29:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:29:25] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2024-05-28 07:29:25] [INFO ] Redundant transitions in 9 ms returned []
Running 1029 sub problems to find dead transitions.
[2024-05-28 07:29:25] [INFO ] Flow matrix only has 1031 transitions (discarded 9 similar events)
[2024-05-28 07:29:25] [INFO ] Invariant cache hit.
[2024-05-28 07:29:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:37] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
[2024-05-28 07:29:37] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:29:37] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:29:37] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 3 ms to minimize.
[2024-05-28 07:29:37] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:38] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:29:38] [INFO ] Deduced a trap composed of 128 places in 187 ms of which 3 ms to minimize.
[2024-05-28 07:29:38] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:29:38] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 2 ms to minimize.
[2024-05-28 07:29:38] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:29:38] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:29:39] [INFO ] Deduced a trap composed of 172 places in 169 ms of which 3 ms to minimize.
[2024-05-28 07:29:39] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 2 ms to minimize.
[2024-05-28 07:29:39] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:39] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 2 ms to minimize.
[2024-05-28 07:29:39] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-28 07:29:39] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:40] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:29:40] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:40] [INFO ] Deduced a trap composed of 174 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:40] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:29:41] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:29:41] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:29:41] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 3 ms to minimize.
[2024-05-28 07:29:41] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:29:41] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 3 ms to minimize.
[2024-05-28 07:29:41] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:29:42] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:29:42] [INFO ] Deduced a trap composed of 128 places in 166 ms of which 3 ms to minimize.
[2024-05-28 07:29:42] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:29:42] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:42] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:42] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:29:43] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 3 ms to minimize.
[2024-05-28 07:29:43] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:29:43] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:43] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:43] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:29:43] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:29:44] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:50] [INFO ] Deduced a trap composed of 113 places in 230 ms of which 3 ms to minimize.
[2024-05-28 07:29:50] [INFO ] Deduced a trap composed of 170 places in 298 ms of which 2 ms to minimize.
[2024-05-28 07:29:51] [INFO ] Deduced a trap composed of 123 places in 632 ms of which 27 ms to minimize.
[2024-05-28 07:29:51] [INFO ] Deduced a trap composed of 113 places in 251 ms of which 2 ms to minimize.
[2024-05-28 07:29:52] [INFO ] Deduced a trap composed of 113 places in 249 ms of which 2 ms to minimize.
[2024-05-28 07:29:52] [INFO ] Deduced a trap composed of 113 places in 245 ms of which 3 ms to minimize.
[2024-05-28 07:29:52] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 2 ms to minimize.
[2024-05-28 07:29:52] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 2 ms to minimize.
[2024-05-28 07:29:52] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:29:53] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:29:53] [INFO ] Deduced a trap composed of 172 places in 149 ms of which 3 ms to minimize.
[2024-05-28 07:29:53] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:29:53] [INFO ] Deduced a trap composed of 123 places in 154 ms of which 2 ms to minimize.
[2024-05-28 07:29:53] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 3 ms to minimize.
[2024-05-28 07:29:53] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 3 ms to minimize.
[2024-05-28 07:29:54] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:54] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 2 ms to minimize.
[2024-05-28 07:29:54] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 2 ms to minimize.
[2024-05-28 07:29:54] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:54] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:55] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-28 07:29:55] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:55] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:55] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 2 ms to minimize.
[2024-05-28 07:29:55] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 2 ms to minimize.
[2024-05-28 07:29:56] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 2 ms to minimize.
[2024-05-28 07:29:56] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 2 ms to minimize.
[2024-05-28 07:29:56] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:29:56] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 3 ms to minimize.
[2024-05-28 07:29:56] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:56] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 3 ms to minimize.
[2024-05-28 07:29:57] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:29:57] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 2 ms to minimize.
[2024-05-28 07:29:57] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:29:57] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:29:57] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 3 ms to minimize.
[2024-05-28 07:29:57] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 2 ms to minimize.
[2024-05-28 07:29:58] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:58] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:29:58] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
[2024-05-28 07:29:58] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 2 ms to minimize.
[2024-05-28 07:29:58] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:29:59] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-28 07:29:59] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:29:59] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 2 ms to minimize.
[2024-05-28 07:29:59] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 2 ms to minimize.
[2024-05-28 07:29:59] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:29:59] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 2 ms to minimize.
[2024-05-28 07:30:00] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 2 ms to minimize.
[2024-05-28 07:30:00] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 2 ms to minimize.
[2024-05-28 07:30:00] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2024-05-28 07:30:00] [INFO ] Deduced a trap composed of 123 places in 165 ms of which 2 ms to minimize.
[2024-05-28 07:30:00] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 2 ms to minimize.
[2024-05-28 07:30:01] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 2 ms to minimize.
[2024-05-28 07:30:01] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 2 ms to minimize.
[2024-05-28 07:30:01] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 36123ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 36134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 84721 ms. Remains : 412/412 places, 1040/1040 transitions.
Treatment of property PolyORBNT-COL-S10J20-LTLCardinality-11 finished in 220023 ms.
[2024-05-28 07:30:01] [INFO ] Flatten gal took : 77 ms
[2024-05-28 07:30:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 07:30:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 463 places, 1091 transitions and 7187 arcs took 11 ms.
Total runtime 1682498 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 463
TRANSITIONS: 1091
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 5274
MODEL NAME: /home/mcc/execution/411/model
463 places, 1091 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445900403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;