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.r246-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 itstools
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 r246-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 1716702999214

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 05:56:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 05:56:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:56:40] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-26 05:56:40] [INFO ] Transformed 1571 places.
[2024-05-26 05:56:40] [INFO ] Transformed 2173 transitions.
[2024-05-26 05:56:40] [INFO ] Found NUPN structural information;
[2024-05-26 05:56:40] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 292 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 484 ms. Remains 879 /1571 variables (removed 692) and now considering 1370/2173 (removed 803) transitions.
// Phase 1: matrix 1370 rows 879 cols
[2024-05-26 05:56:41] [INFO ] Computed 66 invariants in 33 ms
[2024-05-26 05:56:41] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-26 05:56:41] [INFO ] Invariant cache hit.
[2024-05-26 05:56:42] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Running 1369 sub problems to find dead transitions.
[2024-05-26 05:56:42] [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 30480ms, After SMT, problems are : Problem set: 0 solved, 1369 unsolved
Search for dead transitions found 0 dead transitions in 30568ms
Starting structural reductions in LTL mode, iteration 1 : 879/1571 places, 1370/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32517 ms. Remains : 879/1571 places, 1370/2173 transitions.
Support contains 34 out of 879 places after structural reductions.
[2024-05-26 05:57:13] [INFO ] Flatten gal took : 116 ms
[2024-05-26 05:57:13] [INFO ] Flatten gal took : 67 ms
[2024-05-26 05:57:13] [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 2001 ms. (19 steps per ms) remains 6/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
[2024-05-26 05:57:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 198/208 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 671/879 variables, 57/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 868 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 198/208 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 671/879 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 05:57:16] [INFO ] Deduced a trap composed of 22 places in 492 ms of which 47 ms to minimize.
[2024-05-26 05:57:17] [INFO ] Deduced a trap composed of 47 places in 493 ms of which 19 ms to minimize.
[2024-05-26 05:57:17] [INFO ] Deduced a trap composed of 36 places in 470 ms of which 5 ms to minimize.
[2024-05-26 05:57:17] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 4 ms to minimize.
[2024-05-26 05:57:18] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 4 ms to minimize.
[2024-05-26 05:57:18] [INFO ] Deduced a trap composed of 106 places in 225 ms of which 4 ms to minimize.
[2024-05-26 05:57:18] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 4 ms to minimize.
[2024-05-26 05:57:18] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 4 ms to minimize.
[2024-05-26 05:57:19] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-26 05:57:19] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 3 ms to minimize.
[2024-05-26 05:57:19] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2024-05-26 05:57:19] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 3 ms to minimize.
[2024-05-26 05:57:19] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 4 ms to minimize.
[2024-05-26 05:57:20] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 4 ms to minimize.
[2024-05-26 05:57:20] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 3 ms to minimize.
[2024-05-26 05:57:20] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 3 ms to minimize.
[2024-05-26 05:57:20] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 5929ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 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 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 213 place count 760 transition count 1185
Iterating global reduction 2 with 25 rules applied. Total rules applied 238 place count 760 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 239 place count 759 transition count 1182
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 759 transition count 1182
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 1 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 632 place count 563 transition count 986
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 636 place count 563 transition count 982
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -31
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 838 place count 462 transition count 1013
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 852 place count 462 transition count 999
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 920 place count 428 transition count 1007
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 984 place count 428 transition count 943
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 993 place count 419 transition count 943
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 419 transition count 938
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 1003 place count 414 transition count 938
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1035 place count 398 transition count 922
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1041 place count 395 transition count 925
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1043 place count 395 transition count 923
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1045 place count 393 transition count 923
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 393 transition count 923
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1051 place count 392 transition count 922
Applied a total of 1051 rules in 364 ms. Remains 392 /879 variables (removed 487) and now considering 922/1370 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 392/879 places, 922/1370 transitions.
RANDOM walk for 40000 steps (188 resets) in 626 ms. (63 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2024-05-26 05:57:21] [INFO ] Flow matrix only has 919 transitions (discarded 3 similar events)
// Phase 1: matrix 919 rows 392 cols
[2024-05-26 05:57:21] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 05:57:21] [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) 155/190 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 494/684 variables, 190/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 22/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/919 variables, 43/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/919 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/951 variables, 10/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/951 variables, 26/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/951 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 166/1117 variables, 48/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1117 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1117 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1117 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/1137 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1137 variables, 17/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1137 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 120/1257 variables, 32/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1257 variables, 5/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1257 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 19/1276 variables, 7/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1276 variables, 17/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1276 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 30/1306 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1306 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1306 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 5/1311 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1311 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1311 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1311 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1311/1311 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 392/392 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) 155/190 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 494/684 variables, 190/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 22/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/919 variables, 43/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/919 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/919 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/951 variables, 10/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/951 variables, 26/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/951 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 166/1117 variables, 48/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1117 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1117 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1117 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/1137 variables, 8/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1137 variables, 17/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1137 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 120/1257 variables, 32/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1257 variables, 5/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1257 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 19/1276 variables, 7/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1276 variables, 17/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1276 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 30/1306 variables, 14/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1306 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1306 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/1311 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1311 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1311 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/1311 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1311/1311 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 392/392 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 804ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 922/922 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 392 transition count 920
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 4 place count 390 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 389 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 389 transition count 916
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 387 transition count 914
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 387 transition count 912
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 385 transition count 898
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 385 transition count 898
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 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 18 place count 384 transition count 897
Applied a total of 18 rules in 50 ms. Remains 384 /392 variables (removed 8) and now considering 897/922 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 384/392 places, 897/922 transitions.
RANDOM walk for 40000 steps (190 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 509132 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 509132 steps, saw 113749 distinct states, run finished after 3005 ms. (steps per millisecond=169 ) properties seen :0
// Phase 1: matrix 897 rows 384 cols
[2024-05-26 05:57:25] [INFO ] Computed 57 invariants in 11 ms
[2024-05-26 05:57:25] [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 344 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 464 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 832ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 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 11 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 10 ms. Remains 384 /384 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2024-05-26 05:57:26] [INFO ] Invariant cache hit.
[2024-05-26 05:57:26] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-26 05:57:26] [INFO ] Invariant cache hit.
[2024-05-26 05:57:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-26 05:57:27] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-05-26 05:57:27] [INFO ] Redundant transitions in 43 ms returned []
Running 869 sub problems to find dead transitions.
[2024-05-26 05:57:27] [INFO ] Invariant cache hit.
[2024-05-26 05:57:27] [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-05-26 05:57:36] [INFO ] Deduced a trap composed of 39 places in 95 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-05-26 05:57:42] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 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-05-26 05:57:56] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-26 05:57:57] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2024-05-26 05:57:57] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-26 05:57:57] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1281 variables, and 63 constraints, problems are : Problem set: 0 solved, 869 unsolved in 30021 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: 6/6 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, 5/36 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 3 (OVERLAPS) 1/384 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 869 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-05-26 05:58:05] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-05-26 05:58:05] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-05-26 05:58:05] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-26 05:58:05] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-26 05:58:06] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-26 05:58:06] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-05-26 05:58:06] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-26 05:58:06] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-26 05:58:06] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-26 05:58:07] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-26 05:58:07] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2024-05-26 05:58:08] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 4 ms to minimize.
[2024-05-26 05:58:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-26 05:58:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-26 05:58:10] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-05-26 05:58:13] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-26 05:58:13] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 3 ms to minimize.
[2024-05-26 05:58:15] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-26 05:58:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-26 05:58:15] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-26 05:58:16] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-26 05:58:18] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 869 unsolved
[2024-05-26 05:58:20] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-05-26 05:58:20] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-26 05:58:21] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2024-05-26 05:58:21] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2024-05-26 05:58:21] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 2 ms to minimize.
[2024-05-26 05:58:22] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-26 05:58:22] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
[2024-05-26 05:58:22] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 2 ms to minimize.
[2024-05-26 05:58:22] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 2 ms to minimize.
[2024-05-26 05:58:22] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-05-26 05:58:22] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-05-26 05:58:23] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 7 ms to minimize.
[2024-05-26 05:58:23] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 2 ms to minimize.
[2024-05-26 05:58:23] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-05-26 05:58:23] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2024-05-26 05:58:25] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1281 variables, and 101 constraints, problems are : Problem set: 0 solved, 869 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/869 constraints, Known Traps: 44/44 constraints]
After SMT, in 60476ms problems are : Problem set: 0 solved, 869 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61216 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-05-26 05:58:27] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 05:58:27] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 05:58:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 05:58:27] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 05:58:28] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 05:58:28] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 522 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 38 ms. Remains 871 /879 variables (removed 8) and now considering 1357/1370 (removed 13) transitions.
// Phase 1: matrix 1357 rows 871 cols
[2024-05-26 05:58:28] [INFO ] Computed 66 invariants in 12 ms
[2024-05-26 05:58:28] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-26 05:58:28] [INFO ] Invariant cache hit.
[2024-05-26 05:58:29] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-26 05:58:29] [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/870 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
SMT process timed out in 30368ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 30384ms
Starting structural reductions in LTL mode, iteration 1 : 871/879 places, 1357/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31480 ms. Remains : 871/879 places, 1357/1370 transitions.
Stuttering acceptance computed with spot in 280 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 727 steps with 1 reset in 11 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-00 finished in 31836 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 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 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 1 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 167 ms. Remains 381 /879 variables (removed 498) and now considering 894/1370 (removed 476) transitions.
// Phase 1: matrix 894 rows 381 cols
[2024-05-26 05:59:00] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 05:59:00] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-26 05:59:00] [INFO ] Invariant cache hit.
[2024-05-26 05:59:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 05:59:01] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-26 05:59:01] [INFO ] Redundant transitions in 16 ms returned []
Running 839 sub problems to find dead transitions.
[2024-05-26 05:59:01] [INFO ] Invariant cache hit.
[2024-05-26 05:59:01] [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-05-26 05:59:07] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-05-26 05:59:07] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-05-26 05:59:08] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-26 05:59:08] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-26 05:59:08] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-26 05:59:08] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-26 05:59:08] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2024-05-26 05:59:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-26 05:59:09] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-26 05:59:10] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-05-26 05:59:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-26 05:59:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-26 05:59:12] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-26 05:59:12] [INFO ] Deduced a trap composed of 19 places in 55 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-05-26 05:59:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 839 unsolved
[2024-05-26 05:59:21] [INFO ] Deduced a trap composed of 37 places in 89 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 30019 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-05-26 05:59:34] [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
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 30024 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 60418ms problems are : Problem set: 0 solved, 839 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
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 61227 ms. Remains : 381/879 places, 894/1370 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-01
Stuttering criterion allowed to conclude after 299 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-01 finished in 61297 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 0 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 1 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 158 ms. Remains 382 /879 variables (removed 497) and now considering 895/1370 (removed 475) transitions.
// Phase 1: matrix 895 rows 382 cols
[2024-05-26 06:00:01] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 06:00:02] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-26 06:00:02] [INFO ] Invariant cache hit.
[2024-05-26 06:00:02] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:00:02] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2024-05-26 06:00:02] [INFO ] Redundant transitions in 11 ms returned []
Running 861 sub problems to find dead transitions.
[2024-05-26 06:00:02] [INFO ] Invariant cache hit.
[2024-05-26 06:00: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-05-26 06:00:11] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-05-26 06:00:11] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-05-26 06:00:11] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-26 06:00:11] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-05-26 06:00:17] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-05-26 06:00:23] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-26 06:00:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-26 06:00:25] [INFO ] Deduced a trap composed of 15 places in 50 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 30018 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-05-26 06:00:41] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-05-26 06:00:41] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 1 ms to minimize.
[2024-05-26 06:00:41] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2024-05-26 06:00:41] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-26 06:00:41] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-26 06:00:41] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 5 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-26 06:00:42] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-26 06:00:43] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-26 06:00:43] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-26 06:00:44] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2024-05-26 06:00:44] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-26 06:00:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-26 06:00:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-05-26 06:00:49] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2024-05-26 06:00:49] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-26 06:00:50] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-05-26 06:00:58] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-26 06:00:58] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 timeout
0)
(s159 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1277 variables, and 89 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30021 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: 32/32 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
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 61349 ms. Remains : 382/879 places, 895/1370 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-03
Product exploration explored 100000 steps with 474 reset in 448 ms.
Stack based approach found an accepted trace after 49149 steps with 234 reset with depth 375 and stack size 375 in 224 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-03 finished in 62096 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 0 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 151 ms. Remains 383 /879 variables (removed 496) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 383 cols
[2024-05-26 06:01:03] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 06:01:03] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-26 06:01:03] [INFO ] Invariant cache hit.
[2024-05-26 06:01:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:01:04] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-26 06:01:04] [INFO ] Redundant transitions in 10 ms returned []
Running 846 sub problems to find dead transitions.
[2024-05-26 06:01:04] [INFO ] Invariant cache hit.
[2024-05-26 06:01: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-05-26 06:01:10] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-26 06:01:10] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-26 06:01:11] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-05-26 06:01:11] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-26 06:01:11] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-26 06:01:12] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-26 06:01:12] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-26 06:01:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-26 06:01:14] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-26 06:01:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-26 06:01:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-26 06:01:15] [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, 12/69 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-26 06:01:17] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-26 06:01:18] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2024-05-26 06:01:19] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-05-26 06:01:19] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-26 06:01:20] [INFO ] Deduced a trap composed of 31 places in 114 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-05-26 06:01:25] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 1 ms to minimize.
[2024-05-26 06:01:26] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-26 06:01:29] [INFO ] Deduced a trap composed of 15 places in 47 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 30026 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-05-26 06:01:37] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 2 ms to minimize.
[2024-05-26 06:01:37] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 1 ms to minimize.
[2024-05-26 06:01:37] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2024-05-26 06:01:37] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 1 ms to minimize.
[2024-05-26 06:01:37] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-05-26 06:01:38] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 2 ms to minimize.
[2024-05-26 06:01:41] [INFO ] Deduced a trap composed of 26 places in 66 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-05-26 06:01:43] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-05-26 06:01:44] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 1 ms to minimize.
[2024-05-26 06:01:44] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-26 06:01:45] [INFO ] Deduced a trap composed of 48 places in 127 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 30020 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 60347ms 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 61184 ms. Remains : 383/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 75 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 477 reset in 391 ms.
Product exploration explored 100000 steps with 483 reset in 424 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 137 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 27 ms :[(NOT p1)]
RANDOM walk for 2236 steps (9 resets) in 18 ms. (117 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 120 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 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 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 11 ms. Remains 383 /383 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2024-05-26 06:02:06] [INFO ] Invariant cache hit.
[2024-05-26 06:02:06] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-26 06:02:06] [INFO ] Invariant cache hit.
[2024-05-26 06:02:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:02:07] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2024-05-26 06:02:07] [INFO ] Redundant transitions in 10 ms returned []
Running 846 sub problems to find dead transitions.
[2024-05-26 06:02:07] [INFO ] Invariant cache hit.
[2024-05-26 06:02:07] [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-05-26 06:02:13] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-05-26 06:02:13] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-26 06:02:13] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-05-26 06:02:13] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-05-26 06:02:14] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2024-05-26 06:02:14] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-26 06:02:14] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-05-26 06:02:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-26 06:02:17] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-26 06:02:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-26 06:02:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-26 06:02:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-26 06:02:20] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:02:21] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-05-26 06:02:21] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-26 06:02:21] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-26 06:02:23] [INFO ] Deduced a trap composed of 31 places in 130 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-05-26 06:02:28] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-05-26 06:02:29] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-26 06:02:31] [INFO ] Deduced a trap composed of 15 places in 41 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
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 30019 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-05-26 06:02:39] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-26 06:02:39] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2024-05-26 06:02:39] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-05-26 06:02:40] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
[2024-05-26 06:02:40] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 1 ms to minimize.
[2024-05-26 06:02:40] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 1 ms to minimize.
[2024-05-26 06:02:43] [INFO ] Deduced a trap composed of 26 places in 54 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-05-26 06:02:46] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-26 06:02:47] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-26 06:02:47] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-26 06:02:47] [INFO ] Deduced a trap composed of 48 places in 150 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 60394ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61330 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 77 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 34 ms :[(NOT p1)]
RANDOM walk for 3003 steps (13 resets) in 20 ms. (143 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 116 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 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 485 reset in 390 ms.
Stack based approach found an accepted trace after 34082 steps with 163 reset with depth 58 and stack size 58 in 136 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-04 finished in 124765 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 50 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-05-26 06:03:08] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 06:03:08] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-26 06:03:08] [INFO ] Invariant cache hit.
[2024-05-26 06:03:09] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-05-26 06:03:09] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
SMT process timed out in 30297ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31650 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 278 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 1085 steps with 1 reset in 4 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-05 finished in 31956 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 35 ms. Remains 868 /879 variables (removed 11) and now considering 1351/1370 (removed 19) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2024-05-26 06:03:40] [INFO ] Computed 66 invariants in 4 ms
[2024-05-26 06:03:40] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-26 06:03:40] [INFO ] Invariant cache hit.
[2024-05-26 06:03:41] [INFO ] Implicit Places using invariants and state equation in 764 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-05-26 06:03:41] [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 30287ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 30299ms
Starting structural reductions in LTL mode, iteration 1 : 868/879 places, 1351/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31535 ms. Remains : 868/879 places, 1351/1370 transitions.
Stuttering acceptance computed with spot in 132 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
Entered a terminal (fully accepting) state of product in 41390 steps with 65 reset in 111 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-07 finished in 31798 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 41 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-05-26 06:04:12] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 06:04:12] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-26 06:04:12] [INFO ] Invariant cache hit.
[2024-05-26 06:04:13] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-05-26 06:04:13] [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 30294ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30306ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31435 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 313 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 305 ms.
Product exploration explored 100000 steps with 159 reset in 333 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 214 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 256 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 474 ms. (84 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2024-05-26 06:04:45] [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 471 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-05-26 06:04:46] [INFO ] Deduced a trap composed of 77 places in 41 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-05-26 06:04:46] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 4 ms to minimize.
[2024-05-26 06:04:46] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 4 ms to minimize.
[2024-05-26 06:04:46] [INFO ] Deduced a trap composed of 96 places in 211 ms of which 3 ms to minimize.
[2024-05-26 06:04:47] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 4 ms to minimize.
[2024-05-26 06:04:47] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 4 ms to minimize.
[2024-05-26 06:04:47] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 3 ms to minimize.
[2024-05-26 06:04:47] [INFO ] Deduced a trap composed of 82 places in 197 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-05-26 06:04:47] [INFO ] Deduced a trap composed of 73 places in 174 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 2315 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 2806ms 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 344 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 311 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 295 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-05-26 06:04:49] [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 488 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 38040 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 1 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 0 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 148 ms. Remains 386 /879 variables (removed 493) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 386 cols
[2024-05-26 06:04:50] [INFO ] Computed 58 invariants in 7 ms
[2024-05-26 06:04:50] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-26 06:04:50] [INFO ] Invariant cache hit.
[2024-05-26 06:04:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:04:51] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2024-05-26 06:04:51] [INFO ] Redundant transitions in 15 ms returned []
Running 867 sub problems to find dead transitions.
[2024-05-26 06:04:51] [INFO ] Invariant cache hit.
[2024-05-26 06:04:51] [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-05-26 06:04:59] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-26 06:04:59] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-05-26 06:04:59] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-26 06:05:00] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-26 06:05:01] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-26 06:05:01] [INFO ] Deduced a trap composed of 16 places in 31 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-05-26 06:05:06] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2024-05-26 06:05:06] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-05-26 06:05:06] [INFO ] Deduced a trap composed of 72 places in 94 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-05-26 06:05:11] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-26 06:05:11] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-26 06:05:13] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-05-26 06:05:14] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-26 06:05:14] [INFO ] Deduced a trap composed of 15 places in 31 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
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 30026 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-05-26 06:05:25] [INFO ] Deduced a trap composed of 28 places in 96 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-05-26 06:05:31] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-26 06:05:31] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-26 06:05:31] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-26 06:05:33] [INFO ] Deduced a trap composed of 43 places in 66 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-05-26 06:05:42] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-05-26 06:05:42] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 1 ms to minimize.
[2024-05-26 06:05:42] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-26 06:05:42] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-26 06:05:42] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2024-05-26 06:05:43] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-26 06:05:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-26 06:05:43] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-26 06:05:44] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-26 06:05:45] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-26 06:05:46] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-26 06:05:46] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 867 unsolved
[2024-05-26 06:05:50] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-05-26 06:05:50] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-26 06:05:50] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
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 30017 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 60352ms problems are : Problem set: 0 solved, 867 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
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 61341 ms. Remains : 386/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-09
Stuttering criterion allowed to conclude after 854 steps with 11 reset in 8 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-09 finished in 61459 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 0 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 1 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 119 ms. Remains 383 /879 variables (removed 496) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 383 cols
[2024-05-26 06:05:51] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 06:05:51] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-26 06:05:51] [INFO ] Invariant cache hit.
[2024-05-26 06:05:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:05:52] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-26 06:05:52] [INFO ] Redundant transitions in 12 ms returned []
Running 846 sub problems to find dead transitions.
[2024-05-26 06:05:52] [INFO ] Invariant cache hit.
[2024-05-26 06:05:52] [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-05-26 06:05:58] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-26 06:05:58] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-26 06:05:59] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-26 06:05:59] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:05:59] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-26 06:05:59] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-05-26 06:05:59] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-05-26 06:06:00] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-26 06:06:00] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 1 ms to minimize.
[2024-05-26 06:06:00] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-26 06:06:00] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-26 06:06:00] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-26 06:06:00] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2024-05-26 06:06:01] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-26 06:06:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-26 06:06:01] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-26 06:06:01] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 3 ms to minimize.
[2024-05-26 06:06:03] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-26 06:06:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-26 06:06:04] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-26 06:06:06] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-26 06:06:08] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-26 06:06:08] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2024-05-26 06:06:09] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 1 ms to minimize.
[2024-05-26 06:06:09] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-26 06:06:09] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-26 06:06:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-26 06:06:11] [INFO ] Deduced a trap composed of 16 places in 49 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-05-26 06:06:13] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-26 06:06:13] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-26 06:06:14] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-26 06:06:16] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:06:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-26 06:06:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-26 06:06:18] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 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/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 30021 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-05-26 06:06:25] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2024-05-26 06:06:25] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-26 06:06:25] [INFO ] Deduced a trap composed of 79 places in 119 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-05-26 06:06:32] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-26 06:06:32] [INFO ] Deduced a trap composed of 64 places in 91 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-05-26 06:06:39] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 4 ms to minimize.
[2024-05-26 06:06:39] [INFO ] Deduced a trap composed of 41 places in 70 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 30026 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 60320ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
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 61173 ms. Remains : 383/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 93 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 222 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-10 finished in 61292 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 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 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 1 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 1 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 137 ms. Remains 383 /879 variables (removed 496) and now considering 905/1370 (removed 465) transitions.
[2024-05-26 06:06:53] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
// Phase 1: matrix 902 rows 383 cols
[2024-05-26 06:06:53] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 06:06:53] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 06:06:53] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
[2024-05-26 06:06:53] [INFO ] Invariant cache hit.
[2024-05-26 06:06:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:06:53] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-26 06:06:53] [INFO ] Redundant transitions in 12 ms returned []
Running 850 sub problems to find dead transitions.
[2024-05-26 06:06:53] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
[2024-05-26 06:06:53] [INFO ] Invariant cache hit.
[2024-05-26 06:06:53] [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-05-26 06:06:59] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-26 06:07:00] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-26 06:07:00] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2024-05-26 06:07:00] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-26 06:07:00] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 1 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 1 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-26 06:07:01] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 1 ms to minimize.
[2024-05-26 06:07:02] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-26 06:07:02] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2024-05-26 06:07:02] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-26 06:07:02] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-26 06:07:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-26 06:07:02] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-26 06:07:03] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-05-26 06:07:04] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-26 06:07:05] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-26 06:07:06] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-26 06:07:06] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-26 06:07:07] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-26 06:07:07] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-26 06:07:09] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-26 06:07:09] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-26 06:07:10] [INFO ] Deduced a trap composed of 16 places in 60 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-05-26 06:07:12] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-05-26 06:07:13] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
[2024-05-26 06:07:13] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-05-26 06:07:13] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-26 06:07:15] [INFO ] Deduced a trap composed of 71 places in 98 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: ((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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.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 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.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 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.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 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 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 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.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 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 timeout
0.0)
(s305 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 30021 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-05-26 06:07:26] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-26 06:07:26] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-05-26 06:07:27] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-05-26 06:07:28] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-26 06:07:30] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-26 06:07:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-05-26 06:07:33] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-26 06:07:35] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-26 06:07:36] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 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 30023 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 60370ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
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 61217 ms. Remains : 383/879 places, 905/1370 transitions.
Stuttering acceptance computed with spot in 89 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 262 steps with 1 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-11 finished in 61329 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 42 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-05-26 06:07:54] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 06:07:54] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-26 06:07:54] [INFO ] Invariant cache hit.
[2024-05-26 06:07:55] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-05-26 06:07:55] [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 30348ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30364ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31572 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 136 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 31734 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 41 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
[2024-05-26 06:08:26] [INFO ] Invariant cache hit.
[2024-05-26 06:08:26] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-26 06:08:26] [INFO ] Invariant cache hit.
[2024-05-26 06:08:27] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 1349 sub problems to find dead transitions.
[2024-05-26 06:08:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 30308ms
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31422 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 195 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 286 ms.
Product exploration explored 100000 steps with 33333 reset in 239 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 126 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 32322 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 36 ms. Remains 869 /879 variables (removed 10) and now considering 1355/1370 (removed 15) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2024-05-26 06:08:58] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 06:08:58] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-26 06:08:58] [INFO ] Invariant cache hit.
[2024-05-26 06:08:59] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
Running 1354 sub problems to find dead transitions.
[2024-05-26 06:08:59] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
SMT process timed out in 30336ms, After SMT, problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Starting structural reductions in LTL mode, iteration 1 : 869/879 places, 1355/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31410 ms. Remains : 869/879 places, 1355/1370 transitions.
Stuttering acceptance computed with spot in 171 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 159 reset in 299 ms.
Product exploration explored 100000 steps with 156 reset in 326 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 102 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 79 ms :[true, (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (61 resets) in 182 ms. (218 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
[2024-05-26 06:09:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 113/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 753/869 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 06:09:31] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1355/2224 variables, 869/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2224 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2224 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2224/2224 variables, and 936 constraints, problems are : Problem set: 0 solved, 3 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 869/869 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 113/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 753/869 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1355/2224 variables, 869/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2224 variables, 3/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2224 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2224 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2224/2224 variables, and 939 constraints, problems are : Problem set: 0 solved, 3 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 869/869 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1549ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1328 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 0 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 1 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 0 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 1 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 129 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 129 ms. Remains : 382/869 places, 898/1355 transitions.
RANDOM walk for 40000 steps (191 resets) in 452 ms. (88 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
// Phase 1: matrix 898 rows 382 cols
[2024-05-26 06:09:34] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 06:09:34] [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 370 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 425 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 805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 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.
RANDOM walk for 40000 steps (197 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 378511 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 378511 steps, saw 94402 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-26 06:09:38] [INFO ] Invariant cache hit.
[2024-05-26 06:09:38] [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 377 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 419 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 808ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 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 7 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-26 06:09:38] [INFO ] Invariant cache hit.
[2024-05-26 06:09:39] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 06:09:39] [INFO ] Invariant cache hit.
[2024-05-26 06:09:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-26 06:09:39] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-26 06:09:39] [INFO ] Redundant transitions in 12 ms returned []
Running 843 sub problems to find dead transitions.
[2024-05-26 06:09:39] [INFO ] Invariant cache hit.
[2024-05-26 06:09:39] [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-05-26 06:09:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-26 06:09:45] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-26 06:09:46] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2024-05-26 06:09:46] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2024-05-26 06:09:47] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-26 06:09:47] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2024-05-26 06:09:47] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-26 06:09:47] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2024-05-26 06:09:47] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-05-26 06:09:47] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-26 06:09:48] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-26 06:09:48] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-26 06:09:48] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-26 06:09:48] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-26 06:09:48] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-05-26 06:09:48] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-26 06:09:50] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:09:50] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-26 06:09:50] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 1 ms to minimize.
[2024-05-26 06:09:51] [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-05-26 06:09:52] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-26 06:09:53] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2024-05-26 06:09:54] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-05-26 06:09:54] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-26 06:09:54] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-05-26 06:09:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-26 06:09:57] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 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
SMT process timed out in 30378ms, After SMT, problems are : Problem set: 0 solved, 843 unsolved
Search for dead transitions found 0 dead transitions in 30387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31099 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 16 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-05-26 06:10:10] [INFO ] Computed 57 invariants in 11 ms
[2024-05-26 06:10:10] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 06:10:10] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 06:10:10] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 06:10:10] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 06:10:10] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 06:10:10] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 672 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 176 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 96 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 80 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 3 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 0 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 1 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 1 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 113 ms. Remains 383 /869 variables (removed 486) and now considering 900/1355 (removed 455) transitions.
// Phase 1: matrix 900 rows 383 cols
[2024-05-26 06:10:11] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 06:10:11] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-26 06:10:11] [INFO ] Invariant cache hit.
[2024-05-26 06:10:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:10:11] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-26 06:10:11] [INFO ] Redundant transitions in 11 ms returned []
Running 845 sub problems to find dead transitions.
[2024-05-26 06:10:11] [INFO ] Invariant cache hit.
[2024-05-26 06:10:11] [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-05-26 06:10:17] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-26 06:10:18] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-26 06:10:19] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-26 06:10:21] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-26 06:10:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-26 06:10:22] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-26 06:10:23] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-26 06:10:23] [INFO ] Deduced a trap composed of 16 places in 67 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-05-26 06:10:25] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-26 06:10:25] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-26 06:10:26] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-05-26 06:10:26] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-26 06:10:26] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 1 ms to minimize.
[2024-05-26 06:10:26] [INFO ] Deduced a trap composed of 69 places in 121 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-05-26 06:10:33] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-26 06:10:33] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-05-26 06:10:33] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-26 06:10:33] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-05-26 06:10:33] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-26 06:10:34] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
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 30022 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-05-26 06:10:44] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2024-05-26 06:10:44] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-05-26 06:10:45] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-26 06:10:48] [INFO ] Deduced a trap composed of 26 places in 51 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-05-26 06:10:50] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-26 06:10:52] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-26 06:10:52] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-26 06:10:53] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2024-05-26 06:10:53] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2024-05-26 06:10:55] [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-05-26 06:10:58] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-05-26 06:10:59] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-26 06:11:02] [INFO ] Deduced a trap composed of 15 places in 41 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-05-26 06:11:05] [INFO ] Deduced a trap composed of 27 places in 117 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: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 0)
(s155 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 30028 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 60369ms problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
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 61157 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 117 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 90 ms :[true, (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (188 resets) in 571 ms. (69 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-05-26 06:11:12] [INFO ] Invariant cache hit.
[2024-05-26 06:11:12] [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 364 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 404 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 774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 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 6 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 (193 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 353728 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 353728 steps, saw 96565 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-26 06:11:16] [INFO ] Invariant cache hit.
[2024-05-26 06:11:16] [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 356 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 433 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 796ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 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-05-26 06:11:17] [INFO ] Invariant cache hit.
[2024-05-26 06:11:17] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 06:11:17] [INFO ] Invariant cache hit.
[2024-05-26 06:11:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 06:11:18] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2024-05-26 06:11:18] [INFO ] Redundant transitions in 10 ms returned []
Running 845 sub problems to find dead transitions.
[2024-05-26 06:11:18] [INFO ] Invariant cache hit.
[2024-05-26 06:11:18] [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-05-26 06:11:24] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-26 06:11:24] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-26 06:11:25] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-26 06:11:25] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-26 06:11:25] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-26 06:11:25] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-26 06:11:25] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-05-26 06:11:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-26 06:11:26] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-26 06:11:27] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-26 06:11:28] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-26 06:11:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-26 06:11:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-26 06:11:29] [INFO ] Deduced a trap composed of 16 places in 63 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-05-26 06:11:31] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-26 06:11:32] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-26 06:11:32] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-05-26 06:11:32] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-26 06:11:33] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-26 06:11:33] [INFO ] Deduced a trap composed of 69 places in 112 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-05-26 06:11:39] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-26 06:11:39] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2024-05-26 06:11:39] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2024-05-26 06:11:39] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-05-26 06:11:40] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-26 06:11:40] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
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 30023 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-05-26 06:11:50] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 1 ms to minimize.
[2024-05-26 06:11:51] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-26 06:11:51] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-26 06:11:54] [INFO ] Deduced a trap composed of 26 places in 55 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-05-26 06:11:56] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-26 06:11:58] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-26 06:11:58] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-26 06:11:59] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2024-05-26 06:12:00] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-26 06:12:01] [INFO ] Deduced a trap composed of 42 places in 58 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-05-26 06:12:05] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-26 06:12:06] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-26 06:12:08] [INFO ] Deduced a trap composed of 15 places in 42 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-05-26 06:12:12] [INFO ] Deduced a trap composed of 27 places in 121 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 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 60344ms problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61028 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 17 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-05-26 06:12:18] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 06:12:18] [INFO ] [Real]Absence check using 57 positive place invariants in 12 ms returned sat
[2024-05-26 06:12:18] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 06:12:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 06:12:19] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 06:12:19] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 06:12:19] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 724 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 186 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 109 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Entered a terminal (fully accepting) state of product in 55615 steps with 274 reset in 228 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 201662 ms.
All properties solved by simple procedures.
Total runtime 939611 ms.

BK_STOP 1716703940043

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r246-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 ;