MCC'2024- Execution of r528-tall-171683762000844

About the Execution of LTSMin+red for ShieldRVs-PT-040B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2079.283	3576104.00	10950338.00	2961.30	F?TFF??TF?F?FFFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762000844.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 ShieldRVs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000844
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 498K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717269419083

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:17:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:17:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:17:00] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-01 19:17:00] [INFO ] Transformed 1603 places.
[2024-06-01 19:17:00] [INFO ] Transformed 1803 transitions.
[2024-06-01 19:17:00] [INFO ] Found NUPN structural information;
[2024-06-01 19:17:00] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 315 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 2 formulas.
FORMULA ShieldRVs-PT-040B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 270 place count 1333 transition count 1533
Iterating global reduction 0 with 270 rules applied. Total rules applied 540 place count 1333 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 541 place count 1332 transition count 1532
Iterating global reduction 0 with 1 rules applied. Total rules applied 542 place count 1332 transition count 1532
Applied a total of 542 rules in 293 ms. Remains 1332 /1603 variables (removed 271) and now considering 1532/1803 (removed 271) transitions.
// Phase 1: matrix 1532 rows 1332 cols
[2024-06-01 19:17:01] [INFO ] Computed 161 invariants in 37 ms
[2024-06-01 19:17:01] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-06-01 19:17:01] [INFO ] Invariant cache hit.
[2024-06-01 19:17:02] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Running 1531 sub problems to find dead transitions.
[2024-06-01 19:17:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
SMT process timed out in 30939ms, After SMT, problems are : Problem set: 0 solved, 1531 unsolved
Search for dead transitions found 0 dead transitions in 30971ms
Starting structural reductions in LTL mode, iteration 1 : 1332/1603 places, 1532/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33098 ms. Remains : 1332/1603 places, 1532/1803 transitions.
Support contains 51 out of 1332 places after structural reductions.
[2024-06-01 19:17:34] [INFO ] Flatten gal took : 262 ms
[2024-06-01 19:17:34] [INFO ] Flatten gal took : 165 ms
[2024-06-01 19:17:34] [INFO ] Input system was already deterministic with 1532 transitions.
Support contains 48 out of 1332 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (20 resets) in 2531 ms. (15 steps per ms) remains 7/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
[2024-06-01 19:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 200/216 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 19:17:36] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 12 ms to minimize.
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1116/1332 variables, 144/162 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 19:17:37] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 20 ms to minimize.
[2024-06-01 19:17:38] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 6 ms to minimize.
[2024-06-01 19:17:38] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 12 ms to minimize.
[2024-06-01 19:17:38] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 4 ms to minimize.
[2024-06-01 19:17:39] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 5 ms to minimize.
[2024-06-01 19:17:39] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 4 ms to minimize.
[2024-06-01 19:17:39] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 5 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 4 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 4 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 4 ms to minimize.
[2024-06-01 19:17:40] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 4 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 4 ms to minimize.
[2024-06-01 19:17:41] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 4 ms to minimize.
SMT process timed out in 5145ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 1332 transition count 1374
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 1 with 158 rules applied. Total rules applied 316 place count 1174 transition count 1374
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 316 place count 1174 transition count 1176
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 712 place count 976 transition count 1176
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 719 place count 969 transition count 1169
Iterating global reduction 2 with 7 rules applied. Total rules applied 726 place count 969 transition count 1169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 726 place count 969 transition count 1166
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 732 place count 966 transition count 1166
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1518 place count 573 transition count 773
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 1598 place count 573 transition count 773
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1599 place count 572 transition count 772
Applied a total of 1599 rules in 464 ms. Remains 572 /1332 variables (removed 760) and now considering 772/1532 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 572/1332 places, 772/1532 transitions.
RANDOM walk for 40000 steps (80 resets) in 510 ms. (78 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/2 properties
BEST_FIRST walk for 22080 steps (3 resets) in 93 ms. (234 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-040B-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 325 stabilizing places and 325 stable transitions
FORMULA ShieldRVs-PT-040B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1331 transition count 1370
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1170 transition count 1370
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1170 transition count 1170
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 970 transition count 1170
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 732 place count 960 transition count 1160
Iterating global reduction 2 with 10 rules applied. Total rules applied 742 place count 960 transition count 1160
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 742 place count 960 transition count 1156
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 750 place count 956 transition count 1156
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1536 place count 563 transition count 763
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1538 place count 561 transition count 761
Applied a total of 1538 rules in 202 ms. Remains 561 /1332 variables (removed 771) and now considering 761/1532 (removed 771) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-06-01 19:17:42] [INFO ] Computed 161 invariants in 20 ms
[2024-06-01 19:17:43] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 19:17:43] [INFO ] Invariant cache hit.
[2024-06-01 19:17:43] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
[2024-06-01 19:17:44] [INFO ] Redundant transitions in 196 ms returned [760]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 759 sub problems to find dead transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-06-01 19:17:44] [INFO ] Computed 161 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:17:50] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:17:50] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:17:50] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:17:51] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:17:51] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:17:51] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:17:51] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:17:51] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:17:52] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:17:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:17:54] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 4 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:17:55] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:17:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:17:57] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:17:58] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:17:58] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:17:58] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:17:58] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:17:58] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:17:59] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:17:59] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:05] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:05] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:18:06] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:18:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:18:06] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:18:06] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:18:06] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:18:06] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:18:07] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:18:07] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:18:07] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:07] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:18:07] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:18:07] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:18:08] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:08] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:18:08] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:18:08] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:18:08] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:18:08] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:18:09] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 7 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:18:10] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:11] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:12] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:12] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:18:12] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:18:13] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:13] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:13] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:18:13] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:18:13] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:13] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:14] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:14] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
SMT process timed out in 30362ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 30371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1332 places, 760/1532 transitions.
Applied a total of 0 rules in 30 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31769 ms. Remains : 561/1332 places, 760/1532 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-01
Product exploration explored 100000 steps with 186 reset in 651 ms.
Product exploration explored 100000 steps with 187 reset in 517 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 1904 steps (0 resets) in 22 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-06-01 19:18:16] [INFO ] Invariant cache hit.
[2024-06-01 19:18:16] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 19:18:16] [INFO ] Invariant cache hit.
[2024-06-01 19:18:16] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2024-06-01 19:18:17] [INFO ] Redundant transitions in 127 ms returned []
Running 759 sub problems to find dead transitions.
[2024-06-01 19:18:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:23] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:23] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:18:23] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:18:23] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:18:24] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:25] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 18 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:18:26] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:18:27] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:18:28] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:18:29] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:18:30] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:18:30] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:30] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:18:30] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:30] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:18:30] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:18:31] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:31] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:31] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:18:31] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:31] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:31] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:38] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:18:38] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:18:38] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:18:38] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:18:38] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:18:39] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:18:39] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:18:39] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:18:39] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:18:40] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:41] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:18:41] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:18:41] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:18:41] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:41] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:42] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:18:43] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:18:43] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:43] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:18:43] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:18:43] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:18:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:18:44] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:18:44] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:18:44] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:44] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:44] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:18:45] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:45] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:18:45] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:18:45] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:18:46] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:18:46] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:18:46] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:46] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:18:46] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:18:47] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:18:47] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1321 variables, and 271 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 110/271 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:48] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 4 ms to minimize.
[2024-06-01 19:18:48] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:48] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:18:48] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:48] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:18:49] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:49] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:18:49] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:18:49] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:18:50] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:18:51] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:18:51] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:18:51] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:18:51] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 4 ms to minimize.
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:18:52] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:18:54] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:55] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:18:56] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:18:57] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:18:57] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:18:57] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:18:57] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:18:57] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:18:57] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:18:58] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:18:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:19:00] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:19:01] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:06] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:19:08] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:19:08] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:19:08] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:19:08] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:19:08] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:19:11] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:14] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:19:15] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:19:15] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:15] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:19:15] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:17] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:17] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:19:17] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 60383ms, After SMT, problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61330 ms. Remains : 561/561 places, 760/760 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 1961 steps (0 resets) in 20 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 186 reset in 405 ms.
Product exploration explored 100000 steps with 187 reset in 488 ms.
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 14 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-06-01 19:19:18] [INFO ] Invariant cache hit.
[2024-06-01 19:19:18] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 19:19:18] [INFO ] Invariant cache hit.
[2024-06-01 19:19:19] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-06-01 19:19:19] [INFO ] Redundant transitions in 162 ms returned []
Running 759 sub problems to find dead transitions.
[2024-06-01 19:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 3 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:19:33] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:19:33] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:19:33] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:33] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:33] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:19:34] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:34] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:34] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:40] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:19:42] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:19:43] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
(s433 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0timeout
)
(s434 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1321 variables, and 274 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 113/274 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:50] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:19:57] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:57] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:19:57] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:57] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:19:58] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:19:58] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:19:58] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:19:58] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:19:58] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:19:59] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:59] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:19:59] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:19:59] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:20:09] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 759 unsolved
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1321 variables, and 425 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 264/264 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61195 ms. Remains : 561/561 places, 760/760 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-01 finished in 157443 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(p1)&&p0)))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 67 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-06-01 19:20:20] [INFO ] Computed 161 invariants in 11 ms
[2024-06-01 19:20:20] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 19:20:20] [INFO ] Invariant cache hit.
[2024-06-01 19:20:21] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:20:21] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30449ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30465ms
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32086 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-03 finished in 32276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 66 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-06-01 19:20:52] [INFO ] Computed 161 invariants in 11 ms
[2024-06-01 19:20:52] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 19:20:52] [INFO ] Invariant cache hit.
[2024-06-01 19:20:53] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30401ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30419ms
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32008 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 174 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-05
Product exploration explored 100000 steps with 59 reset in 528 ms.
Product exploration explored 100000 steps with 59 reset in 557 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (20 resets) in 508 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 131071 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 131071 steps, saw 116836 distinct states, run finished after 3005 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 19:21:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1323 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:21:29] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 4 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 4 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 4 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 4 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 4 ms to minimize.
[2024-06-01 19:21:31] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 4 ms to minimize.
[2024-06-01 19:21:31] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:21:31] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 4 ms to minimize.
[2024-06-01 19:21:31] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:21:33] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:21:33] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:21:33] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:21:33] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:21:33] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1323 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:21:34] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:21:34] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:21:34] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
SMT process timed out in 5137ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 148 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 563/1323 places, 763/1523 transitions.
RANDOM walk for 24422 steps (48 resets) in 432 ms. (56 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 216 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 34 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2024-06-01 19:21:35] [INFO ] Invariant cache hit.
[2024-06-01 19:21:35] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 19:21:35] [INFO ] Invariant cache hit.
[2024-06-01 19:21:36] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:21:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30388ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30404ms
Finished structural reductions in LTL mode , in 1 iterations and 31900 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (20 resets) in 463 ms. (86 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
[2024-06-01 19:22:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1242/1323 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:22:08] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 5 ms to minimize.
[2024-06-01 19:22:08] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 5 ms to minimize.
[2024-06-01 19:22:08] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 5 ms to minimize.
[2024-06-01 19:22:09] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 5 ms to minimize.
[2024-06-01 19:22:09] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 5 ms to minimize.
[2024-06-01 19:22:09] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 5 ms to minimize.
[2024-06-01 19:22:10] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:22:10] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 5 ms to minimize.
[2024-06-01 19:22:10] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 5 ms to minimize.
[2024-06-01 19:22:11] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 4 ms to minimize.
[2024-06-01 19:22:11] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 5 ms to minimize.
[2024-06-01 19:22:11] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 5 ms to minimize.
[2024-06-01 19:22:11] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 5 ms to minimize.
[2024-06-01 19:22:12] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 5 ms to minimize.
[2024-06-01 19:22:12] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:22:12] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:22:12] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 4 ms to minimize.
SMT process timed out in 5160ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 122 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 563/1323 places, 763/1523 transitions.
RANDOM walk for 18413 steps (36 resets) in 185 ms. (98 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 58 reset in 397 ms.
Product exploration explored 100000 steps with 58 reset in 469 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 34 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2024-06-01 19:22:15] [INFO ] Invariant cache hit.
[2024-06-01 19:22:15] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 19:22:15] [INFO ] Invariant cache hit.
[2024-06-01 19:22:16] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:22:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30433ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30448ms
Finished structural reductions in LTL mode , in 1 iterations and 32027 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-05 finished in 114732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1331 transition count 1371
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1171 transition count 1371
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 320 place count 1171 transition count 1172
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 718 place count 972 transition count 1172
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 727 place count 963 transition count 1163
Iterating global reduction 2 with 9 rules applied. Total rules applied 736 place count 963 transition count 1163
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 736 place count 963 transition count 1159
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 744 place count 959 transition count 1159
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1530 place count 566 transition count 766
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1532 place count 564 transition count 764
Applied a total of 1532 rules in 143 ms. Remains 564 /1332 variables (removed 768) and now considering 764/1532 (removed 768) transitions.
// Phase 1: matrix 764 rows 564 cols
[2024-06-01 19:22:47] [INFO ] Computed 161 invariants in 6 ms
[2024-06-01 19:22:47] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-01 19:22:47] [INFO ] Invariant cache hit.
[2024-06-01 19:22:47] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-06-01 19:22:48] [INFO ] Redundant transitions in 193 ms returned [763]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 761 sub problems to find dead transitions.
// Phase 1: matrix 763 rows 564 cols
[2024-06-01 19:22:48] [INFO ] Computed 161 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:22:54] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:22:54] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:22:55] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:22:55] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:22:55] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:22:55] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:22:55] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:22:55] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:22:56] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:22:56] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:22:56] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:22:56] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:22:56] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:22:56] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:22:57] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:22:57] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:22:57] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:22:57] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:22:57] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:22:57] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:22:58] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:22:59] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:22:59] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:22:59] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:22:59] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:22:59] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:22:59] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:23:00] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:23:00] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:23:00] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-06-01 19:23:00] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:23:00] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:00] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:01] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:23:01] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:23:01] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:23:01] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:23:01] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:23:01] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:02] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:23:02] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:23:02] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:23:02] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:02] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:02] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:03] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-06-01 19:23:04] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:10] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:23:10] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:23:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:23:10] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:23:11] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:11] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:23:11] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:23:11] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:11] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:23:12] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:13] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 4 ms to minimize.
[2024-06-01 19:23:13] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:13] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:23:14] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:14] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:14] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:23:14] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:14] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:23:15] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:23:16] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:23:17] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:18] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30195ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 30201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1332 places, 763/1532 transitions.
Applied a total of 0 rules in 16 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31331 ms. Remains : 564/1332 places, 763/1532 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-06
Product exploration explored 100000 steps with 184 reset in 413 ms.
Product exploration explored 100000 steps with 184 reset in 493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33100 steps (6 resets) in 115 ms. (285 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 763/763 transitions.
Applied a total of 0 rules in 19 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-06-01 19:23:19] [INFO ] Invariant cache hit.
[2024-06-01 19:23:20] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 19:23:20] [INFO ] Invariant cache hit.
[2024-06-01 19:23:20] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-06-01 19:23:20] [INFO ] Redundant transitions in 144 ms returned []
Running 761 sub problems to find dead transitions.
[2024-06-01 19:23:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:23:27] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:23:28] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:29] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:23:30] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:23:30] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:23:30] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:30] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:23:30] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:31] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:23:32] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:23:32] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:32] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:23:32] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:23:32] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2024-06-01 19:23:32] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:23:33] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:23:33] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:23:33] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:33] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:23:33] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:23:33] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:23:34] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:23:34] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:23:34] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:23:34] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:23:35] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:23:36] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:23:36] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:23:36] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:23:36] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:23:36] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:23:36] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:23:45] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:46] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:23:46] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 4 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:23:51] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 30273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31200 ms. Remains : 564/564 places, 763/763 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 216888 steps, run visited all 1 properties in 1374 ms. (steps per millisecond=157 )
Probabilistic random walk after 216888 steps, saw 210040 distinct states, run finished after 1377 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 185 reset in 469 ms.
Product exploration explored 100000 steps with 184 reset in 517 ms.
Support contains 2 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 763/763 transitions.
Applied a total of 0 rules in 12 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-06-01 19:23:54] [INFO ] Invariant cache hit.
[2024-06-01 19:23:54] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 19:23:54] [INFO ] Invariant cache hit.
[2024-06-01 19:23:54] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-06-01 19:23:55] [INFO ] Redundant transitions in 265 ms returned []
Running 761 sub problems to find dead transitions.
[2024-06-01 19:23:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:24:01] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:24:01] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:02] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:24:03] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:24:03] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:03] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:24:03] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:24:03] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:24:03] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:24:04] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-06-01 19:24:04] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:24:04] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:24:04] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:24:04] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:24:08] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:24:08] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:24:08] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:24:08] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:24:08] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:09] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:24:09] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:24:09] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:09] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:24:09] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:24:10] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:24:11] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:24:24] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:24:25] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:24:25] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:24:25] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:25] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 30280ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 30286ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31329 ms. Remains : 564/564 places, 763/763 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-06 finished in 98468 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((X(p0)&&(p0||F(p1)||G(p2)))))'
Support contains 7 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 56 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-06-01 19:24:25] [INFO ] Computed 161 invariants in 10 ms
[2024-06-01 19:24:25] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-01 19:24:25] [INFO ] Invariant cache hit.
[2024-06-01 19:24:27] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:24:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30340ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31907 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-08 finished in 32122 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(p1)||(p2 U p3))))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 58 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-06-01 19:24:57] [INFO ] Computed 161 invariants in 10 ms
[2024-06-01 19:24:58] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 19:24:58] [INFO ] Invariant cache hit.
[2024-06-01 19:24:59] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:24:59] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30340ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30353ms
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31967 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-09
Product exploration explored 100000 steps with 67 reset in 405 ms.
Product exploration explored 100000 steps with 66 reset in 468 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p1), (X (NOT p3)), (X p0), (X (AND p0 (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 8012 steps (2 resets) in 51 ms. (154 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p3) p1), (X (NOT p3)), (X p0), (X (AND p0 (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p3), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 8 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 2 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 28 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2024-06-01 19:25:31] [INFO ] Invariant cache hit.
[2024-06-01 19:25:31] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 19:25:31] [INFO ] Invariant cache hit.
[2024-06-01 19:25:32] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2024-06-01 19:25:32] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
SMT process timed out in 30358ms, After SMT, problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 30370ms
Finished structural reductions in LTL mode , in 1 iterations and 31947 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND p1 (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 6692 steps (1 resets) in 57 ms. (115 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p3), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 70 reset in 392 ms.
Product exploration explored 100000 steps with 68 reset in 454 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1323 transition count 1523
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 159 place count 1323 transition count 1563
Deduced a syphon composed of 240 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 240 place count 1323 transition count 1563
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 242 place count 1321 transition count 1561
Deduced a syphon composed of 239 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 244 place count 1321 transition count 1561
Performed 518 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 757 places in 2 ms
Iterating global reduction 1 with 518 rules applied. Total rules applied 762 place count 1321 transition count 1561
Renaming transitions due to excessive name length > 1024 char.
Discarding 278 places :
Symmetric choice reduction at 1 with 278 rule applications. Total rules 1040 place count 1043 transition count 1283
Deduced a syphon composed of 479 places in 1 ms
Iterating global reduction 1 with 278 rules applied. Total rules applied 1318 place count 1043 transition count 1283
Deduced a syphon composed of 479 places in 2 ms
Applied a total of 1318 rules in 452 ms. Remains 1043 /1323 variables (removed 280) and now considering 1283/1523 (removed 240) transitions.
[2024-06-01 19:26:05] [INFO ] Redundant transitions in 151 ms returned [1282]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1281 sub problems to find dead transitions.
// Phase 1: matrix 1282 rows 1043 cols
[2024-06-01 19:26:05] [INFO ] Computed 161 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
SMT process timed out in 31080ms, After SMT, problems are : Problem set: 0 solved, 1281 unsolved
Search for dead transitions found 0 dead transitions in 31093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1043/1323 places, 1282/1523 transitions.
Deduced a syphon composed of 479 places in 1 ms
Applied a total of 0 rules in 30 ms. Remains 1043 /1043 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31740 ms. Remains : 1043/1323 places, 1282/1523 transitions.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1322 transition count 1522
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1322 transition count 1522
Applied a total of 2 rules in 48 ms. Remains 1322 /1323 variables (removed 1) and now considering 1522/1523 (removed 1) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-06-01 19:26:37] [INFO ] Computed 161 invariants in 7 ms
[2024-06-01 19:26:37] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 19:26:37] [INFO ] Invariant cache hit.
[2024-06-01 19:26:38] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 19:26:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1321 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
SMT process timed out in 30375ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 30390ms
Starting structural reductions in LTL mode, iteration 1 : 1322/1323 places, 1522/1523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32008 ms. Remains : 1322/1323 places, 1522/1523 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-09 finished in 131429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1&&(p2 U G(p3))))))'
Support contains 6 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1325 transition count 1525
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1325 transition count 1525
Applied a total of 14 rules in 83 ms. Remains 1325 /1332 variables (removed 7) and now considering 1525/1532 (removed 7) transitions.
// Phase 1: matrix 1525 rows 1325 cols
[2024-06-01 19:27:09] [INFO ] Computed 161 invariants in 4 ms
[2024-06-01 19:27:09] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-06-01 19:27:09] [INFO ] Invariant cache hit.
[2024-06-01 19:27:10] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Running 1524 sub problems to find dead transitions.
[2024-06-01 19:27:10] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
SMT process timed out in 30375ms, After SMT, problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 30389ms
Starting structural reductions in LTL mode, iteration 1 : 1325/1332 places, 1525/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31962 ms. Remains : 1325/1332 places, 1525/1532 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-10 finished in 32364 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(p0)||(G(F(p2))&&p1))))'
Support contains 6 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1322 transition count 1522
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1322 transition count 1522
Applied a total of 20 rules in 53 ms. Remains 1322 /1332 variables (removed 10) and now considering 1522/1532 (removed 10) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-06-01 19:27:41] [INFO ] Computed 161 invariants in 9 ms
[2024-06-01 19:27:41] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 19:27:41] [INFO ] Invariant cache hit.
[2024-06-01 19:27:42] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 19:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1321 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
SMT process timed out in 30362ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 30377ms
Starting structural reductions in LTL mode, iteration 1 : 1322/1332 places, 1522/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31899 ms. Remains : 1322/1332 places, 1522/1532 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-11
Product exploration explored 100000 steps with 114 reset in 416 ms.
Product exploration explored 100000 steps with 115 reset in 427 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 124 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 455 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
RANDOM walk for 40000 steps (20 resets) in 300 ms. (132 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
[2024-06-01 19:28:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 89/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1227/1322 variables, 155/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 19:28:15] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 4 ms to minimize.
[2024-06-01 19:28:16] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 5 ms to minimize.
[2024-06-01 19:28:16] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:28:16] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:28:16] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:28:17] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 4 ms to minimize.
[2024-06-01 19:28:17] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 4 ms to minimize.
[2024-06-01 19:28:17] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:28:18] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 4 ms to minimize.
[2024-06-01 19:28:18] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 4 ms to minimize.
[2024-06-01 19:28:18] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 4 ms to minimize.
[2024-06-01 19:28:18] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:28:18] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 4 ms to minimize.
[2024-06-01 19:28:19] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:28:19] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:28:19] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:28:19] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:28:19] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-06-01 19:28:19] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:28:20] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 19:28:20] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 4 ms to minimize.
[2024-06-01 19:28:20] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:28:20] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 5077ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1322/1322 places, 1522/1522 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1322 transition count 1361
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1161 transition count 1361
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1161 transition count 1161
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 961 transition count 1161
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 563 transition count 763
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 1598 place count 563 transition count 763
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1599 place count 562 transition count 762
Applied a total of 1599 rules in 107 ms. Remains 562 /1322 variables (removed 760) and now considering 762/1522 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 562/1322 places, 762/1522 transitions.
RANDOM walk for 40000 steps (84 resets) in 1151 ms. (34 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/2 properties
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:28:21] [INFO ] Computed 161 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/268 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/429 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/439 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 155/594 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/594 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/594 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/604 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/604 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/604 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 155/759 variables, 60/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/759 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/769 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 10/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 155/924 variables, 60/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/924 variables, 15/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/924 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 10/934 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/934 variables, 10/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/934 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 155/1089 variables, 60/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1089 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1089 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 10/1099 variables, 5/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1099 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1099 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 148/1247 variables, 60/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1247 variables, 15/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1247 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/1257 variables, 5/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1257 variables, 10/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1257 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 63/1320 variables, 38/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1320 variables, 12/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1320 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/1322 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1322 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1322 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/1324 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1324 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1324 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/1324 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/268 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 161/429 variables, 64/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/439 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/439 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 155/594 variables, 60/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/594 variables, 15/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/594 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/594 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/604 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/604 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/604 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 155/759 variables, 60/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/759 variables, 15/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/759 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/769 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/769 variables, 10/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/769 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 155/924 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/924 variables, 15/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/924 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 10/934 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/934 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/934 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 155/1089 variables, 60/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1089 variables, 15/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1089 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 10/1099 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1099 variables, 10/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1099 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 148/1247 variables, 60/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1247 variables, 15/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1247 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 10/1257 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1257 variables, 10/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1257 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 63/1320 variables, 38/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1320 variables, 12/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:22] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1320 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1320 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 2/1322 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1322 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1322 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/1324 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1324 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1324 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/1324 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 13 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 562/562 places, 762/762 transitions.
RANDOM walk for 40000 steps (84 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242652 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242652 steps, saw 63076 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-01 19:28:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/268 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/429 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/439 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 155/594 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/594 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/594 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/604 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/604 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/604 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 155/759 variables, 60/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/759 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/769 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 10/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 155/924 variables, 60/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/924 variables, 15/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:26] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/924 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/924 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 10/934 variables, 5/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/934 variables, 10/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/934 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 155/1089 variables, 60/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1089 variables, 15/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1089 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1089 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/1099 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1099 variables, 10/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1099 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 148/1247 variables, 60/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1247 variables, 15/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1247 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 10/1257 variables, 5/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1257 variables, 10/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1257 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 63/1320 variables, 38/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1320 variables, 12/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:26] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/1320 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1320 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/1322 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1322 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1322 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/1324 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1324 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:26] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:28:26] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1324 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1324 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/1324 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/268 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 161/429 variables, 64/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/439 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/439 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 155/594 variables, 60/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/594 variables, 15/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/594 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/604 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/604 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/604 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 155/759 variables, 60/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/759 variables, 15/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/759 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/759 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/769 variables, 5/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/769 variables, 10/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/769 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 155/924 variables, 60/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/924 variables, 15/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/924 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/924 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 10/934 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/934 variables, 10/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/934 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 155/1089 variables, 60/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1089 variables, 15/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1089 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1089 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1089 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 10/1099 variables, 5/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1099 variables, 10/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1099 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 148/1247 variables, 60/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1247 variables, 15/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1247 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1247 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 10/1257 variables, 5/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1257 variables, 10/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:27] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1257 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1257 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 63/1320 variables, 38/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1320 variables, 12/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1320 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1320 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 2/1322 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1322 variables, 2/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1322 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/1324 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1324 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1324 variables, 2/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:28:28] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1324 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1324 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 0/1324 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 739 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 2346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-06-01 19:28:28] [INFO ] Invariant cache hit.
[2024-06-01 19:28:28] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 19:28:28] [INFO ] Invariant cache hit.
[2024-06-01 19:28:29] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-06-01 19:28:29] [INFO ] Redundant transitions in 62 ms returned [681]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:28:29] [INFO ] Computed 161 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:28:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:28:35] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:28:35] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:28:36] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:28:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:28:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:28:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:28:40] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:28:41] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:28:49] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:28:49] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:28:49] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:28:50] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:28:50] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:28:50] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:28:50] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:28:50] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:28:50] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-06-01 19:28:51] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:28:51] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2024-06-01 19:28:51] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:28:51] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:28:51] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:28:52] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:28:52] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:28:52] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:28:52] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:28:52] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:28:52] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:28:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:28:53] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:28:53] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:28:53] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:28:53] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 3 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:28:54] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:28:55] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:28:55] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:28:55] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:28:55] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:28:55] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:28:57] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 2 ms to minimize.
[2024-06-01 19:28:57] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:28:57] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:28:57] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:28:57] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:28:58] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:28:58] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:28:58] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:28:58] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:28:58] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:28:58] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:28:59] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:28:59] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 2 ms to minimize.
[2024-06-01 19:28:59] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 2 ms to minimize.
SMT process timed out in 30264ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 30270ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31198 ms. Remains : 562/562 places, 761/762 transitions.
RANDOM walk for 40000 steps (83 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36467 steps (7 resets) in 110 ms. (328 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 513 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 461 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 437 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 1522 rows 1322 cols
[2024-06-01 19:29:01] [INFO ] Computed 161 invariants in 12 ms
[2024-06-01 19:29:01] [INFO ] [Real]Absence check using 161 positive place invariants in 114 ms returned sat
[2024-06-01 19:29:05] [INFO ] [Real]Absence check using state equation in 3398 ms returned sat
[2024-06-01 19:29:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:29:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 119 ms returned sat
[2024-06-01 19:29:09] [INFO ] [Nat]Absence check using state equation in 3705 ms returned sat
[2024-06-01 19:29:09] [INFO ] Computed and/alt/rep : 1521/4824/1521 causal constraints (skipped 0 transitions) in 75 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 19:29:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 19:29:20] [INFO ] Invariant cache hit.
[2024-06-01 19:29:20] [INFO ] [Real]Absence check using 161 positive place invariants in 109 ms returned sat
[2024-06-01 19:29:24] [INFO ] [Real]Absence check using state equation in 3517 ms returned sat
[2024-06-01 19:29:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:29:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 118 ms returned sat
[2024-06-01 19:29:30] [INFO ] [Nat]Absence check using state equation in 4952 ms returned sat
[2024-06-01 19:29:30] [INFO ] Computed and/alt/rep : 1521/4824/1521 causal constraints (skipped 0 transitions) in 91 ms.
[2024-06-01 19:29:39] [INFO ] Added : 445 causal constraints over 89 iterations in 9343 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 1322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1322/1322 places, 1522/1522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1321 transition count 1360
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1160 transition count 1360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1160 transition count 1160
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 960 transition count 1160
Performed 396 Post agglomeration using F-continuation condition.Transition count delta: 396
Deduced a syphon composed of 396 places in 1 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1514 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1516 place count 562 transition count 762
Applied a total of 1516 rules in 108 ms. Remains 562 /1322 variables (removed 760) and now considering 762/1522 (removed 760) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:29:39] [INFO ] Computed 161 invariants in 4 ms
[2024-06-01 19:29:39] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 19:29:39] [INFO ] Invariant cache hit.
[2024-06-01 19:29:40] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2024-06-01 19:29:40] [INFO ] Redundant transitions in 139 ms returned [761]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:29:40] [INFO ] Computed 161 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:29:47] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:29:47] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:29:47] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:29:47] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:29:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:29:47] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:29:48] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:29:49] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:29:49] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:29:49] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:29:49] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:29:49] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:29:49] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:29:50] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:29:50] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-06-01 19:29:50] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:29:50] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:29:50] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:29:50] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:29:51] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:29:51] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:29:51] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:29:51] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:29:51] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:29:51] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:29:52] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:29:52] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:29:52] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:29:52] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:29:52] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:29:52] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:29:53] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:29:54] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:29:55] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:29:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:30:01] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:30:01] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:30:01] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:30:02] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:30:03] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:30:03] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:30:03] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:30:03] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:30:03] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:30:03] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:30:04] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:30:04] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:30:04] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:30:04] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:30:05] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:30:05] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:30:05] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:30:05] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:30:05] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:30:05] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:30:06] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:30:06] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 3 ms to minimize.
[2024-06-01 19:30:06] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:30:06] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:30:06] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:30:06] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:30:07] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:30:08] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:30:08] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:30:08] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:30:08] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:30:08] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:30:08] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:30:09] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:30:09] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:30:09] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:30:09] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:30:09] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:30:10] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:30:10] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:30:10] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:30:10] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:30:10] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:30:10] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 30274ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 30283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1322 places, 761/1522 transitions.
Applied a total of 0 rules in 13 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31364 ms. Remains : 562/1322 places, 761/1522 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 140 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 433 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
RANDOM walk for 40000 steps (72 resets) in 919 ms. (43 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
[2024-06-01 19:30:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/267 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 161/428 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/438 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 155/593 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/593 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:12] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:30:12] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:30:12] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:30:12] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:30:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 10/603 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/603 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/603 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 155/758 variables, 60/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/758 variables, 15/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/758 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/768 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/768 variables, 10/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/768 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/768 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 155/923 variables, 60/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 15/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 10/933 variables, 5/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/933 variables, 10/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/933 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 155/1088 variables, 60/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1088 variables, 15/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1088 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 10/1098 variables, 5/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1098 variables, 10/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1098 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 148/1246 variables, 60/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1246 variables, 15/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1246 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 10/1256 variables, 5/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1256 variables, 10/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1256 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 63/1319 variables, 38/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 12/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1319 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 2/1321 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1321 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1321 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 2/1323 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1323 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1323 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 0/1323 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 729 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1321 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:13] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/267 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 161/428 variables, 64/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 16/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:13] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/438 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 155/593 variables, 60/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/593 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:13] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/593 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/593 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/603 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/603 variables, 10/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/603 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 155/758 variables, 60/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/758 variables, 15/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/758 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:13] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/758 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/758 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 10/768 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/768 variables, 10/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:14] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/768 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/768 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 155/923 variables, 60/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/923 variables, 15/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/923 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 10/933 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/933 variables, 10/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/933 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 155/1088 variables, 60/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1088 variables, 15/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1088 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 10/1098 variables, 5/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1098 variables, 10/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1098 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 148/1246 variables, 60/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1246 variables, 15/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1246 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 10/1256 variables, 5/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1256 variables, 10/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1256 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 63/1319 variables, 38/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1319 variables, 12/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:30:14] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1319 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1319 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 2/1321 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1321 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1321 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 2/1323 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1323 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1323 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 0/1323 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 738 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 3310ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 761
Applied a total of 80 rules in 29 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 562/562 places, 761/761 transitions.
RANDOM walk for 40000 steps (84 resets) in 836 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 172 ms. (231 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:30:15] [INFO ] Computed 161 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/267 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 161/428 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/438 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 155/593 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/593 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 10/603 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/603 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/603 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 155/758 variables, 60/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/758 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:16] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:30:16] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:30:16] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:30:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/758 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/758 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 10/768 variables, 5/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/768 variables, 10/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/768 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 155/923 variables, 60/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 15/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 10/933 variables, 5/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/933 variables, 10/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/933 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 155/1088 variables, 60/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1088 variables, 15/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1088 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 10/1098 variables, 5/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1098 variables, 10/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1098 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 148/1246 variables, 60/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1246 variables, 15/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1246 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 10/1256 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1256 variables, 10/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1256 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 63/1319 variables, 38/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1319 variables, 12/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 2/1321 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1321 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1321 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 2/1323 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1323 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1323 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 0/1323 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 727 constraints, problems are : Problem set: 0 solved, 2 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/267 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 161/428 variables, 64/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 16/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/438 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:16] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:30:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 155/593 variables, 60/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 15/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/593 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:17] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/593 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/593 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 10/603 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/603 variables, 10/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/603 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 155/758 variables, 60/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/758 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/758 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:17] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/758 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/758 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 10/768 variables, 5/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/768 variables, 10/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/768 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 155/923 variables, 60/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/923 variables, 15/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/923 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/923 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 10/933 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/933 variables, 10/498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/933 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 155/1088 variables, 60/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1088 variables, 15/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1088 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 10/1098 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1098 variables, 10/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1098 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 148/1246 variables, 60/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1246 variables, 15/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:17] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:30:17] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/1246 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1246 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 10/1256 variables, 5/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1256 variables, 10/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1256 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 63/1319 variables, 38/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1319 variables, 12/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:18] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1319 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:18] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1319 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1319 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 2/1321 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1321 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:18] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/1321 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:18] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1321 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:18] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/1321 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:30:18] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1321 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1321 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 2/1323 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1323 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1323 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 0/1323 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 742 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 3261ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1471 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 562/562 places, 761/761 transitions.
RANDOM walk for 40000 steps (84 resets) in 677 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2024-06-01 19:30:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/267 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/428 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/438 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 155/593 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/593 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/603 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/603 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/603 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 155/758 variables, 60/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/758 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/758 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/758 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 10/768 variables, 5/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/768 variables, 10/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/768 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 155/923 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 10/933 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/933 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/933 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 155/1088 variables, 60/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1088 variables, 15/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1088 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/1098 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1098 variables, 10/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1098 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 148/1246 variables, 60/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1246 variables, 15/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1246 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1246 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 10/1256 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1256 variables, 10/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1256 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1256 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 63/1319 variables, 38/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1319 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:30:21] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1319 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1319 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 2/1321 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1321 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:22] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:30:22] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1321 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1321 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 2/1323 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1323 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1323 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 0/1323 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/267 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 161/428 variables, 64/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 16/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:22] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/438 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 155/593 variables, 60/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 15/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/603 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/603 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/603 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 155/758 variables, 60/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/758 variables, 15/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/758 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/758 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/768 variables, 5/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/768 variables, 10/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/768 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 155/923 variables, 60/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 15/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/923 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/923 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 10/933 variables, 5/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/933 variables, 10/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/933 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/933 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 155/1088 variables, 60/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1088 variables, 15/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1088 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1088 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/1098 variables, 5/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1098 variables, 10/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1098 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 148/1246 variables, 60/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1246 variables, 15/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1246 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:30:22] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1246 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1246 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 10/1256 variables, 5/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1256 variables, 10/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1256 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1256 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 63/1319 variables, 38/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1319 variables, 12/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1319 variables, 3/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1319 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 2/1321 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1321 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1321 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/1323 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1323 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1323 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 0/1323 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 737 constraints, problems are : Problem set: 0 solved, 1 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 2360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 13 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 562/562 places, 761/761 transitions.
RANDOM walk for 40000 steps (84 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32975 steps (6 resets) in 89 ms. (366 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 24 factoid took 538 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 451 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:30:24] [INFO ] Computed 161 invariants in 2 ms
[2024-06-01 19:30:25] [INFO ] [Real]Absence check using 161 positive place invariants in 40 ms returned sat
[2024-06-01 19:30:25] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-06-01 19:30:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:30:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 41 ms returned sat
[2024-06-01 19:30:26] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-06-01 19:30:26] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 43 ms.
[2024-06-01 19:30:38] [INFO ] Added : 681 causal constraints over 137 iterations in 12076 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 19:30:38] [INFO ] Invariant cache hit.
[2024-06-01 19:30:38] [INFO ] [Real]Absence check using 161 positive place invariants in 42 ms returned sat
[2024-06-01 19:30:39] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2024-06-01 19:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:30:39] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2024-06-01 19:30:40] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-06-01 19:30:40] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 42 ms.
[2024-06-01 19:30:50] [INFO ] Added : 651 causal constraints over 131 iterations in 10286 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 450 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 529 reset in 435 ms.
Product exploration explored 100000 steps with 528 reset in 515 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-06-01 19:30:52] [INFO ] Invariant cache hit.
[2024-06-01 19:30:52] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 19:30:52] [INFO ] Invariant cache hit.
[2024-06-01 19:30:52] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-06-01 19:30:52] [INFO ] Redundant transitions in 121 ms returned []
Running 760 sub problems to find dead transitions.
[2024-06-01 19:30:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:30:59] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:30:59] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:30:59] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:31:00] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:31:01] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:31:02] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:31:02] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:31:02] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:31:02] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:31:02] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:31:03] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:31:04] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:31:04] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:31:04] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:31:04] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:31:04] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:31:04] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2024-06-01 19:31:05] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:31:05] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:31:05] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:31:05] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:31:05] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:31:05] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:31:06] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:31:07] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:31:14] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:31:14] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:31:14] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:31:14] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:31:14] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:31:15] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:31:15] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:31:15] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2024-06-01 19:31:15] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:31:15] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:31:15] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:31:16] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:31:16] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:31:16] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:31:16] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:31:16] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:31:16] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:31:17] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:31:17] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:31:17] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:31:17] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:31:18] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:31:18] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:31:18] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:31:18] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:31:18] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:31:18] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:31:19] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:31:19] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:31:19] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:31:19] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:31:19] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:31:20] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:31:21] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:31:21] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:31:21] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:31:21] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:31:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:31:22] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:31:22] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:31:22] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:31:22] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:31:22] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:31:22] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:31:23] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 30251ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 30258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31132 ms. Remains : 562/562 places, 761/761 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-11 finished in 221778 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)||(X((p1 U X(p2)))&&!(!p1 U p3))))'
Support contains 5 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1322 transition count 1522
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1322 transition count 1522
Applied a total of 20 rules in 58 ms. Remains 1322 /1332 variables (removed 10) and now considering 1522/1532 (removed 10) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-06-01 19:31:23] [INFO ] Computed 161 invariants in 11 ms
[2024-06-01 19:31:23] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 19:31:23] [INFO ] Invariant cache hit.
[2024-06-01 19:31:24] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 19:31:24] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)timeout

(s1032 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1321 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
SMT process timed out in 30373ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 30400ms
Starting structural reductions in LTL mode, iteration 1 : 1322/1332 places, 1522/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31918 ms. Remains : 1322/1332 places, 1522/1532 transitions.
Stuttering acceptance computed with spot in 546 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), true, p3, (NOT p0), (NOT p2), (AND (NOT p0) p3), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 367 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-12 finished in 32505 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 U p1))))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1331 transition count 1371
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1171 transition count 1371
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 320 place count 1171 transition count 1171
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 720 place count 971 transition count 1171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 729 place count 962 transition count 1162
Iterating global reduction 2 with 9 rules applied. Total rules applied 738 place count 962 transition count 1162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 738 place count 962 transition count 1158
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 746 place count 958 transition count 1158
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 391
Deduced a syphon composed of 391 places in 1 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 1528 place count 567 transition count 767
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1530 place count 565 transition count 765
Applied a total of 1530 rules in 139 ms. Remains 565 /1332 variables (removed 767) and now considering 765/1532 (removed 767) transitions.
// Phase 1: matrix 765 rows 565 cols
[2024-06-01 19:31:55] [INFO ] Computed 161 invariants in 4 ms
[2024-06-01 19:31:56] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 19:31:56] [INFO ] Invariant cache hit.
[2024-06-01 19:31:56] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-06-01 19:31:56] [INFO ] Redundant transitions in 135 ms returned [764]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 761 sub problems to find dead transitions.
// Phase 1: matrix 764 rows 565 cols
[2024-06-01 19:31:56] [INFO ] Computed 161 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:32:03] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:32:04] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:05] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:06] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:32:07] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:08] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:09] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:32:10] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:10] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:10] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-06-01 19:32:10] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:32:10] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:10] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:17] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:18] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:19] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:32:19] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:19] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:19] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:19] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:19] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:20] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:21] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:21] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:21] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:21] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:32:21] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:21] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:22] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:32:22] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:22] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:32:22] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:32:22] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:22] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:32:23] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:32:23] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:23] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:32:23] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:32:24] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/1329 variables, and 275 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 155/161 constraints, State Equation: 0/565 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/563 variables, 120/275 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:27] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:27] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:32:27] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:28] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:32:29] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:32:29] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:29] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:32:29] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-06-01 19:32:30] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:30] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:30] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:30] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:32:30] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/563 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:30] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:31] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:32:31] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:32:31] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:32:31] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:32] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:32:33] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:34] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:32:34] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:32:35] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:36] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-06-01 19:32:37] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:32:37] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:37] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:32:37] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:38] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:38] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:32:38] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:32:40] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 4 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:46] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:32:47] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:47] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:32:47] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:32:47] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:48] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:32:48] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:32:48] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:32:48] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:32:51] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:51] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:51] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-06-01 19:32:51] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:32:54] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:32:54] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:54] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:32:54] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:32:54] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:32:55] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:32:56] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:32:56] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:32:56] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:32:56] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:32:56] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:32:57] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
SMT process timed out in 60247ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 565/1332 places, 764/1532 transitions.
Applied a total of 0 rules in 12 ms. Remains 565 /565 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61320 ms. Remains : 565/1332 places, 764/1532 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-13
Stuttering criterion allowed to conclude after 563 steps with 2 reset in 7 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-13 finished in 61433 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)||X(F(p1))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1322 transition count 1522
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1322 transition count 1522
Applied a total of 20 rules in 57 ms. Remains 1322 /1332 variables (removed 10) and now considering 1522/1532 (removed 10) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-06-01 19:32:57] [INFO ] Computed 161 invariants in 11 ms
[2024-06-01 19:32:57] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-06-01 19:32:57] [INFO ] Invariant cache hit.
[2024-06-01 19:32:58] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 19:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1321 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
SMT process timed out in 30380ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 30396ms
Starting structural reductions in LTL mode, iteration 1 : 1322/1332 places, 1522/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31912 ms. Remains : 1322/1332 places, 1522/1532 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-14
Stuttering criterion allowed to conclude after 2553 steps with 2 reset in 19 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-14 finished in 32082 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 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1331 transition count 1370
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1170 transition count 1370
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1170 transition count 1171
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 971 transition count 1171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 729 place count 962 transition count 1162
Iterating global reduction 2 with 9 rules applied. Total rules applied 738 place count 962 transition count 1162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 738 place count 962 transition count 1158
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 746 place count 958 transition count 1158
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1532 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1534 place count 563 transition count 763
Applied a total of 1534 rules in 121 ms. Remains 563 /1332 variables (removed 769) and now considering 763/1532 (removed 769) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-06-01 19:33:29] [INFO ] Computed 161 invariants in 3 ms
[2024-06-01 19:33:29] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 19:33:29] [INFO ] Invariant cache hit.
[2024-06-01 19:33:30] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-06-01 19:33:30] [INFO ] Redundant transitions in 130 ms returned [762]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 762 rows 563 cols
[2024-06-01 19:33:30] [INFO ] Computed 161 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:33:36] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:33:36] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:33:37] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:33:42] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:33:42] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:33:42] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:42] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:33:42] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:33:43] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 1 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:33:57] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:33:57] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:33:57] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:33:57] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
SMT process timed out in 30360ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 30372ms
Starting structural reductions in SI_LTL mode, iteration 1 : 563/1332 places, 762/1532 transitions.
Applied a total of 0 rules in 12 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31425 ms. Remains : 563/1332 places, 762/1532 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-15
Stuttering criterion allowed to conclude after 536 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-15 finished in 31486 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(p1)||(p2 U p3))))))'
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(p0)||(G(F(p2))&&p1))))'
Found a Shortening insensitive property : ShieldRVs-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1331 transition count 1370
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1170 transition count 1370
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1170 transition count 1170
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 970 transition count 1170
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 732 place count 960 transition count 1160
Iterating global reduction 2 with 10 rules applied. Total rules applied 742 place count 960 transition count 1160
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 742 place count 960 transition count 1156
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 750 place count 956 transition count 1156
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Deduced a syphon composed of 392 places in 0 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 1534 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1536 place count 562 transition count 762
Applied a total of 1536 rules in 140 ms. Remains 562 /1332 variables (removed 770) and now considering 762/1532 (removed 770) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:34:01] [INFO ] Computed 161 invariants in 4 ms
[2024-06-01 19:34:01] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 19:34:01] [INFO ] Invariant cache hit.
[2024-06-01 19:34:02] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 761 sub problems to find dead transitions.
[2024-06-01 19:34:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:34:13] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:34:14] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:34:14] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:34:14] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:34:14] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:34:15] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:34:15] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:34:15] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:34:15] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:34:15] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:34:15] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:34:16] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:34:16] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:34:16] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:34:16] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:34:16] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:34:16] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:34:17] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:34:17] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:34:17] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:34:17] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:34:24] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:34:25] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:34:25] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:34:25] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:34:25] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:34:25] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:34:25] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:34:26] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:34:26] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:34:26] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:34:26] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:34:26] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:34:26] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:34:27] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:34:27] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-06-01 19:34:27] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:34:27] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:34:27] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:34:28] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:34:28] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:34:28] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:34:28] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:34:28] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:34:29] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:34:29] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:34:29] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:34:29] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:34:29] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:34:29] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:34:30] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:34:30] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:34:30] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:34:30] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 761 unsolved
[2024-06-01 19:34:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:34:31] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:34:31] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:34:31] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:34:31] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:34:32] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:34:32] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:34:32] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:34:32] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:34:32] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
SMT process timed out in 30256ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 30263ms
Starting structural reductions in LI_LTL mode, iteration 1 : 562/1332 places, 762/1532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31152 ms. Remains : 562/1332 places, 762/1532 transitions.
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-11
Product exploration explored 100000 steps with 528 reset in 447 ms.
Product exploration explored 100000 steps with 532 reset in 558 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 126 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
RANDOM walk for 40000 steps (72 resets) in 1149 ms. (34 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
[2024-06-01 19:34:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/268 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 161/429 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/439 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 155/594 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/594 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/594 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/594 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 10/604 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/604 variables, 10/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/604 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 155/759 variables, 60/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/759 variables, 15/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/759 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/769 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 10/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/769 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 155/924 variables, 60/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/924 variables, 15/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:34:35] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:34:35] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/924 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/924 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 10/934 variables, 5/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/934 variables, 10/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/934 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 155/1089 variables, 60/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1089 variables, 15/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1089 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 10/1099 variables, 5/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1099 variables, 10/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1099 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 148/1247 variables, 60/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1247 variables, 15/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:36] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1247 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1247 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 10/1257 variables, 5/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1257 variables, 10/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1257 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 63/1320 variables, 38/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1320 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1320 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 2/1322 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1322 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1322 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 2/1324 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1324 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1324 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 0/1324 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 728 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/268 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 161/429 variables, 64/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:36] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:36] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/439 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:36] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/439 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/439 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 155/594 variables, 60/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/594 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/594 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/594 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/594 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 10/604 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/604 variables, 10/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/604 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 155/759 variables, 60/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/759 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/759 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/759 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 10/769 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/769 variables, 10/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/769 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 155/924 variables, 60/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/924 variables, 15/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/924 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:37] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:34:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/924 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/924 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 10/934 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/934 variables, 10/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/934 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 155/1089 variables, 60/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1089 variables, 15/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1089 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1089 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 10/1099 variables, 5/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1099 variables, 10/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1099 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 148/1247 variables, 60/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1247 variables, 15/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:37] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1247 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1247 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 10/1257 variables, 5/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1257 variables, 10/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1257 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 63/1320 variables, 38/721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1320 variables, 12/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:34:38] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:34:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:34:38] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:34:38] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1320 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1320 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 2/1322 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1322 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1322 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 2/1324 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1324 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1324 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 0/1324 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 743 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2348 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 4049ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 762
Applied a total of 80 rules in 27 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 562/562 places, 762/762 transitions.
RANDOM walk for 40000 steps (83 resets) in 622 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 160 ms. (248 steps per ms) remains 1/2 properties
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:34:39] [INFO ] Computed 161 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/268 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/429 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/439 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 155/594 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/594 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/594 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/604 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/604 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/604 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 155/759 variables, 60/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/759 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/769 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 10/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 155/924 variables, 60/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/924 variables, 15/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/924 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 10/934 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/934 variables, 10/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/934 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 155/1089 variables, 60/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1089 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1089 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 10/1099 variables, 5/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1099 variables, 10/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1099 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 148/1247 variables, 60/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1247 variables, 15/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1247 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/1257 variables, 5/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1257 variables, 10/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1257 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 63/1320 variables, 38/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1320 variables, 12/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1320 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/1322 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1322 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1322 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/1324 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1324 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1324 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/1324 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/92 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/260 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/268 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 161/429 variables, 64/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 16/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:34:39] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/439 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/439 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 155/594 variables, 60/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/594 variables, 15/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/594 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/604 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/604 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/604 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 155/759 variables, 60/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/759 variables, 15/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/759 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 10/769 variables, 5/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/769 variables, 10/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/769 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 155/924 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/924 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/924 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 10/934 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/934 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/934 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 155/1089 variables, 60/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1089 variables, 15/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1089 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/1099 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1099 variables, 10/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1099 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 148/1247 variables, 60/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1247 variables, 15/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:34:40] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/1247 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1247 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 10/1257 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1257 variables, 10/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1257 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 63/1320 variables, 38/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1320 variables, 12/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:34:40] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1320 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1320 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 2/1322 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1322 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1322 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/1324 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1324 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1324 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/1324 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 914 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 562/562 places, 762/762 transitions.
RANDOM walk for 40000 steps (84 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33271 steps (6 resets) in 103 ms. (319 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 520 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 495 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:34:42] [INFO ] Computed 161 invariants in 2 ms
[2024-06-01 19:34:42] [INFO ] [Real]Absence check using 161 positive place invariants in 42 ms returned sat
[2024-06-01 19:34:43] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-06-01 19:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:34:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 37 ms returned sat
[2024-06-01 19:34:44] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-06-01 19:34:44] [INFO ] Computed and/alt/rep : 684/2944/684 causal constraints (skipped 77 transitions) in 47 ms.
[2024-06-01 19:34:55] [INFO ] Added : 678 causal constraints over 136 iterations in 11016 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 19:34:55] [INFO ] Invariant cache hit.
[2024-06-01 19:34:55] [INFO ] [Real]Absence check using 161 positive place invariants in 41 ms returned sat
[2024-06-01 19:34:56] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-06-01 19:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:34:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2024-06-01 19:34:57] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-06-01 19:34:57] [INFO ] Computed and/alt/rep : 684/2944/684 causal constraints (skipped 77 transitions) in 39 ms.
[2024-06-01 19:35:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-06-01 19:35:07] [INFO ] Added : 633 causal constraints over 128 iterations in 10258 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-06-01 19:35:07] [INFO ] Invariant cache hit.
[2024-06-01 19:35:07] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 19:35:07] [INFO ] Invariant cache hit.
[2024-06-01 19:35:08] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-06-01 19:35:08] [INFO ] Redundant transitions in 118 ms returned [761]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:35:08] [INFO ] Computed 161 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:35:15] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:35:16] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:35:17] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:35:18] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:35:19] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:35:19] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:35:19] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:19] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:35:19] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:35:19] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:35:20] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:21] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:35:22] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:35:23] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:30] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:35:30] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:35:30] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:35:30] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:35:30] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:35:31] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:35:32] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:35:33] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:35:34] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:35:35] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:35:36] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:35:37] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:35:38] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:35:38] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:35:38] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 271 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 110/271 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:39] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:35:39] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:40] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:40] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:35:40] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:35:40] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:35:40] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:41] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:42] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:43] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:35:43] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:35:44] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:35:45] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:35:46] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/311 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:35:47] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:35:48] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:35:49] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:35:50] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:51] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:35:52] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:35:53] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:35:54] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:35:55] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:35:55] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:35:56] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:35:56] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:35:56] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:35:57] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:35:58] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:35:59] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:36:00] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:36:01] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:36:02] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:36:02] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:36:02] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:36:02] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:36:02] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:36:03] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:36:04] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:36:05] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:36:06] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:36:08] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1323 variables, and 412 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 251/251 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61175 ms. Remains : 562/562 places, 761/762 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 131 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 498 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
RANDOM walk for 40000 steps (72 resets) in 806 ms. (49 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
[2024-06-01 19:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/267 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 161/428 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/438 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 155/593 variables, 60/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/593 variables, 15/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 10/603 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/603 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/603 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 155/758 variables, 60/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/758 variables, 15/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:10] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:36:10] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/758 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/758 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/768 variables, 5/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/768 variables, 10/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/768 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 155/923 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:10] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 10/933 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/933 variables, 10/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/933 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 155/1088 variables, 60/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1088 variables, 15/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:10] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:36:10] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:36:10] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1088 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1088 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 10/1098 variables, 5/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1098 variables, 10/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1098 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 148/1246 variables, 60/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1246 variables, 15/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:11] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1246 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1246 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 10/1256 variables, 5/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1256 variables, 10/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1256 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 63/1319 variables, 38/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1319 variables, 12/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:11] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1319 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1319 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 2/1321 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1321 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:11] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1321 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1321 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 2/1323 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1323 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1323 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 0/1323 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 732 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/267 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 161/428 variables, 64/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 16/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/438 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 155/593 variables, 60/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 15/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/593 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 10/603 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/603 variables, 10/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/603 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 155/758 variables, 60/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/758 variables, 15/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/758 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:36:12] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/758 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/758 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 10/768 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/768 variables, 10/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/768 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 155/923 variables, 60/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/923 variables, 15/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/923 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/923 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 10/933 variables, 5/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/933 variables, 10/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/933 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 155/1088 variables, 60/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1088 variables, 15/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1088 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:13] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1088 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1088 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 10/1098 variables, 5/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1098 variables, 10/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1098 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 148/1246 variables, 60/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1246 variables, 15/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1246 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1246 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 10/1256 variables, 5/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1256 variables, 10/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1256 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 63/1319 variables, 38/728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1319 variables, 12/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1319 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:13] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1319 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1319 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 2/1321 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1321 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/1321 variables, 3/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1321 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 2/1323 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1323 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1323 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 0/1323 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 752 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2608 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 4752ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 761
Applied a total of 80 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 562/562 places, 761/761 transitions.
RANDOM walk for 40000 steps (83 resets) in 823 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:36:14] [INFO ] Computed 161 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:14] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/267 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 161/428 variables, 64/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 16/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/438 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:15] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 155/593 variables, 60/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/593 variables, 15/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/593 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 10/603 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/603 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/603 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 155/758 variables, 60/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/758 variables, 15/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/758 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 10/768 variables, 5/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/768 variables, 10/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/768 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 155/923 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 10/933 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/933 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/933 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 155/1088 variables, 60/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1088 variables, 15/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1088 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 10/1098 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1098 variables, 10/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1098 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 148/1246 variables, 60/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1246 variables, 15/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:15] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:36:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 45 (INCLUDED_ONLY) 0/1246 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1246 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 10/1256 variables, 5/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1256 variables, 10/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1256 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 63/1319 variables, 38/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1319 variables, 12/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1319 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 2/1321 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1321 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1321 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 2/1323 variables, 2/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1323 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1323 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 0/1323 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 727 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/91 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/259 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/267 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 161/428 variables, 64/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 16/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/438 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 155/593 variables, 60/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/593 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/593 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/593 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 10/603 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/603 variables, 10/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/603 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/603 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 155/758 variables, 60/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/758 variables, 15/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/758 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/758 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:16] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/758 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/758 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 10/768 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/768 variables, 10/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/768 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 155/923 variables, 60/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/923 variables, 15/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/923 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 10/933 variables, 5/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/933 variables, 10/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/933 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 155/1088 variables, 60/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1088 variables, 15/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1088 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 10/1098 variables, 5/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1098 variables, 10/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1098 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 148/1246 variables, 60/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1246 variables, 15/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/1246 variables, 3/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1246 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 10/1256 variables, 5/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1256 variables, 10/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1256 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 63/1319 variables, 38/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1319 variables, 12/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:36:17] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:36:18] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/1319 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1319 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/1321 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1321 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1321 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 2/1323 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1323 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1323 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 0/1323 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 746 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
After SMT, in 3488ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1095 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 16 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 562/562 places, 761/761 transitions.
RANDOM walk for 40000 steps (83 resets) in 674 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/2 properties
BEST_FIRST walk for 29689 steps (5 resets) in 94 ms. (312 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 24 factoid took 509 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 406 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 761 rows 562 cols
[2024-06-01 19:36:21] [INFO ] Computed 161 invariants in 3 ms
[2024-06-01 19:36:21] [INFO ] [Real]Absence check using 161 positive place invariants in 38 ms returned sat
[2024-06-01 19:36:21] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2024-06-01 19:36:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:36:22] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2024-06-01 19:36:22] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-06-01 19:36:22] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 41 ms.
[2024-06-01 19:36:33] [INFO ] Added : 680 causal constraints over 136 iterations in 10458 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-06-01 19:36:33] [INFO ] Invariant cache hit.
[2024-06-01 19:36:33] [INFO ] [Real]Absence check using 161 positive place invariants in 46 ms returned sat
[2024-06-01 19:36:34] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2024-06-01 19:36:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:36:34] [INFO ] [Nat]Absence check using 161 positive place invariants in 40 ms returned sat
[2024-06-01 19:36:34] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2024-06-01 19:36:35] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 36 ms.
[2024-06-01 19:36:44] [INFO ] Added : 613 causal constraints over 123 iterations in 9759 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 440 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 529 reset in 433 ms.
Product exploration explored 100000 steps with 529 reset in 515 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 12 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-06-01 19:36:46] [INFO ] Invariant cache hit.
[2024-06-01 19:36:46] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 19:36:46] [INFO ] Invariant cache hit.
[2024-06-01 19:36:46] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-06-01 19:36:47] [INFO ] Redundant transitions in 124 ms returned []
Running 760 sub problems to find dead transitions.
[2024-06-01 19:36:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:36:53] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:36:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:36:55] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:36:56] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:36:56] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:36:56] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:36:56] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:36:56] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:36:56] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:36:57] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:36:57] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:36:57] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:36:57] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:36:57] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:36:57] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:36:58] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:36:58] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:36:58] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:36:58] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:36:58] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:36:58] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:36:59] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:37:00] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:37:01] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:37:02] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:37:09] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:37:09] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:37:09] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:37:09] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:37:09] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:37:10] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:37:11] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:37:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:37:11] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:37:11] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:37:11] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:37:11] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:37:12] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:37:12] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:37:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:37:12] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:37:13] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:37:13] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:37:13] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:37:13] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:37:13] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:37:13] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:37:14] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:37:14] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:37:14] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:37:14] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:37:14] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:37:14] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:37:15] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:37:15] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:37:15] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:37:15] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:37:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:37:16] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:37:16] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:37:16] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:37:16] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:37:16] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:37:16] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:37:17] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:37:17] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
SMT process timed out in 30267ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 30277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31182 ms. Remains : 562/562 places, 761/761 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-11 finished in 196096 ms.
[2024-06-01 19:37:17] [INFO ] Flatten gal took : 64 ms
[2024-06-01 19:37:17] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 19:37:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1332 places, 1532 transitions and 5218 arcs took 11 ms.
Total runtime 1217172 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-01
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-05
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-06
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-09
Could not compute solution for formula : ShieldRVs-PT-040B-LTLFireability-11

BK_STOP 1717272995187

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVs-PT-040B-LTLFireability-01
ltl formula formula --ltl=/tmp/9682/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 1332 places, 1532 transitions and 5218 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.160 real 0.070 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9682/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9682/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9682/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9682/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1333 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1333, there are 1538 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): ~1799 levels ~10000 states ~94104 transitions
pnml2lts-mc( 0/ 4): ~1799 levels ~20000 states ~136976 transitions
pnml2lts-mc( 0/ 4): ~1830 levels ~40000 states ~230916 transitions
pnml2lts-mc( 0/ 4): ~1830 levels ~80000 states ~436200 transitions
pnml2lts-mc( 0/ 4): ~1838 levels ~160000 states ~859832 transitions
pnml2lts-mc( 1/ 4): ~1744 levels ~320000 states ~1985704 transitions
pnml2lts-mc( 1/ 4): ~1755 levels ~640000 states ~3953464 transitions
pnml2lts-mc( 1/ 4): ~1755 levels ~1280000 states ~8520320 transitions
pnml2lts-mc( 1/ 4): ~1755 levels ~2560000 states ~18276284 transitions
pnml2lts-mc( 1/ 4): ~1755 levels ~5120000 states ~38457104 transitions
ltl formula name ShieldRVs-PT-040B-LTLFireability-05
ltl formula formula --ltl=/tmp/9682/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1332 places, 1532 transitions and 5218 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9682/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9682/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.050 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9682/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9682/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1333 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1333, there are 1583 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( 3/ 4): ~1666 levels ~10000 states ~98820 transitions
pnml2lts-mc( 3/ 4): ~1666 levels ~20000 states ~147080 transitions
pnml2lts-mc( 3/ 4): ~1666 levels ~40000 states ~263632 transitions
pnml2lts-mc( 2/ 4): ~1742 levels ~80000 states ~453856 transitions
pnml2lts-mc( 2/ 4): ~1745 levels ~160000 states ~910340 transitions
pnml2lts-mc( 2/ 4): ~1745 levels ~320000 states ~1921380 transitions
pnml2lts-mc( 2/ 4): ~1745 levels ~640000 states ~4164704 transitions
pnml2lts-mc( 2/ 4): ~1749 levels ~1280000 states ~8746664 transitions
pnml2lts-mc( 2/ 4): ~1749 levels ~2560000 states ~18612084 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3969293
pnml2lts-mc( 0/ 4): unique states count: 3976107
pnml2lts-mc( 0/ 4): unique transitions count: 34954291
pnml2lts-mc( 0/ 4): - self-loop count: 105
pnml2lts-mc( 0/ 4): - claim dead count: 30881992
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3976122
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6910
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3976122 states 34954326 transitions, fanout: 8.791
pnml2lts-mc( 0/ 4): Total exploration time 247.970 sec (247.960 sec minimum, 247.967 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16035, Transitions per second: 140962
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 95.1MB, 24.5 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1562 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 95.1MB (~256.0MB paged-in)
ltl formula name ShieldRVs-PT-040B-LTLFireability-06
ltl formula formula --ltl=/tmp/9682/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1332 places, 1532 transitions and 5218 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.160 real 0.060 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9682/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9682/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9682/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9682/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1334 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1333, there are 1535 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): ~1679 levels ~10000 states ~77400 transitions
pnml2lts-mc( 0/ 4): ~1689 levels ~20000 states ~121024 transitions
pnml2lts-mc( 0/ 4): ~1689 levels ~40000 states ~223556 transitions
pnml2lts-mc( 0/ 4): ~1689 levels ~80000 states ~438148 transitions
pnml2lts-mc( 0/ 4): ~1689 levels ~160000 states ~864256 transitions
pnml2lts-mc( 3/ 4): ~1728 levels ~320000 states ~1852860 transitions
pnml2lts-mc( 3/ 4): ~1728 levels ~640000 states ~3918516 transitions
pnml2lts-mc( 0/ 4): ~1691 levels ~1280000 states ~7584556 transitions
pnml2lts-mc( 0/ 4): ~1691 levels ~2560000 states ~15589124 transitions
pnml2lts-mc( 0/ 4): ~1699 levels ~5120000 states ~30841404 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5307201
pnml2lts-mc( 0/ 4): unique states count: 5314217
pnml2lts-mc( 0/ 4): unique transitions count: 38136971
pnml2lts-mc( 0/ 4): - self-loop count: 90
pnml2lts-mc( 0/ 4): - claim dead count: 32738493
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5314226
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7095
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5314226 states 38136986 transitions, fanout: 7.176
pnml2lts-mc( 0/ 4): Total exploration time 325.870 sec (325.850 sec minimum, 325.855 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16308, Transitions per second: 117031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 105.2MB, 20.4 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1562 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 105.2MB (~256.0MB paged-in)
ltl formula name ShieldRVs-PT-040B-LTLFireability-09
ltl formula formula --ltl=/tmp/9682/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1332 places, 1532 transitions and 5218 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.060 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9682/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9682/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9682/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9682/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1333 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1333, there are 1550 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1757 levels ~10000 states ~111632 transitions
pnml2lts-mc( 1/ 4): ~1772 levels ~20000 states ~158416 transitions
pnml2lts-mc( 1/ 4): ~1772 levels ~40000 states ~249028 transitions
pnml2lts-mc( 1/ 4): ~1772 levels ~80000 states ~468808 transitions
pnml2lts-mc( 3/ 4): ~1783 levels ~160000 states ~552328 transitions
pnml2lts-mc( 1/ 4): ~1778 levels ~320000 states ~1718760 transitions
pnml2lts-mc( 1/ 4): ~1782 levels ~640000 states ~3727740 transitions
pnml2lts-mc( 3/ 4): ~1788 levels ~1280000 states ~4529372 transitions
pnml2lts-mc( 3/ 4): ~1788 levels ~2560000 states ~9768360 transitions
pnml2lts-mc( 3/ 4): ~1789 levels ~5120000 states ~19773928 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5827190
pnml2lts-mc( 0/ 4): unique states count: 5834194
pnml2lts-mc( 0/ 4): unique transitions count: 35739856
pnml2lts-mc( 0/ 4): - self-loop count: 57
pnml2lts-mc( 0/ 4): - claim dead count: 29795735
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5834203
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7095
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5834203 states 35739874 transitions, fanout: 6.126
pnml2lts-mc( 0/ 4): Total exploration time 352.500 sec (352.490 sec minimum, 352.492 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16551, Transitions per second: 101390
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 109.3MB, 19.3 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1562 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 109.3MB (~256.0MB paged-in)
ltl formula name ShieldRVs-PT-040B-LTLFireability-11
ltl formula formula --ltl=/tmp/9682/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1332 places, 1532 transitions and 5218 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.140 real 0.060 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9682/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9682/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9682/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9682/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1334 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1333, there are 1591 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~998 levels ~10000 states ~175744 transitions
pnml2lts-mc( 1/ 4): ~999 levels ~20000 states ~231072 transitions
pnml2lts-mc( 1/ 4): ~999 levels ~40000 states ~339448 transitions
pnml2lts-mc( 1/ 4): ~999 levels ~80000 states ~588416 transitions
pnml2lts-mc( 1/ 4): ~1009 levels ~160000 states ~1091640 transitions
pnml2lts-mc( 1/ 4): ~1009 levels ~320000 states ~2202952 transitions
pnml2lts-mc( 1/ 4): ~1036 levels ~640000 states ~4303568 transitions
pnml2lts-mc( 1/ 4): ~1051 levels ~1280000 states ~10508984 transitions
pnml2lts-mc( 1/ 4): ~1051 levels ~2560000 states ~24851104 transitions
pnml2lts-mc( 1/ 4): ~1055 levels ~5120000 states ~52666208 transitions
pnml2lts-mc( 2/ 4): ~1063 levels ~10240000 states ~87575472 transitions

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="ShieldRVs-PT-040B"
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 ShieldRVs-PT-040B, 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 r528-tall-171683762000844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B 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 ;