Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505000020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANConstruction-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K May 18 16:42 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 CANConstruction-PT-020-LTLFireability-00
FORMULA_NAME CANConstruction-PT-020-LTLFireability-01
FORMULA_NAME CANConstruction-PT-020-LTLFireability-02
FORMULA_NAME CANConstruction-PT-020-LTLFireability-03
FORMULA_NAME CANConstruction-PT-020-LTLFireability-04
FORMULA_NAME CANConstruction-PT-020-LTLFireability-05
FORMULA_NAME CANConstruction-PT-020-LTLFireability-06
FORMULA_NAME CANConstruction-PT-020-LTLFireability-07
FORMULA_NAME CANConstruction-PT-020-LTLFireability-08
FORMULA_NAME CANConstruction-PT-020-LTLFireability-09
FORMULA_NAME CANConstruction-PT-020-LTLFireability-10
FORMULA_NAME CANConstruction-PT-020-LTLFireability-11
FORMULA_NAME CANConstruction-PT-020-LTLFireability-12
FORMULA_NAME CANConstruction-PT-020-LTLFireability-13
FORMULA_NAME CANConstruction-PT-020-LTLFireability-14
FORMULA_NAME CANConstruction-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717178201247

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 17:56:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 17:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:56:42] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-31 17:56:42] [INFO ] Transformed 1042 places.
[2024-05-31 17:56:42] [INFO ] Transformed 1760 transitions.
[2024-05-31 17:56:42] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 350 places :
Symmetric choice reduction at 0 with 350 rule applications. Total rules 350 place count 692 transition count 1060
Iterating global reduction 0 with 350 rules applied. Total rules applied 700 place count 692 transition count 1060
Applied a total of 700 rules in 143 ms. Remains 692 /1042 variables (removed 350) and now considering 1060/1760 (removed 700) transitions.
// Phase 1: matrix 1060 rows 692 cols
[2024-05-31 17:56:43] [INFO ] Computed 41 invariants in 40 ms
[2024-05-31 17:56:43] [INFO ] Implicit Places using invariants in 572 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 604 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 674/1042 places, 1060/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 656 transition count 1042
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 656 transition count 1042
Applied a total of 36 rules in 31 ms. Remains 656 /674 variables (removed 18) and now considering 1042/1060 (removed 18) transitions.
// Phase 1: matrix 1042 rows 656 cols
[2024-05-31 17:56:43] [INFO ] Computed 23 invariants in 7 ms
[2024-05-31 17:56:43] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 17:56:43] [INFO ] Invariant cache hit.
[2024-05-31 17:56:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:56:45] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 656/1042 places, 1042/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2775 ms. Remains : 656/1042 places, 1042/1760 transitions.
Support contains 45 out of 656 places after structural reductions.
[2024-05-31 17:56:45] [INFO ] Flatten gal took : 105 ms
[2024-05-31 17:56:46] [INFO ] Flatten gal took : 72 ms
[2024-05-31 17:56:46] [INFO ] Input system was already deterministic with 1042 transitions.
RANDOM walk for 40000 steps (114 resets) in 1595 ms. (25 steps per ms) remains 0/25 properties
FORMULA CANConstruction-PT-020-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 63 stabilizing places and 82 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||G(F(p1))))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 37 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-31 17:56:47] [INFO ] Computed 23 invariants in 10 ms
[2024-05-31 17:56:47] [INFO ] Implicit Places using invariants in 287 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 293 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 24 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-31 17:56:47] [INFO ] Computed 21 invariants in 11 ms
[2024-05-31 17:56:47] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 17:56:47] [INFO ] Invariant cache hit.
[2024-05-31 17:56:48] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:56:49] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2396 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 301 reset in 463 ms.
Product exploration explored 100000 steps with 305 reset in 355 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (112 resets) in 552 ms. (72 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 2/2 properties
[2024-05-31 17:56:51] [INFO ] Invariant cache hit.
[2024-05-31 17:56:51] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 621/625 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 17:56:51] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 17 ms to minimize.
[2024-05-31 17:56:51] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/641 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 17:56:52] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 4 ms to minimize.
[2024-05-31 17:56:52] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 4 ms to minimize.
[2024-05-31 17:56:52] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 4 ms to minimize.
[2024-05-31 17:56:52] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-05-31 17:56:53] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 4 ms to minimize.
[2024-05-31 17:56:53] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 4 ms to minimize.
[2024-05-31 17:56:53] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-31 17:56:53] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-31 17:56:53] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-31 17:56:53] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-05-31 17:56:54] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-31 17:56:54] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-31 17:56:54] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-31 17:56:54] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:56:54] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 15/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1020/1661 variables, 641/679 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1661 variables, 780/1459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1661 variables, 0/1459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1662 variables, 1/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1662 variables, 0/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1662 variables, 0/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 1460 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 642/642 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 621/625 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 17:56:55] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 3 ms to minimize.
[2024-05-31 17:56:55] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 4 ms to minimize.
[2024-05-31 17:56:55] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/641 variables, 16/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 15/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 17:56:56] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-31 17:56:56] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 4 ms to minimize.
[2024-05-31 17:56:56] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-05-31 17:56:56] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-31 17:56:56] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-31 17:56:56] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-05-31 17:56:57] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-31 17:56:57] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 8/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1020/1661 variables, 641/690 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1661 variables, 780/1470 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1661 variables, 1/1471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1661 variables, 0/1471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1662 variables, 1/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1662 variables, 0/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 1472 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 642/642 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 6329ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 3200 steps, including 121 resets, run visited all 1 properties in 9 ms. (steps per millisecond=355 )
Parikh walk visited 1 properties in 25 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 224 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1020/1020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 642 transition count 880
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 502 transition count 880
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 280 place count 502 transition count 860
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 482 transition count 860
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 356 place count 464 transition count 842
Applied a total of 356 rules in 134 ms. Remains 464 /642 variables (removed 178) and now considering 842/1020 (removed 178) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-31 17:56:58] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 17:56:58] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-31 17:56:58] [INFO ] Invariant cache hit.
[2024-05-31 17:56:58] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:57:00] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2024-05-31 17:57:00] [INFO ] Redundant transitions in 47 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-31 17:57:00] [INFO ] Invariant cache hit.
[2024-05-31 17:57:00] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:07] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 4 ms to minimize.
[2024-05-31 17:57:07] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-31 17:57:07] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-31 17:57:07] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-05-31 17:57:07] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 6 ms to minimize.
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 4 ms to minimize.
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 4 ms to minimize.
[2024-05-31 17:57:08] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:57:09] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:57:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-31 17:57:11] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 10 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-31 17:57:12] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 17:57:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:14] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:57:15] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 17:57:16] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:57:17] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:23] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:57:23] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 17:57:24] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:57:25] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:57:26] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:27] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:57:28] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:57:29] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:57:30] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1306 variables, and 121 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:32] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:57:32] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:32] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:32] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:32] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:32] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:33] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:34] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-31 17:57:34] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 5 ms to minimize.
[2024-05-31 17:57:34] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-31 17:57:34] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 3 ms to minimize.
[2024-05-31 17:57:34] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-05-31 17:57:34] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-31 17:57:35] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:36] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:57:36] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:57:36] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:36] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:57:36] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:57:36] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 17:57:37] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:57:38] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:57:40] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:57:41] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:57:42] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:44] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:57:44] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:44] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:44] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:57:45] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:57:46] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:57:46] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:57:46] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-31 17:57:46] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:57:46] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-31 17:57:46] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:47] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:57:47] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:57:47] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:57:48] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:57:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:57:49] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:57:49] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-31 17:57:49] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:57:49] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:57:49] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:57:50] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:57:50] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:50] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:57:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:57:50] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 17:57:50] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:57:51] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:57:51] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:57:51] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:51] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:57:51] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:57:51] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 4 ms to minimize.
[2024-05-31 17:57:53] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 17:57:54] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:57:55] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:56] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:57:57] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:57:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:57:59] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:57:59] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-31 17:57:59] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 17:58:00] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:00] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 17:58:00] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
(s317 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(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 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(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 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(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 1)
(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 1)
(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 1)
(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 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/1306 variables, and 248 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 227/227 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in SI_LTL mode, iteration 1 : 464/642 places, 842/1020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62382 ms. Remains : 464/642 places, 842/1020 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (290 resets) in 293 ms. (136 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-31 17:58:01] [INFO ] Invariant cache hit.
[2024-05-31 17:58:01] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/1306 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 284 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 752 reset in 396 ms.
Product exploration explored 100000 steps with 751 reset in 407 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 24 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-31 17:58:03] [INFO ] Invariant cache hit.
[2024-05-31 17:58:03] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-31 17:58:03] [INFO ] Invariant cache hit.
[2024-05-31 17:58:03] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:58:04] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2024-05-31 17:58:04] [INFO ] Redundant transitions in 113 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-31 17:58:04] [INFO ] Invariant cache hit.
[2024-05-31 17:58:04] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-31 17:58:11] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-05-31 17:58:12] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:58:13] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:14] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:58:15] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 6 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-31 17:58:16] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:58:17] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:18] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:58:19] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 6 ms to minimize.
[2024-05-31 17:58:20] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:58:21] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:27] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:28] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:58:29] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:58:30] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:31] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-31 17:58:32] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:33] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:58:34] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1306 variables, and 121 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:58:36] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 17:58:37] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:58:38] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:58:39] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:58:40] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-31 17:58:41] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 4 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:42] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:58:43] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:58:44] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:58:45] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:58:46] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-31 17:58:47] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:48] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-31 17:58:49] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:58:50] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:58:51] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:52] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:58:53] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 17:58:54] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:58:55] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 17:58:56] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 17:58:57] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:58:58] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 17:58:59] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:59:00] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-31 17:59:01] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:59:03] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 17:59:04] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:59:05] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/1306 variables, and 251 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 230/230 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62281 ms. Remains : 464/464 places, 842/842 transitions.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 138211 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 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 308 place count 497 transition count 873
Iterating global reduction 2 with 10 rules applied. Total rules applied 318 place count 497 transition count 873
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 327 place count 497 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 336 place count 488 transition count 864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 95 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-31 17:59:05] [INFO ] Computed 23 invariants in 3 ms
[2024-05-31 17:59:05] [INFO ] Implicit Places using invariants in 245 ms returned [28, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 26 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-31 17:59:05] [INFO ] Computed 21 invariants in 4 ms
[2024-05-31 17:59:05] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-31 17:59:05] [INFO ] Invariant cache hit.
[2024-05-31 17:59:06] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:07] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2086 ms. Remains : 464/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-02
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-02 finished in 2154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 647 transition count 1024
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 647 transition count 1024
Applied a total of 18 rules in 23 ms. Remains 647 /656 variables (removed 9) and now considering 1024/1042 (removed 18) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2024-05-31 17:59:07] [INFO ] Computed 23 invariants in 11 ms
[2024-05-31 17:59:07] [INFO ] Implicit Places using invariants in 278 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1024/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 645 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 645 transition count 1023
Applied a total of 2 rules in 18 ms. Remains 645 /646 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2024-05-31 17:59:07] [INFO ] Computed 22 invariants in 7 ms
[2024-05-31 17:59:08] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-31 17:59:08] [INFO ] Invariant cache hit.
[2024-05-31 17:59:08] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:10] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1023/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2580 ms. Remains : 645/656 places, 1023/1042 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-03
Stuttering criterion allowed to conclude after 2752 steps with 6 reset in 11 ms.
FORMULA CANConstruction-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-03 finished in 2786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 23 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-31 17:59:10] [INFO ] Computed 23 invariants in 10 ms
[2024-05-31 17:59:10] [INFO ] Implicit Places using invariants in 283 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 284 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 22 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-31 17:59:10] [INFO ] Computed 21 invariants in 7 ms
[2024-05-31 17:59:10] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 17:59:10] [INFO ] Invariant cache hit.
[2024-05-31 17:59:11] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:12] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2474 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-05
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-05 finished in 2574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 372 place count 470 transition count 847
Applied a total of 372 rules in 65 ms. Remains 470 /656 variables (removed 186) and now considering 847/1042 (removed 195) transitions.
// Phase 1: matrix 847 rows 470 cols
[2024-05-31 17:59:12] [INFO ] Computed 23 invariants in 9 ms
[2024-05-31 17:59:13] [INFO ] Implicit Places using invariants in 282 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 847/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 843
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 843
Applied a total of 8 rules in 26 ms. Remains 464 /468 variables (removed 4) and now considering 843/847 (removed 4) transitions.
// Phase 1: matrix 843 rows 464 cols
[2024-05-31 17:59:13] [INFO ] Computed 21 invariants in 6 ms
[2024-05-31 17:59:13] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-31 17:59:13] [INFO ] Invariant cache hit.
[2024-05-31 17:59:13] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:15] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 843/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2190 ms. Remains : 464/656 places, 843/1042 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-06
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-06 finished in 2259 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((X(p1)||p0)))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 20 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-31 17:59:15] [INFO ] Computed 23 invariants in 8 ms
[2024-05-31 17:59:15] [INFO ] Implicit Places using invariants in 276 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 278 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 18 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-31 17:59:15] [INFO ] Computed 21 invariants in 5 ms
[2024-05-31 17:59:15] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 17:59:15] [INFO ] Invariant cache hit.
[2024-05-31 17:59:16] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:17] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2455 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-08
Stuttering criterion allowed to conclude after 337 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-08 finished in 2559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!(p0 U p1)))||!(p0 U !p0)))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 24 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-31 17:59:17] [INFO ] Computed 23 invariants in 6 ms
[2024-05-31 17:59:18] [INFO ] Implicit Places using invariants in 276 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 278 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1026/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 18 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2024-05-31 17:59:18] [INFO ] Computed 21 invariants in 9 ms
[2024-05-31 17:59:18] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 17:59:18] [INFO ] Invariant cache hit.
[2024-05-31 17:59:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:20] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/656 places, 1024/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2400 ms. Remains : 644/656 places, 1024/1042 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-09 finished in 3276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 22 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-31 17:59:21] [INFO ] Computed 23 invariants in 6 ms
[2024-05-31 17:59:21] [INFO ] Implicit Places using invariants in 272 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 273 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 19 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-31 17:59:21] [INFO ] Computed 21 invariants in 5 ms
[2024-05-31 17:59:21] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-31 17:59:21] [INFO ] Invariant cache hit.
[2024-05-31 17:59:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:23] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2476 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 6754 steps with 18 reset in 24 ms.
FORMULA CANConstruction-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-10 finished in 2702 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 1 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 374 place count 469 transition count 846
Applied a total of 374 rules in 66 ms. Remains 469 /656 variables (removed 187) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 469 cols
[2024-05-31 17:59:23] [INFO ] Computed 23 invariants in 3 ms
[2024-05-31 17:59:23] [INFO ] Implicit Places using invariants in 229 ms returned [26, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 231 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 467 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 463 transition count 842
Applied a total of 8 rules in 25 ms. Remains 463 /467 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 463 cols
[2024-05-31 17:59:24] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 17:59:24] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-31 17:59:24] [INFO ] Invariant cache hit.
[2024-05-31 17:59:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:25] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 463/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2201 ms. Remains : 463/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-12
Product exploration explored 100000 steps with 745 reset in 416 ms.
Stack based approach found an accepted trace after 11774 steps with 86 reset with depth 48 and stack size 48 in 53 ms.
FORMULA CANConstruction-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-12 finished in 2736 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||F(G((F(p2)||p1))))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 649 transition count 1028
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 649 transition count 1028
Applied a total of 14 rules in 23 ms. Remains 649 /656 variables (removed 7) and now considering 1028/1042 (removed 14) transitions.
// Phase 1: matrix 1028 rows 649 cols
[2024-05-31 17:59:26] [INFO ] Computed 23 invariants in 7 ms
[2024-05-31 17:59:26] [INFO ] Implicit Places using invariants in 266 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1028/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 645 transition count 1026
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 645 transition count 1026
Applied a total of 4 rules in 19 ms. Remains 645 /647 variables (removed 2) and now considering 1026/1028 (removed 2) transitions.
// Phase 1: matrix 1026 rows 645 cols
[2024-05-31 17:59:26] [INFO ] Computed 21 invariants in 5 ms
[2024-05-31 17:59:27] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-31 17:59:27] [INFO ] Invariant cache hit.
[2024-05-31 17:59:27] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:28] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1026/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2497 ms. Remains : 645/656 places, 1026/1042 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-13 finished in 3330 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(((G(F(!p0))||G(!p1)) U p2))))'
Support contains 7 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 656 transition count 915
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 529 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 528 transition count 914
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 256 place count 528 transition count 896
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 292 place count 510 transition count 896
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 500 transition count 876
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 500 transition count 876
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 320 place count 500 transition count 868
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 328 place count 492 transition count 868
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 362 place count 475 transition count 851
Applied a total of 362 rules in 53 ms. Remains 475 /656 variables (removed 181) and now considering 851/1042 (removed 191) transitions.
// Phase 1: matrix 851 rows 475 cols
[2024-05-31 17:59:29] [INFO ] Computed 23 invariants in 12 ms
[2024-05-31 17:59:30] [INFO ] Implicit Places using invariants in 223 ms returned [27, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 225 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/656 places, 851/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 473 transition count 847
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 469 transition count 847
Applied a total of 8 rules in 21 ms. Remains 469 /473 variables (removed 4) and now considering 847/851 (removed 4) transitions.
// Phase 1: matrix 847 rows 469 cols
[2024-05-31 17:59:30] [INFO ] Computed 21 invariants in 8 ms
[2024-05-31 17:59:30] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 17:59:30] [INFO ] Invariant cache hit.
[2024-05-31 17:59:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:31] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 469/656 places, 847/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2036 ms. Remains : 469/656 places, 847/1042 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-14
Product exploration explored 100000 steps with 705 reset in 398 ms.
Product exploration explored 100000 steps with 712 reset in 404 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 129 ms. Reduced automaton from 7 states, 30 edges and 3 AP (stutter insensitive) to 7 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 469 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (277 resets) in 240 ms. (165 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
[2024-05-31 17:59:33] [INFO ] Invariant cache hit.
[2024-05-31 17:59:33] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 454/1316 variables, and 7 constraints, problems are : Problem set: 3 solved, 0 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (G (OR (NOT p1) (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F p1), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0)))))]
Knowledge based reduction with 26 factoid took 421 ms. Reduced automaton from 7 states, 29 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-31 17:59:34] [INFO ] Invariant cache hit.
[2024-05-31 17:59:35] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-31 17:59:35] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-05-31 17:59:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 17:59:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 17:59:36] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2024-05-31 17:59:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:36] [INFO ] [Nat]Added 780 Read/Feed constraints in 122 ms returned sat
[2024-05-31 17:59:36] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 49 ms.
[2024-05-31 17:59:37] [INFO ] Added : 43 causal constraints over 9 iterations in 571 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 847/847 transitions.
Applied a total of 0 rules in 16 ms. Remains 469 /469 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-31 17:59:37] [INFO ] Invariant cache hit.
[2024-05-31 17:59:37] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-31 17:59:37] [INFO ] Invariant cache hit.
[2024-05-31 17:59:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 17:59:39] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
[2024-05-31 17:59:39] [INFO ] Redundant transitions in 16 ms returned []
Running 827 sub problems to find dead transitions.
[2024-05-31 17:59:39] [INFO ] Invariant cache hit.
[2024-05-31 17:59:39] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 17:59:45] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-31 17:59:45] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-31 17:59:46] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-31 17:59:47] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-31 17:59:48] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 17:59:49] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-31 17:59:49] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-31 17:59:49] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 7 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-31 17:59:50] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:59:51] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-31 17:59:52] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-31 17:59:52] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:59:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 17:59:53] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 17:59:53] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 17:59:53] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 17:59:53] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-31 17:59:53] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-31 17:59:53] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-31 17:59:54] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-31 17:59:55] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:00:02] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:00:03] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-31 18:00:04] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:00:05] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-31 18:00:05] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:00:06] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:00:07] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:08] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1316 variables, and 121 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:00:11] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:12] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:00:13] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:00:15] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-31 18:00:16] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-31 18:00:17] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:00:19] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:00:20] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:00:21] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:00:22] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:23] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:00:23] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:00:24] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:25] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:00:26] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:00:26] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:27] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:00:27] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:00:28] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:00:28] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:00:28] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-31 18:00:28] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2024-05-31 18:00:28] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-05-31 18:00:29] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-31 18:00:30] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:00:30] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:00:30] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-05-31 18:00:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:00:30] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:00:30] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:32] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 18:00:32] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:00:32] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:00:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:00:34] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:00:37] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:00:38] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:00:39] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:00:39] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 18:00:39] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1316 variables, and 261 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/827 constraints, Known Traps: 240/240 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62105 ms. Remains : 469/469 places, 847/847 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 146 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (285 resets) in 226 ms. (176 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-31 18:00:40] [INFO ] Invariant cache hit.
[2024-05-31 18:00:40] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 454/1316 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 13 factoid took 429 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-31 18:00:40] [INFO ] Invariant cache hit.
[2024-05-31 18:00:41] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 18:00:41] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2024-05-31 18:00:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:00:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-31 18:00:42] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2024-05-31 18:00:42] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 18:00:43] [INFO ] [Nat]Added 780 Read/Feed constraints in 126 ms returned sat
[2024-05-31 18:00:43] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 49 ms.
[2024-05-31 18:00:43] [INFO ] Added : 43 causal constraints over 9 iterations in 566 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 690 reset in 392 ms.
Product exploration explored 100000 steps with 688 reset in 401 ms.
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 847/847 transitions.
Applied a total of 0 rules in 14 ms. Remains 469 /469 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-31 18:00:44] [INFO ] Invariant cache hit.
[2024-05-31 18:00:44] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-31 18:00:44] [INFO ] Invariant cache hit.
[2024-05-31 18:00:45] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 18:00:46] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2024-05-31 18:00:46] [INFO ] Redundant transitions in 13 ms returned []
Running 827 sub problems to find dead transitions.
[2024-05-31 18:00:46] [INFO ] Invariant cache hit.
[2024-05-31 18:00:46] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:53] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-05-31 18:00:53] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-31 18:00:53] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:00:53] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-31 18:00:53] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:00:53] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-31 18:00:54] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:00:55] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:00:55] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:00:55] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:55] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:00:55] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-31 18:00:55] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:00:56] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:00:56] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:00:57] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:00:58] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:00:59] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:00:59] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:00:59] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:00:59] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:00:59] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:00] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:01:00] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:01:00] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:01:00] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:01:00] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:01:01] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:01:02] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:01:03] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:01:03] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:09] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-31 18:01:09] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:01:09] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:01:09] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:01:10] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-31 18:01:11] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:01:11] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:01:11] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-31 18:01:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:01:11] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:01:11] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-05-31 18:01:12] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-31 18:01:12] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:01:12] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:13] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:01:13] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:01:13] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:01:14] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:01:15] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:01:16] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 827 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1316 variables, and 121 constraints, problems are : Problem set: 0 solved, 827 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 827/827 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 827 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:01:18] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:01:19] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:01:20] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-31 18:01:21] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-31 18:01:21] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:22] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:01:22] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:01:22] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:01:23] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:01:23] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:01:23] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-05-31 18:01:23] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-31 18:01:23] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:01:23] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-31 18:01:24] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-31 18:01:24] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-31 18:01:24] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-31 18:01:24] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-31 18:01:24] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:01:25] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:01:25] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-31 18:01:25] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:01:25] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:01:25] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:01:25] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:27] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:01:27] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:01:27] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:01:27] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:01:27] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-31 18:01:28] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:01:28] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-31 18:01:28] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:01:28] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:01:28] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:01:28] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:01:29] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:01:29] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-31 18:01:29] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-31 18:01:29] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-05-31 18:01:29] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:01:29] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-05-31 18:01:30] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-31 18:01:30] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-31 18:01:30] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:01:32] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:01:32] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-31 18:01:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:01:32] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:01:32] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:01:32] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-31 18:01:33] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-31 18:01:34] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-31 18:01:34] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:01:34] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:01:34] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:36] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:01:36] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:01:36] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:01:36] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 18:01:36] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:01:37] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:01:38] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:40] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:01:41] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:01:42] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:01:43] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:01:43] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-31 18:01:45] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:01:45] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:01:45] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-31 18:01:45] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:01:45] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:01:45] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:01:46] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 60315ms, After SMT, problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62152 ms. Remains : 469/469 places, 847/847 transitions.
Treatment of property CANConstruction-PT-020-LTLFireability-14 finished in 137119 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) U X((p1||F(p2)))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 23 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-31 18:01:46] [INFO ] Computed 23 invariants in 5 ms
[2024-05-31 18:01:47] [INFO ] Implicit Places using invariants in 280 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1026/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 646 transition count 1025
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 646 transition count 1025
Applied a total of 2 rules in 18 ms. Remains 646 /647 variables (removed 1) and now considering 1025/1026 (removed 1) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2024-05-31 18:01:47] [INFO ] Computed 22 invariants in 5 ms
[2024-05-31 18:01:47] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 18:01:47] [INFO ] Invariant cache hit.
[2024-05-31 18:01:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 18:01:49] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 646/656 places, 1025/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2538 ms. Remains : 646/656 places, 1025/1042 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Computed a total of 62 stabilizing places and 81 stable transitions
Computed a total of 62 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 121 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-15 finished in 3502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : CANConstruction-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 656 transition count 912
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 526 transition count 912
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 260 place count 526 transition count 894
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 296 place count 508 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 306 place count 498 transition count 874
Iterating global reduction 2 with 10 rules applied. Total rules applied 316 place count 498 transition count 874
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 325 place count 498 transition count 865
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 334 place count 489 transition count 865
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 46 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-31 18:01:50] [INFO ] Computed 23 invariants in 5 ms
[2024-05-31 18:01:50] [INFO ] Implicit Places using invariants in 233 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 234 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 465 transition count 843
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 464 transition count 842
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 20 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-31 18:01:50] [INFO ] Computed 21 invariants in 4 ms
[2024-05-31 18:01:51] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-31 18:01:51] [INFO ] Invariant cache hit.
[2024-05-31 18:01:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 18:01:52] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2082 ms. Remains : 464/656 places, 842/1042 transitions.
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 766 reset in 393 ms.
Product exploration explored 100000 steps with 763 reset in 410 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (291 resets) in 399 ms. (100 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
[2024-05-31 18:01:54] [INFO ] Invariant cache hit.
[2024-05-31 18:01:54] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:01:54] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 842/1305 variables, 463/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1305 variables, 780/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1305 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1306 variables, 1/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1266 constraints, problems are : Problem set: 1 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:01:54] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:01:55] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 4 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:01:56] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:01:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:01:57] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:01:57] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:01:57] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:01:57] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 842/1305 variables, 463/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1305 variables, 780/1287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1305 variables, 1/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1305 variables, 0/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1306 variables, 1/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1289 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3393 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 3941ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1289 steps, including 154 resets, run visited all 1 properties in 6 ms. (steps per millisecond=214 )
Parikh walk visited 1 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 241 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 16 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-31 18:01:58] [INFO ] Invariant cache hit.
[2024-05-31 18:01:58] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-31 18:01:58] [INFO ] Invariant cache hit.
[2024-05-31 18:01:59] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 18:02:00] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2024-05-31 18:02:00] [INFO ] Redundant transitions in 14 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-31 18:02:00] [INFO ] Invariant cache hit.
[2024-05-31 18:02:00] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:06] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-31 18:02:07] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2024-05-31 18:02:07] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-31 18:02:07] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-31 18:02:07] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 4 ms to minimize.
[2024-05-31 18:02:07] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-31 18:02:07] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:02:08] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:02:09] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:09] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:02:09] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:02:09] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:02:09] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:10] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:02:10] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:02:10] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:02:10] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:02:11] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:02:12] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:13] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:13] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:02:14] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 4 ms to minimize.
[2024-05-31 18:02:14] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-31 18:02:14] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-31 18:02:14] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-31 18:02:14] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-05-31 18:02:15] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-31 18:02:15] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:02:15] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:02:15] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:02:15] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:15] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-31 18:02:17] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:23] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-31 18:02:23] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:02:23] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:02:23] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:02:23] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:02:24] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:25] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:02:25] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:02:25] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:02:25] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:02:25] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:25] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:26] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1306 variables, and 121 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 4 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:35] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-31 18:02:38] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:02:38] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:02:38] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-31 18:02:38] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:02:38] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:39] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-31 18:02:39] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-31 18:02:39] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-31 18:02:40] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:02:40] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:02:40] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:43] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:02:44] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:02:44] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:44] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:48] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:02:48] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:02:48] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:02:48] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:48] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:52] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:02:52] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:02:52] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:52] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:02:56] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:02:56] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:02:59] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/1306 variables, and 261 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 240/240 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62050 ms. Remains : 464/464 places, 842/842 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 96 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (290 resets) in 412 ms. (96 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-31 18:03:01] [INFO ] Invariant cache hit.
[2024-05-31 18:03:01] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:03:01] [INFO ] Deduced a trap composed of 2 places in 141 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 842/1305 variables, 463/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1305 variables, 780/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1305 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1306 variables, 1/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1266 constraints, problems are : Problem set: 1 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 842/1305 variables, 463/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1305 variables, 780/1287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1305 variables, 1/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1305 variables, 0/1288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1306 variables, 1/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1306 variables, 0/1289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1289 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3417 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 3964ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 842/842 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 840
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 840
Applied a total of 4 rules in 36 ms. Remains 462 /464 variables (removed 2) and now considering 840/842 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 462/464 places, 840/842 transitions.
RANDOM walk for 40000 steps (293 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31574 steps (11 resets) in 31 ms. (986 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 257 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 755 reset in 395 ms.
Product exploration explored 100000 steps with 761 reset in 403 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 22 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-31 18:03:07] [INFO ] Invariant cache hit.
[2024-05-31 18:03:07] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-31 18:03:07] [INFO ] Invariant cache hit.
[2024-05-31 18:03:07] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 18:03:08] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
[2024-05-31 18:03:08] [INFO ] Redundant transitions in 16 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-31 18:03:08] [INFO ] Invariant cache hit.
[2024-05-31 18:03:08] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:15] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-31 18:03:15] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-05-31 18:03:15] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-31 18:03:15] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-31 18:03:15] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:03:16] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:03:17] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:03:18] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:18] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:03:18] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:03:24] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:03:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:03:33] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:03:33] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-05-31 18:03:33] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:03:33] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:33] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:34] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:37] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:37] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 18:03:37] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:03:37] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:38] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:03:38] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:03:39] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:03:39] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1306 variables, and 125 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 104/104 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:40] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:03:40] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:03:40] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-05-31 18:03:43] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:03:43] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:44] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:03:44] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 18:03:44] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:44] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:03:47] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:03:47] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:03:48] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:03:48] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:03:51] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-31 18:03:51] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:03:51] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:51] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-31 18:03:52] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-05-31 18:03:52] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 3 ms to minimize.
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-31 18:03:55] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:03:55] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:03:55] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-31 18:03:55] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:03:55] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
[2024-05-31 18:04:06] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-31 18:04:06] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-31 18:04:06] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:04:06] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 3 ms to minimize.
[2024-05-31 18:04:06] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 822 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 463/1306 variables, and 265 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 244/244 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62131 ms. Remains : 464/464 places, 842/842 transitions.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 138818 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(((G(F(!p0))||G(!p1)) U p2))))'
[2024-05-31 18:04:09] [INFO ] Flatten gal took : 37 ms
[2024-05-31 18:04:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 18:04:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 656 places, 1042 transitions and 3692 arcs took 10 ms.
Total runtime 447038 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CANConstruction-PT-020-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CANConstruction-PT-020-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717179342987

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CANConstruction-PT-020-LTLFireability-00
ltl formula formula --ltl=/tmp/6095/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 656 places, 1042 transitions and 3692 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.040 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6095/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6095/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6095/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6095/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 658 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 657, there are 1052 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~701 levels ~10000 states ~71980 transitions
pnml2lts-mc( 0/ 4): ~1169 levels ~20000 states ~112176 transitions
pnml2lts-mc( 0/ 4): ~4289 levels ~40000 states ~200992 transitions
pnml2lts-mc( 0/ 4): ~8879 levels ~80000 states ~400480 transitions
pnml2lts-mc( 0/ 4): ~8879 levels ~160000 states ~842240 transitions
pnml2lts-mc( 0/ 4): ~8879 levels ~320000 states ~1653512 transitions
pnml2lts-mc( 0/ 4): ~18143 levels ~640000 states ~3421532 transitions
pnml2lts-mc( 0/ 4): ~135689 levels ~1280000 states ~7047240 transitions
pnml2lts-mc( 0/ 4): ~200324 levels ~2560000 states ~15630168 transitions
pnml2lts-mc( 0/ 4): ~200324 levels ~5120000 states ~31957760 transitions
pnml2lts-mc( 2/ 4): ~221057 levels ~10240000 states ~69715368 transitions
pnml2lts-mc( 0/ 4): ~971151 levels ~20480000 states ~138491476 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 168225
pnml2lts-mc( 0/ 4): unique states count: 26405382
pnml2lts-mc( 0/ 4): unique transitions count: 185160726
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 17482688
pnml2lts-mc( 0/ 4): - claim found count: 119520744
pnml2lts-mc( 0/ 4): - claim success count: 26405385
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8373845
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26405385 states 185160789 transitions, fanout: 7.012
pnml2lts-mc( 0/ 4): Total exploration time 692.400 sec (692.310 sec minimum, 692.353 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38136, Transitions per second: 267419
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 286.3MB, 8.9 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/47.0%
pnml2lts-mc( 0/ 4): Stored 1072 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 286.3MB (~256.0MB paged-in)
ltl formula name CANConstruction-PT-020-LTLFireability-14
ltl formula formula --ltl=/tmp/6095/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 656 places, 1042 transitions and 3692 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6095/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6095/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6095/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6095/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 657 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 657, there are 1108 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~51!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 197
pnml2lts-mc( 0/ 4): unique transitions count: 15103
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 200
pnml2lts-mc( 0/ 4): - cum. max stack depth: 198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 200 states 15527 transitions, fanout: 77.635
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4000, Transitions per second: 310540
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 15.9 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1072 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505000020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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