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.r508-tall-171654352000628.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 NoC3x3-PT-5B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352000628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K 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 NoC3x3-PT-5B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717242575223

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:49:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:49:36] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-01 11:49:36] [INFO ] Transformed 1571 places.
[2024-06-01 11:49:36] [INFO ] Transformed 2173 transitions.
[2024-06-01 11:49:36] [INFO ] Found NUPN structural information;
[2024-06-01 11:49:36] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-5B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 438 places :
Symmetric choice reduction at 0 with 438 rule applications. Total rules 438 place count 1133 transition count 1735
Iterating global reduction 0 with 438 rules applied. Total rules applied 876 place count 1133 transition count 1735
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 994 place count 1015 transition count 1609
Iterating global reduction 0 with 118 rules applied. Total rules applied 1112 place count 1015 transition count 1609
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 1205 place count 922 transition count 1451
Iterating global reduction 0 with 93 rules applied. Total rules applied 1298 place count 922 transition count 1451
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1322 place count 898 transition count 1403
Iterating global reduction 0 with 24 rules applied. Total rules applied 1346 place count 898 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1353 place count 891 transition count 1389
Iterating global reduction 0 with 7 rules applied. Total rules applied 1360 place count 891 transition count 1389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1367 place count 884 transition count 1382
Iterating global reduction 0 with 7 rules applied. Total rules applied 1374 place count 884 transition count 1382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1377 place count 881 transition count 1376
Iterating global reduction 0 with 3 rules applied. Total rules applied 1380 place count 881 transition count 1376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1382 place count 879 transition count 1370
Iterating global reduction 0 with 2 rules applied. Total rules applied 1384 place count 879 transition count 1370
Applied a total of 1384 rules in 418 ms. Remains 879 /1571 variables (removed 692) and now considering 1370/2173 (removed 803) transitions.
// Phase 1: matrix 1370 rows 879 cols
[2024-06-01 11:49:37] [INFO ] Computed 66 invariants in 31 ms
[2024-06-01 11:49:37] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-06-01 11:49:37] [INFO ] Invariant cache hit.
[2024-06-01 11:49:38] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
Running 1369 sub problems to find dead transitions.
[2024-06-01 11:49:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1369 unsolved
SMT process timed out in 30530ms, After SMT, problems are : Problem set: 0 solved, 1369 unsolved
Search for dead transitions found 0 dead transitions in 30557ms
Starting structural reductions in LTL mode, iteration 1 : 879/1571 places, 1370/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32473 ms. Remains : 879/1571 places, 1370/2173 transitions.
Support contains 34 out of 879 places after structural reductions.
[2024-06-01 11:50:09] [INFO ] Flatten gal took : 223 ms
[2024-06-01 11:50:10] [INFO ] Flatten gal took : 93 ms
[2024-06-01 11:50:10] [INFO ] Input system was already deterministic with 1370 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (58 resets) in 2317 ms. (17 steps per ms) remains 6/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
[2024-06-01 11:50:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 216/229 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 650/879 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1370/2249 variables, 879/945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2249 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/2249 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 945 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 879/879 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 216/229 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 11:50:13] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 650/879 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 11:50:14] [INFO ] Deduced a trap composed of 42 places in 910 ms of which 10 ms to minimize.
[2024-06-01 11:50:15] [INFO ] Deduced a trap composed of 65 places in 491 ms of which 26 ms to minimize.
[2024-06-01 11:50:15] [INFO ] Deduced a trap composed of 94 places in 547 ms of which 4 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 3 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 4 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 3 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 81 places in 194 ms of which 3 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:50:17] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 11:50:17] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1370/2249 variables, 879/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2249 variables, 6/963 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2249 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 963 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 879/879 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 6511ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 879 transition count 1310
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 819 transition count 1310
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 120 place count 819 transition count 1276
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 188 place count 785 transition count 1276
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 214 place count 759 transition count 1184
Iterating global reduction 2 with 26 rules applied. Total rules applied 240 place count 759 transition count 1184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 240 place count 759 transition count 1183
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 758 transition count 1183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 756 transition count 1174
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 756 transition count 1174
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 634 place count 562 transition count 980
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 638 place count 562 transition count 976
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 840 place count 461 transition count 1004
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 854 place count 461 transition count 990
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 922 place count 427 transition count 998
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 984 place count 427 transition count 936
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 993 place count 418 transition count 936
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 993 place count 418 transition count 931
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1003 place count 413 transition count 931
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1037 place count 396 transition count 914
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1041 place count 394 transition count 915
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1043 place count 394 transition count 913
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1045 place count 392 transition count 913
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1050 place count 392 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1051 place count 391 transition count 912
Applied a total of 1051 rules in 326 ms. Remains 391 /879 variables (removed 488) and now considering 912/1370 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 391/879 places, 912/1370 transitions.
RANDOM walk for 40000 steps (190 resets) in 1345 ms. (29 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
// Phase 1: matrix 912 rows 391 cols
[2024-06-01 11:50:18] [INFO ] Computed 57 invariants in 17 ms
[2024-06-01 11:50:18] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/189 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 487/676 variables, 189/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 22/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/911 variables, 43/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/943 variables, 10/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/943 variables, 26/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/943 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 166/1109 variables, 48/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1109 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1109 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1109 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/1129 variables, 8/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1129 variables, 17/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1129 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 120/1249 variables, 32/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1249 variables, 5/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1249 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 19/1268 variables, 7/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1268 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1268 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 30/1298 variables, 14/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1298 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1298 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 5/1303 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1303 variables, 5/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1303 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1303 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 391/391 constraints, ReadFeed: 35/35 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/189 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 487/676 variables, 189/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 22/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/911 variables, 43/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/911 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/943 variables, 10/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/943 variables, 26/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/943 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 166/1109 variables, 48/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1109 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1109 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1109 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/1129 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1129 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1129 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 120/1249 variables, 32/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1249 variables, 5/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1249 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 19/1268 variables, 7/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1268 variables, 17/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1268 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 30/1298 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1298 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1298 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/1303 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1303 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1303 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/1303 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 391/391 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1115ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 912/912 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 391 transition count 910
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 389 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 388 transition count 906
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 388 transition count 906
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 386 transition count 904
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 386 transition count 903
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 385 transition count 898
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 385 transition count 898
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 385 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 384 transition count 897
Applied a total of 15 rules in 61 ms. Remains 384 /391 variables (removed 7) and now considering 897/912 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 384/391 places, 897/912 transitions.
RANDOM walk for 40000 steps (195 resets) in 356 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 472828 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 472828 steps, saw 106412 distinct states, run finished after 3007 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 897 rows 384 cols
[2024-06-01 11:50:23] [INFO ] Computed 57 invariants in 5 ms
[2024-06-01 11:50:23] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/185 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/665 variables, 185/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 22/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 228/893 variables, 42/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/923 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/923 variables, 26/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/923 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 164/1087 variables, 46/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1087 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1087 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1087 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/1107 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1107 variables, 17/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1107 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 120/1227 variables, 32/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1227 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1227 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 19/1246 variables, 7/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1246 variables, 17/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1246 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 30/1276 variables, 14/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1276 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1276 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 5/1281 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1281 variables, 5/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1281 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1281 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1281/1281 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 35/35 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/185 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 480/665 variables, 185/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 22/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 228/893 variables, 42/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/893 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/923 variables, 10/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/923 variables, 26/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/923 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 164/1087 variables, 46/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1087 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1087 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1087 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/1107 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1107 variables, 17/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1107 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 120/1227 variables, 32/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1227 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1227 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 19/1246 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1246 variables, 17/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1246 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 30/1276 variables, 14/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1276 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1276 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/1281 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1281 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1281 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/1281 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1230ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 897/897 transitions.
Applied a total of 0 rules in 10 ms. Remains 384 /384 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 384/384 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 897/897 transitions.
Applied a total of 0 rules in 11 ms. Remains 384 /384 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2024-06-01 11:50:24] [INFO ] Invariant cache hit.
[2024-06-01 11:50:25] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 11:50:25] [INFO ] Invariant cache hit.
[2024-06-01 11:50:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 11:50:25] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2024-06-01 11:50:25] [INFO ] Redundant transitions in 44 ms returned []
Running 869 sub problems to find dead transitions.
[2024-06-01 11:50:25] [INFO ] Invariant cache hit.
[2024-06-01 11:50:25] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-06-01 11:50:34] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-06-01 11:50:40] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 4 (OVERLAPS) 1/384 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-06-01 11:50:54] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:50:55] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:50:55] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:50:55] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:50:56] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1281 variables, and 64 constraints, problems are : Problem set: 0 solved, 869 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 869/869 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 3 (OVERLAPS) 1/384 variables, 26/63 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-06-01 11:51:04] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-06-01 11:51:04] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:51:05] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:51:05] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:51:05] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2024-06-01 11:51:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:51:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:51:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:51:08] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:51:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-06-01 11:51:10] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 8 (OVERLAPS) 897/1281 variables, 384/459 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 35/494 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1281 variables, 869/1363 constraints. Problems are: Problem set: 0 solved, 869 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 1363 constraints, problems are : Problem set: 0 solved, 869 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 869/869 constraints, Known Traps: 18/18 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 869 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61753 ms. Remains : 384/384 places, 897/897 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 384 transition count 874
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 25 place count 382 transition count 868
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 382 transition count 868
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 382 transition count 868
Applied a total of 29 rules in 31 ms. Remains 382 /384 variables (removed 2) and now considering 868/897 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 868 rows 382 cols
[2024-06-01 11:51:26] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:51:26] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 11:51:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 36 ms returned sat
[2024-06-01 11:51:26] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 11:51:27] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 11:51:27] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 710 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))&&p0))))'
Support contains 5 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 872 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 872 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 871 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 871 transition count 1357
Applied a total of 16 rules in 94 ms. Remains 871 /879 variables (removed 8) and now considering 1357/1370 (removed 13) transitions.
// Phase 1: matrix 1357 rows 871 cols
[2024-06-01 11:51:27] [INFO ] Computed 66 invariants in 10 ms
[2024-06-01 11:51:28] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 11:51:28] [INFO ] Invariant cache hit.
[2024-06-01 11:51:28] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 11:51:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/870 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
SMT process timed out in 30309ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 30335ms
Starting structural reductions in LTL mode, iteration 1 : 871/879 places, 1357/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31611 ms. Remains : 871/879 places, 1357/1370 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-00
Stuttering criterion allowed to conclude after 651 steps with 1 reset in 13 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-00 finished in 32077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 222 place count 752 transition count 1173
Iterating global reduction 2 with 30 rules applied. Total rules applied 252 place count 752 transition count 1173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 252 place count 752 transition count 1171
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 750 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 260 place count 746 transition count 1157
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 746 transition count 1157
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 654 place count 551 transition count 962
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 658 place count 551 transition count 958
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 860 place count 450 transition count 985
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 874 place count 450 transition count 971
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 944 place count 415 transition count 979
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 1004 place count 415 transition count 919
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1013 place count 406 transition count 919
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1013 place count 406 transition count 914
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1023 place count 401 transition count 914
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1061 place count 382 transition count 895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1062 place count 381 transition count 894
Applied a total of 1062 rules in 340 ms. Remains 381 /879 variables (removed 498) and now considering 894/1370 (removed 476) transitions.
// Phase 1: matrix 894 rows 381 cols
[2024-06-01 11:51:59] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:52:00] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 11:52:00] [INFO ] Invariant cache hit.
[2024-06-01 11:52:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:52:00] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-06-01 11:52:00] [INFO ] Redundant transitions in 20 ms returned []
Running 839 sub problems to find dead transitions.
[2024-06-01 11:52:00] [INFO ] Invariant cache hit.
[2024-06-01 11:52:00] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:52:06] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:52:07] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2024-06-01 11:52:07] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:52:07] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-06-01 11:52:08] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
[2024-06-01 11:52:08] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:52:08] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-06-01 11:52:08] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:52:08] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:52:09] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:52:10] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:52:11] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-06-01 11:52:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:52:11] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:52:20] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1275 variables, and 73 constraints, problems are : Problem set: 0 solved, 839 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/381 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:52:33] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 4 (OVERLAPS) 894/1275 variables, 381/455 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1275 variables, 31/486 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1275 variables, 839/1325 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 1325 constraints, problems are : Problem set: 0 solved, 839 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 381/381 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 17/17 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 839 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Starting structural reductions in SI_LTL mode, iteration 1 : 381/879 places, 894/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61602 ms. Remains : 381/879 places, 894/1370 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-01
Stuttering criterion allowed to conclude after 413 steps with 2 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-01 finished in 61681 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 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 222 place count 752 transition count 1173
Iterating global reduction 2 with 30 rules applied. Total rules applied 252 place count 752 transition count 1173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 252 place count 752 transition count 1171
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 750 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 260 place count 746 transition count 1157
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 746 transition count 1157
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 650 place count 553 transition count 964
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 654 place count 553 transition count 960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 856 place count 452 transition count 988
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 870 place count 452 transition count 974
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 942 place count 416 transition count 982
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1004 place count 416 transition count 920
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1013 place count 407 transition count 920
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1013 place count 407 transition count 915
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1023 place count 402 transition count 915
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1061 place count 383 transition count 896
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1062 place count 382 transition count 895
Applied a total of 1062 rules in 170 ms. Remains 382 /879 variables (removed 497) and now considering 895/1370 (removed 475) transitions.
// Phase 1: matrix 895 rows 382 cols
[2024-06-01 11:53:01] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:53:01] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-06-01 11:53:01] [INFO ] Invariant cache hit.
[2024-06-01 11:53:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:53:02] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2024-06-01 11:53:02] [INFO ] Redundant transitions in 12 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-01 11:53:02] [INFO ] Invariant cache hit.
[2024-06-01 11:53:02] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:53:10] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-06-01 11:53:10] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:53:10] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-01 11:53:11] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:53:17] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:53:22] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:53:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:53:24] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1277 variables, and 41 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 33/57 constraints, State Equation: 0/382 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (OVERLAPS) 1/382 variables, 24/65 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 3 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 1 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 4 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2024-06-01 11:53:41] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:53:42] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:53:42] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:53:43] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:53:43] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2024-06-01 11:53:43] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2024-06-01 11:53:43] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-01 11:53:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:53:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:53:48] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2024-06-01 11:53:48] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-01 11:53:49] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:53:57] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:53:57] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:54:01] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1277 variables, and 90 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/382 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/861 constraints, Known Traps: 33/33 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in SI_LTL mode, iteration 1 : 382/879 places, 895/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61354 ms. Remains : 382/879 places, 895/1370 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-03
Product exploration explored 100000 steps with 481 reset in 450 ms.
Stack based approach found an accepted trace after 30443 steps with 141 reset with depth 287 and stack size 287 in 143 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-03 finished in 61997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 220 place count 754 transition count 1175
Iterating global reduction 2 with 28 rules applied. Total rules applied 248 place count 754 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 248 place count 754 transition count 1174
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 753 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 253 place count 750 transition count 1163
Iterating global reduction 2 with 3 rules applied. Total rules applied 256 place count 750 transition count 1163
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 648 place count 554 transition count 967
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 652 place count 554 transition count 963
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 854 place count 453 transition count 992
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 868 place count 453 transition count 978
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 940 place count 417 transition count 986
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1002 place count 417 transition count 924
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1011 place count 408 transition count 924
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1011 place count 408 transition count 919
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1021 place count 403 transition count 919
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1057 place count 385 transition count 901
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1059 place count 384 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1060 place count 383 transition count 901
Applied a total of 1060 rules in 208 ms. Remains 383 /879 variables (removed 496) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 383 cols
[2024-06-01 11:54:03] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:54:03] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 11:54:03] [INFO ] Invariant cache hit.
[2024-06-01 11:54:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:54:04] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2024-06-01 11:54:04] [INFO ] Redundant transitions in 9 ms returned []
Running 846 sub problems to find dead transitions.
[2024-06-01 11:54:04] [INFO ] Invariant cache hit.
[2024-06-01 11:54:04] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:54:10] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:54:10] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-06-01 11:54:10] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-06-01 11:54:10] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2024-06-01 11:54:11] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-01 11:54:11] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:54:11] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-01 11:54:11] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:54:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:54:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:54:14] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:54:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-06-01 11:54:20] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:54:24] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-06-01 11:54:25] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:54:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1284 variables, and 77 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-06-01 11:54:40] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 5 (OVERLAPS) 901/1284 variables, 383/471 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1284 variables, 31/502 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1284 variables, 846/1348 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1284/1284 variables, and 1348 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 31/31 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 383/879 places, 901/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61396 ms. Remains : 383/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-04
Product exploration explored 100000 steps with 486 reset in 378 ms.
Product exploration explored 100000 steps with 488 reset in 421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
RANDOM walk for 679 steps (1 resets) in 9 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 99 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 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 1 out of 383 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 901/901 transitions.
Applied a total of 0 rules in 10 ms. Remains 383 /383 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2024-06-01 11:55:06] [INFO ] Invariant cache hit.
[2024-06-01 11:55:06] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-06-01 11:55:06] [INFO ] Invariant cache hit.
[2024-06-01 11:55:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:55:06] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-06-01 11:55:06] [INFO ] Redundant transitions in 12 ms returned []
Running 846 sub problems to find dead transitions.
[2024-06-01 11:55:06] [INFO ] Invariant cache hit.
[2024-06-01 11:55:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:55:12] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:55:12] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:55:13] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:55:13] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-06-01 11:55:14] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:55:14] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2024-06-01 11:55:14] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-01 11:55:14] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:16] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-06-01 11:55:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:55:17] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:55:17] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:55:19] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-06-01 11:55:23] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:55:27] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2024-06-01 11:55:30] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1284 variables, and 77 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
[2024-06-01 11:55:40] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 11:55:40] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 11:55:45] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 5 (OVERLAPS) 901/1284 variables, 383/471 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1284 variables, 31/502 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1284 variables, 846/1348 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1284/1284 variables, and 1348 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 31/31 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61283 ms. Remains : 383/383 places, 901/901 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 32 ms :[(NOT p1)]
RANDOM walk for 5046 steps (23 resets) in 45 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 103 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 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 491 reset in 382 ms.
Product exploration explored 100000 steps with 486 reset in 429 ms.
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 901/901 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 900
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 382 transition count 899
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 381 transition count 894
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 381 transition count 894
Applied a total of 5 rules in 25 ms. Remains 381 /383 variables (removed 2) and now considering 894/901 (removed 7) transitions.
// Phase 1: matrix 894 rows 381 cols
[2024-06-01 11:56:08] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:56:08] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 11:56:08] [INFO ] Invariant cache hit.
[2024-06-01 11:56:09] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:56:09] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-06-01 11:56:09] [INFO ] Redundant transitions in 11 ms returned []
Running 839 sub problems to find dead transitions.
[2024-06-01 11:56:09] [INFO ] Invariant cache hit.
[2024-06-01 11:56:09] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 15 ms to minimize.
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:56:16] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:56:16] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 11:56:16] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:56:16] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-06-01 11:56:16] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-06-01 11:56:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:56:17] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:56:17] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:56:18] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 4 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:56:22] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 1 ms to minimize.
[2024-06-01 11:56:24] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:56:24] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 2 ms to minimize.
[2024-06-01 11:56:24] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-06-01 11:56:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:56:25] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 1 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:56:27] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2024-06-01 11:56:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:56:31] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:56:31] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:56:31] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 1 ms to minimize.
[2024-06-01 11:56:32] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:56:32] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:56:32] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 1 ms to minimize.
[2024-06-01 11:56:32] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:56:32] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 69 places in 119 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1275 variables, and 105 constraints, problems are : Problem set: 0 solved, 839 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/381 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 839 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:56:42] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 1 ms to minimize.
[2024-06-01 11:56:42] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-06-01 11:56:42] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
[2024-06-01 11:56:42] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-06-01 11:56:48] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 5 (OVERLAPS) 894/1275 variables, 381/495 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1275 variables, 31/526 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1275 variables, 839/1365 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 1365 constraints, problems are : Problem set: 0 solved, 839 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 381/381 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 57/57 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 839 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 381/383 places, 894/901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61148 ms. Remains : 381/383 places, 894/901 transitions.
Treatment of property NoC3x3-PT-5B-LTLFireability-04 finished in 186523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X((F(p1)||G(p0))))))))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 71 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-06-01 11:57:09] [INFO ] Computed 66 invariants in 5 ms
[2024-06-01 11:57:10] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 11:57:10] [INFO ] Invariant cache hit.
[2024-06-01 11:57:11] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-06-01 11:57:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30331ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31882 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-05
Stuttering criterion allowed to conclude after 2608 steps with 3 reset in 13 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-05 finished in 32139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 870 transition count 1356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 870 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 868 transition count 1351
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 868 transition count 1351
Applied a total of 22 rules in 34 ms. Remains 868 /879 variables (removed 11) and now considering 1351/1370 (removed 19) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2024-06-01 11:57:42] [INFO ] Computed 66 invariants in 5 ms
[2024-06-01 11:57:42] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 11:57:42] [INFO ] Invariant cache hit.
[2024-06-01 11:57:43] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Running 1350 sub problems to find dead transitions.
[2024-06-01 11:57:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
SMT process timed out in 30325ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 30336ms
Starting structural reductions in LTL mode, iteration 1 : 868/879 places, 1351/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31572 ms. Remains : 868/879 places, 1351/1370 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-07
Product exploration explored 100000 steps with 156 reset in 249 ms.
Entered a terminal (fully accepting) state of product in 88207 steps with 136 reset in 250 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-07 finished in 32227 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((X(X(p0))&&(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 34 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-06-01 11:58:14] [INFO ] Computed 66 invariants in 4 ms
[2024-06-01 11:58:14] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 11:58:14] [INFO ] Invariant cache hit.
[2024-06-01 11:58:15] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-06-01 11:58:15] [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/866 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30311ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31451 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-08
Product exploration explored 100000 steps with 159 reset in 462 ms.
Product exploration explored 100000 steps with 152 reset in 470 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (60 resets) in 270 ms. (147 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2024-06-01 11:58:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 751/867 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1350/2217 variables, 867/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2217 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2217 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2217/2217 variables, and 933 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 867/867 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 751/867 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 3 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 4 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 96 places in 209 ms of which 3 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 59 places in 396 ms of which 6 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 86 places in 380 ms of which 11 ms to minimize.
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 6 ms to minimize.
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/867 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/867 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1350/2217 variables, 867/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2217 variables, 1/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2217 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2217 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2217/2217 variables, and 943 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3035 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 867/867 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3576ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 267 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=133 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR (NOT p1) p2 p0))), (F p0), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1)]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
[2024-06-01 11:58:52] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (OR (NOT p1) p2 p0))), (F p0), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 11 factoid took 405 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLFireability-08 finished in 38959 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 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 878 transition count 1309
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 818 transition count 1308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 222 place count 752 transition count 1173
Iterating global reduction 3 with 30 rules applied. Total rules applied 252 place count 752 transition count 1173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 252 place count 752 transition count 1171
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 750 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 260 place count 746 transition count 1157
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 746 transition count 1157
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 650 place count 553 transition count 964
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 654 place count 553 transition count 960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 16 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 856 place count 452 transition count 988
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 870 place count 452 transition count 974
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 942 place count 416 transition count 982
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 5 with 59 rules applied. Total rules applied 1001 place count 416 transition count 923
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1009 place count 408 transition count 923
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1009 place count 408 transition count 918
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1019 place count 403 transition count 918
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1051 place count 387 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1052 place count 386 transition count 901
Applied a total of 1052 rules in 277 ms. Remains 386 /879 variables (removed 493) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 386 cols
[2024-06-01 11:58:53] [INFO ] Computed 58 invariants in 4 ms
[2024-06-01 11:58:53] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-06-01 11:58:53] [INFO ] Invariant cache hit.
[2024-06-01 11:58:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:58:54] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2024-06-01 11:58:54] [INFO ] Redundant transitions in 10 ms returned []
Running 867 sub problems to find dead transitions.
[2024-06-01 11:58:54] [INFO ] Invariant cache hit.
[2024-06-01 11:58:54] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:09] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2024-06-01 11:59:09] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 1 ms to minimize.
[2024-06-01 11:59:10] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:14] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:59:14] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/1287 variables, and 51 constraints, problems are : Problem set: 0 solved, 867 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/58 constraints, State Equation: 0/386 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 867/867 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 867 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:28] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:34] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-06-01 11:59:34] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-01 11:59:35] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:59:36] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 5 (OVERLAPS) 1/386 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 1 ms to minimize.
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 2 ms to minimize.
[2024-06-01 11:59:45] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:59:48] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:59:48] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:59:49] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2024-06-01 11:59:50] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-06-01 11:59:53] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:59:53] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2024-06-01 11:59:53] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1287 variables, and 92 constraints, problems are : Problem set: 0 solved, 867 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/386 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/867 constraints, Known Traps: 34/34 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 867 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 386/879 places, 901/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61758 ms. Remains : 386/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-09
Stuttering criterion allowed to conclude after 352 steps with 4 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-09 finished in 61846 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)||G(F(p1)))))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 878 transition count 1310
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 819 transition count 1310
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 118 place count 819 transition count 1275
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 188 place count 784 transition count 1275
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 217 place count 755 transition count 1178
Iterating global reduction 2 with 29 rules applied. Total rules applied 246 place count 755 transition count 1178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 246 place count 755 transition count 1176
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 250 place count 753 transition count 1176
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 254 place count 749 transition count 1162
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 place count 749 transition count 1162
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 648 place count 554 transition count 967
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 651 place count 554 transition count 964
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 853 place count 453 transition count 994
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 867 place count 453 transition count 980
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 939 place count 417 transition count 988
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1001 place count 417 transition count 926
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1010 place count 408 transition count 926
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1010 place count 408 transition count 921
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1020 place count 403 transition count 921
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1058 place count 384 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1059 place count 383 transition count 901
Applied a total of 1059 rules in 191 ms. Remains 383 /879 variables (removed 496) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 383 cols
[2024-06-01 11:59:55] [INFO ] Computed 57 invariants in 6 ms
[2024-06-01 11:59:55] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-06-01 11:59:55] [INFO ] Invariant cache hit.
[2024-06-01 11:59:56] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:59:56] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2024-06-01 11:59:56] [INFO ] Redundant transitions in 10 ms returned []
Running 846 sub problems to find dead transitions.
[2024-06-01 11:59:56] [INFO ] Invariant cache hit.
[2024-06-01 11:59:56] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 12:00:02] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:00:02] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-06-01 12:00:02] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:00:02] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 3 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2024-06-01 12:00:03] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:00:04] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:00:04] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:00:04] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-06-01 12:00:04] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:00:04] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 5 ms to minimize.
[2024-06-01 12:00:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:00:05] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:00:05] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2024-06-01 12:00:07] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2024-06-01 12:00:08] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 12:00:10] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 1 ms to minimize.
[2024-06-01 12:00:12] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2024-06-01 12:00:12] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 2 ms to minimize.
[2024-06-01 12:00:12] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 1 ms to minimize.
[2024-06-01 12:00:13] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:00:13] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:00:14] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:00:14] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 12:00:17] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:00:17] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:00:20] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:00:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:00:21] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-01 12:00:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1284 variables, and 92 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 35/92 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 12:00:28] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2024-06-01 12:00:29] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2024-06-01 12:00:29] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 12:00:36] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:00:36] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-06-01 12:00:43] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:00:43] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 6 (OVERLAPS) 901/1284 variables, 383/482 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1284 variables, 31/513 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1284 variables, 846/1359 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1284/1284 variables, and 1359 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 42/42 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 383/879 places, 901/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61739 ms. Remains : 383/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-10
Stuttering criterion allowed to conclude after 218 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-10 finished in 61834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 221 place count 753 transition count 1174
Iterating global reduction 2 with 29 rules applied. Total rules applied 250 place count 753 transition count 1174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 250 place count 753 transition count 1173
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 752 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 749 transition count 1165
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 749 transition count 1165
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 648 place count 554 transition count 970
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 652 place count 554 transition count 966
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 854 place count 453 transition count 997
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 868 place count 453 transition count 983
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 940 place count 417 transition count 991
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 1004 place count 417 transition count 927
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1013 place count 408 transition count 927
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1013 place count 408 transition count 922
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1023 place count 403 transition count 922
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1059 place count 385 transition count 904
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1061 place count 384 transition count 906
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1062 place count 384 transition count 906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1063 place count 383 transition count 905
Applied a total of 1063 rules in 128 ms. Remains 383 /879 variables (removed 496) and now considering 905/1370 (removed 465) transitions.
[2024-06-01 12:00:56] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
// Phase 1: matrix 902 rows 383 cols
[2024-06-01 12:00:56] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 12:00:57] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 12:00:57] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
[2024-06-01 12:00:57] [INFO ] Invariant cache hit.
[2024-06-01 12:00:57] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:00:57] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-06-01 12:00:57] [INFO ] Redundant transitions in 16 ms returned []
Running 850 sub problems to find dead transitions.
[2024-06-01 12:00:57] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
[2024-06-01 12:00:57] [INFO ] Invariant cache hit.
[2024-06-01 12:00:57] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 12:01:03] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:01:04] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:01:04] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:01:04] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:01:04] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:01:04] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-06-01 12:01:05] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:01:06] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:01:06] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:01:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:01:06] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:01:07] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:01:07] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 12:01:09] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:01:09] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:01:10] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-01 12:01:11] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:01:11] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:01:12] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:01:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:01:13] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 12:01:16] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:01:16] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:01:17] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:01:17] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1285 variables, and 90 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 33/90 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 12:01:30] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 1 ms to minimize.
[2024-06-01 12:01:30] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:01:30] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:01:32] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 12:01:36] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2024-06-01 12:01:39] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 5 (OVERLAPS) 902/1285 variables, 383/482 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1285 variables, 31/513 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1285 variables, 850/1363 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1285/1285 variables, and 1363 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 42/42 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 383/879 places, 905/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61149 ms. Remains : 383/879 places, 905/1370 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-11
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-11 finished in 61258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p0)))))'
Support contains 1 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 40 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-06-01 12:01:58] [INFO ] Computed 66 invariants in 11 ms
[2024-06-01 12:01:58] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 12:01:58] [INFO ] Invariant cache hit.
[2024-06-01 12:01:59] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-06-01 12:01:59] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
SMT process timed out in 30291ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31473 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-12 finished in 31607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(X(G(p0))||p1))))))'
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 43 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
[2024-06-01 12:02:29] [INFO ] Invariant cache hit.
[2024-06-01 12:02:30] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 12:02:30] [INFO ] Invariant cache hit.
[2024-06-01 12:02:30] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-06-01 12:02:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
SMT process timed out in 30302ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30315ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31441 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Product exploration explored 100000 steps with 33333 reset in 231 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLFireability-14 finished in 32275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X((!p0&&G((!p0||G(p1)))))))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 870 transition count 1357
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 870 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 869 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 869 transition count 1355
Applied a total of 20 rules in 34 ms. Remains 869 /879 variables (removed 10) and now considering 1355/1370 (removed 15) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2024-06-01 12:03:02] [INFO ] Computed 66 invariants in 12 ms
[2024-06-01 12:03:02] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-06-01 12:03:02] [INFO ] Invariant cache hit.
[2024-06-01 12:03:03] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
Running 1354 sub problems to find dead transitions.
[2024-06-01 12:03:03] [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/868 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
SMT process timed out in 30284ms, After SMT, problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 30296ms
Starting structural reductions in LTL mode, iteration 1 : 869/879 places, 1355/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31680 ms. Remains : 869/879 places, 1355/1370 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15
Product exploration explored 100000 steps with 157 reset in 269 ms.
Product exploration explored 100000 steps with 158 reset in 288 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (62 resets) in 228 ms. (174 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-06-01 12:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 753/869 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1355/2224 variables, 869/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2224 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2224 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2224/2224 variables, and 935 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 869/869 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 753/869 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1355/2224 variables, 869/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2224 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2224 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2224 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2224/2224 variables, and 936 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 869/869 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 971ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1296
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 810 transition count 1296
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 810 transition count 1259
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 773 transition count 1259
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 749 transition count 1163
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 749 transition count 1163
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 1 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 630 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 633 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 835 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 849 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 921 place count 417 transition count 987
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 983 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 992 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 992 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1002 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1040 place count 384 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 384 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 383 transition count 900
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1043 place count 383 transition count 899
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1048 place count 383 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1049 place count 382 transition count 898
Applied a total of 1049 rules in 112 ms. Remains 382 /869 variables (removed 487) and now considering 898/1355 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 382/869 places, 898/1355 transitions.
RANDOM walk for 40000 steps (196 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 382967 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 382967 steps, saw 95174 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
// Phase 1: matrix 898 rows 382 cols
[2024-06-01 12:03:39] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 12:03:39] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/126 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 243/369 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/397 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 320/717 variables, 77/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/717 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/717 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/717 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 40/757 variables, 14/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/757 variables, 19/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/757 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 302/1059 variables, 84/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1059 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1059 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1059 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 25/1084 variables, 10/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 25/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 138/1222 variables, 63/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1222 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1222 variables, 7/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1222 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/1232 variables, 5/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1232 variables, 6/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1232 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 39/1271 variables, 17/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1271 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1271 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1273 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1273 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1273 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 7/1280 variables, 7/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1280 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1280 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/1280 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 382/382 constraints, ReadFeed: 36/36 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/126 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 243/369 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/397 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 320/717 variables, 77/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/717 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/717 variables, 12/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/717 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/757 variables, 14/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/757 variables, 19/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/757 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 302/1059 variables, 84/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1059 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1059 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1059 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 25/1084 variables, 10/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 25/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 138/1222 variables, 63/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1222 variables, 5/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1222 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1222 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 10/1232 variables, 5/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1232 variables, 6/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1232 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 39/1271 variables, 17/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1271 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1271 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1273 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1273 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1273 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 7/1280 variables, 7/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1280 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1280 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/1280 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 382/382 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 7 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 382/382 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-06-01 12:03:39] [INFO ] Invariant cache hit.
[2024-06-01 12:03:40] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 12:03:40] [INFO ] Invariant cache hit.
[2024-06-01 12:03:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 12:03:40] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-06-01 12:03:40] [INFO ] Redundant transitions in 12 ms returned []
Running 843 sub problems to find dead transitions.
[2024-06-01 12:03:40] [INFO ] Invariant cache hit.
[2024-06-01 12:03:40] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:03:45] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:03:46] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:03:47] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:03:47] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:03:47] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:03:47] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:03:49] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:03:49] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:03:49] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:03:50] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-06-01 12:03:50] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:03:51] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-06-01 12:03:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:03:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:03:54] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-06-01 12:03:54] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:03:54] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:03:55] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:03:57] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:03:58] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 4 (OVERLAPS) 898/1280 variables, 382/466 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1280 variables, 36/502 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 502 constraints, problems are : Problem set: 0 solved, 843 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 382/382 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 843/843 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 843 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:04:19] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2024-06-01 12:04:20] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2024-06-01 12:04:20] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2024-06-01 12:04:20] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:04:26] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:04:26] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:04:27] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:04:27] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:04:27] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:04:28] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:04:29] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:04:30] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:04:36] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2024-06-01 12:04:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1280 variables, and 107 constraints, problems are : Problem set: 0 solved, 843 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/382 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 0/843 constraints, Known Traps: 50/50 constraints]
After SMT, in 60377ms problems are : Problem set: 0 solved, 843 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61058 ms. Remains : 382/382 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 382 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 380 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 380 transition count 870
Applied a total of 26 rules in 23 ms. Remains 380 /382 variables (removed 2) and now considering 870/898 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 380 cols
[2024-06-01 12:04:41] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 12:04:41] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-06-01 12:04:41] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:04:41] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-06-01 12:04:41] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:04:41] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:04:41] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 690 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 868 transition count 1295
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 809 transition count 1295
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 809 transition count 1258
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 772 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 748 transition count 1162
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 748 transition count 1162
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 628 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 631 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 833 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 847 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 919 place count 417 transition count 987
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 981 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 990 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 990 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1000 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1038 place count 384 transition count 901
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1039 place count 384 transition count 901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1040 place count 383 transition count 900
Applied a total of 1040 rules in 108 ms. Remains 383 /869 variables (removed 486) and now considering 900/1355 (removed 455) transitions.
// Phase 1: matrix 900 rows 383 cols
[2024-06-01 12:04:42] [INFO ] Computed 57 invariants in 6 ms
[2024-06-01 12:04:42] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 12:04:42] [INFO ] Invariant cache hit.
[2024-06-01 12:04:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:04:42] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-06-01 12:04:42] [INFO ] Redundant transitions in 10 ms returned []
Running 845 sub problems to find dead transitions.
[2024-06-01 12:04:42] [INFO ] Invariant cache hit.
[2024-06-01 12:04:42] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:04:48] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:04:49] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:04:49] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:04:51] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:04:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:04:56] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:04:57] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:04:57] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:04:57] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:04:57] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:05:04] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:05:05] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1283 variables, and 83 constraints, problems are : Problem set: 0 solved, 845 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 845/845 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 845 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:05:15] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:05:15] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-06-01 12:05:16] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:05:19] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:05:21] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:05:24] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:05:24] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 1 ms to minimize.
[2024-06-01 12:05:25] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:05:29] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2024-06-01 12:05:30] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:05:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:05:35] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/1283 variables, and 97 constraints, problems are : Problem set: 0 solved, 845 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/845 constraints, Known Traps: 40/40 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 383/869 places, 900/1355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61184 ms. Remains : 383/869 places, 900/1355 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 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (192 resets) in 319 ms. (125 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2024-06-01 12:05:43] [INFO ] Invariant cache hit.
[2024-06-01 12:05:43] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/129 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 242/371 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/399 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 321/720 variables, 77/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/720 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/720 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 40/760 variables, 14/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/760 variables, 19/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/760 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 299/1059 variables, 84/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1059 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1059 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1059 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 25/1084 variables, 10/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 25/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 141/1225 variables, 63/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1225 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1225 variables, 7/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1225 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/1235 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1235 variables, 6/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1235 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 39/1274 variables, 17/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1274 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1274 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1276 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1276 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1276 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 7/1283 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1283 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1283 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/1283 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1283/1283 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/129 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 242/371 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/399 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 321/720 variables, 77/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/720 variables, 12/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/720 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/760 variables, 14/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/760 variables, 19/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/760 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 299/1059 variables, 84/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1059 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1059 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1059 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 25/1084 variables, 10/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 25/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 141/1225 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1225 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1225 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1225 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 10/1235 variables, 5/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1235 variables, 6/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1235 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 39/1274 variables, 17/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1274 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1274 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1276 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1276 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1276 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 7/1283 variables, 7/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1283 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1283 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/1283 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1283/1283 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 383/383 places, 900/900 transitions.
RANDOM walk for 40000 steps (195 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 348851 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 348851 steps, saw 95507 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-06-01 12:05:47] [INFO ] Invariant cache hit.
[2024-06-01 12:05:47] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/129 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 242/371 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/399 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 321/720 variables, 77/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/720 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/720 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 40/760 variables, 14/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/760 variables, 19/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/760 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 299/1059 variables, 84/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1059 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1059 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1059 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 25/1084 variables, 10/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 25/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 141/1225 variables, 63/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1225 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1225 variables, 7/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1225 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/1235 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1235 variables, 6/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1235 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 39/1274 variables, 17/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1274 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1274 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1276 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1276 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1276 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 7/1283 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1283 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1283 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/1283 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1283/1283 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/129 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 242/371 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/399 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 321/720 variables, 77/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/720 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/720 variables, 12/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/720 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/760 variables, 14/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/760 variables, 19/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/760 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 299/1059 variables, 84/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1059 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1059 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1059 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 25/1084 variables, 10/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 25/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 141/1225 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1225 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1225 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1225 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 10/1235 variables, 5/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1235 variables, 6/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1235 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 39/1274 variables, 17/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1274 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1274 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1276 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1276 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1276 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 7/1283 variables, 7/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1283 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1283 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/1283 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1283/1283 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 383/383 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 383/383 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2024-06-01 12:05:48] [INFO ] Invariant cache hit.
[2024-06-01 12:05:48] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 12:05:48] [INFO ] Invariant cache hit.
[2024-06-01 12:05:48] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:05:48] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-06-01 12:05:48] [INFO ] Redundant transitions in 9 ms returned []
Running 845 sub problems to find dead transitions.
[2024-06-01 12:05:49] [INFO ] Invariant cache hit.
[2024-06-01 12:05:49] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:05:54] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:05:58] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:05:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:05:59] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:05:59] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:06:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:06:02] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:06:02] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:06:11] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1283 variables, and 83 constraints, problems are : Problem set: 0 solved, 845 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 845/845 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 845 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:06:21] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2024-06-01 12:06:21] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 1 ms to minimize.
[2024-06-01 12:06:22] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:06:25] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:06:27] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:06:28] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-06-01 12:06:28] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:06:30] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:06:30] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:06:31] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:06:35] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:06:36] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:06:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/1283 variables, and 97 constraints, problems are : Problem set: 0 solved, 845 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/383 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/845 constraints, Known Traps: 40/40 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61007 ms. Remains : 383/383 places, 900/900 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 383 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 381 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 381 transition count 870
Applied a total of 28 rules in 19 ms. Remains 381 /383 variables (removed 2) and now considering 870/900 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 381 cols
[2024-06-01 12:06:49] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 12:06:49] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-06-01 12:06:49] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:06:49] [INFO ] [Nat]Absence check using 57 positive place invariants in 7 ms returned sat
[2024-06-01 12:06:49] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:06:49] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:06:49] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 654 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Entered a terminal (fully accepting) state of product in 96695 steps with 471 reset in 393 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 228891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
[2024-06-01 12:06:51] [INFO ] Flatten gal took : 63 ms
[2024-06-01 12:06:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:06:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 879 places, 1370 transitions and 4121 arcs took 28 ms.
Total runtime 1034841 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NoC3x3-PT-5B-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243614376

--------------------
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 NoC3x3-PT-5B-LTLFireability-04
ltl formula formula --ltl=/tmp/2863/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 879 places, 1370 transitions and 4121 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.230 real 0.050 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2863/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2863/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2863/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2863/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 880 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 880, there are 1383 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( 2/ 4): ~2500 levels ~10000 states ~68260 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~148732 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~309800 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~10975!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 41403
pnml2lts-mc( 0/ 4): unique transitions count: 355699
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 38609
pnml2lts-mc( 0/ 4): - claim success count: 41423
pnml2lts-mc( 0/ 4): - cum. max stack depth: 41415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 41423 states 355730 transitions, fanout: 8.588
pnml2lts-mc( 0/ 4): Total exploration time 2.270 sec (2.260 sec minimum, 2.267 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18248, Transitions per second: 156709
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.4MB, 11.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 1400 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-5B"
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 NoC3x3-PT-5B, 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 r508-tall-171654352000628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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