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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 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 2.0M 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-7B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716697214978

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 04:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 04:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:20:16] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-05-26 04:20:16] [INFO ] Transformed 7014 places.
[2024-05-26 04:20:16] [INFO ] Transformed 8833 transitions.
[2024-05-26 04:20:16] [INFO ] Found NUPN structural information;
[2024-05-26 04:20:16] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-7B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 7014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1861 places :
Symmetric choice reduction at 0 with 1861 rule applications. Total rules 1861 place count 5153 transition count 6972
Iterating global reduction 0 with 1861 rules applied. Total rules applied 3722 place count 5153 transition count 6972
Discarding 493 places :
Symmetric choice reduction at 0 with 493 rule applications. Total rules 4215 place count 4660 transition count 6479
Iterating global reduction 0 with 493 rules applied. Total rules applied 4708 place count 4660 transition count 6479
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4791 place count 4577 transition count 6313
Iterating global reduction 0 with 83 rules applied. Total rules applied 4874 place count 4577 transition count 6313
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4957 place count 4494 transition count 6230
Iterating global reduction 0 with 83 rules applied. Total rules applied 5040 place count 4494 transition count 6230
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 5123 place count 4411 transition count 6147
Iterating global reduction 0 with 83 rules applied. Total rules applied 5206 place count 4411 transition count 6147
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 5288 place count 4329 transition count 6024
Iterating global reduction 0 with 82 rules applied. Total rules applied 5370 place count 4329 transition count 6024
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 5448 place count 4251 transition count 5868
Iterating global reduction 0 with 78 rules applied. Total rules applied 5526 place count 4251 transition count 5868
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 5545 place count 4251 transition count 5849
Applied a total of 5545 rules in 3682 ms. Remains 4251 /7014 variables (removed 2763) and now considering 5849/8833 (removed 2984) transitions.
// Phase 1: matrix 5849 rows 4251 cols
[2024-05-26 04:20:20] [INFO ] Computed 66 invariants in 54 ms
[2024-05-26 04:20:21] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2024-05-26 04:20:21] [INFO ] Invariant cache hit.
[2024-05-26 04:20:25] [INFO ] Implicit Places using invariants and state equation in 3864 ms returned []
Implicit Place search using SMT with State Equation took 5005 ms to find 0 implicit places.
Running 5848 sub problems to find dead transitions.
[2024-05-26 04:20:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4250/10100 variables, and 0 constraints, problems are : Problem set: 0 solved, 5848 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4251 constraints, PredecessorRefiner: 5848/5848 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5848 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4250/10100 variables, and 0 constraints, problems are : Problem set: 0 solved, 5848 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4251 constraints, PredecessorRefiner: 0/5848 constraints, Known Traps: 0/0 constraints]
After SMT, in 63584ms problems are : Problem set: 0 solved, 5848 unsolved
Search for dead transitions found 0 dead transitions in 63675ms
Starting structural reductions in LTL mode, iteration 1 : 4251/7014 places, 5849/8833 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72418 ms. Remains : 4251/7014 places, 5849/8833 transitions.
Support contains 29 out of 4251 places after structural reductions.
[2024-05-26 04:21:29] [INFO ] Flatten gal took : 311 ms
[2024-05-26 04:21:30] [INFO ] Flatten gal took : 269 ms
[2024-05-26 04:21:30] [INFO ] Input system was already deterministic with 5849 transitions.
RANDOM walk for 40000 steps (13 resets) in 1546 ms. (25 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
[2024-05-26 04:21:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1636/1653 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1653 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2598/4251 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4251 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 5849/10100 variables, 4251/4317 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10100 variables, 0/4317 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10100/10100 variables, and 4317 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4251/4251 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1636/1653 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1653 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2598/4251 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-26 04:21:38] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 25 ms to minimize.
[2024-05-26 04:21:38] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 2 ms to minimize.
[2024-05-26 04:21:39] [INFO ] Deduced a trap composed of 152 places in 133 ms of which 2 ms to minimize.
[2024-05-26 04:21:40] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
[2024-05-26 04:21:40] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4251 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4251 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 10079ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 4251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5111 edges and 4251 vertex of which 3206 / 4251 are part of one of the 33 SCC in 16 ms
Free SCC test removed 3173 places
Drop transitions (Empty/Sink Transition effects.) removed 4141 transitions
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 1078 transition count 1542
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 14 rules applied. Total rules applied 22 place count 1071 transition count 1535
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 1067 transition count 1535
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 26 place count 1067 transition count 1492
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 112 place count 1024 transition count 1492
Discarding 264 places :
Symmetric choice reduction at 3 with 264 rule applications. Total rules 376 place count 760 transition count 1105
Iterating global reduction 3 with 264 rules applied. Total rules applied 640 place count 760 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 641 place count 760 transition count 1104
Discarding 190 places :
Symmetric choice reduction at 4 with 190 rule applications. Total rules 831 place count 570 transition count 862
Iterating global reduction 4 with 190 rules applied. Total rules applied 1021 place count 570 transition count 862
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Iterating post reduction 4 with 190 rules applied. Total rules applied 1211 place count 570 transition count 672
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 5 with 294 rules applied. Total rules applied 1505 place count 423 transition count 525
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1508 place count 423 transition count 522
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1509 place count 422 transition count 521
Iterating global reduction 6 with 1 rules applied. Total rules applied 1510 place count 422 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1512 place count 421 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1513 place count 421 transition count 519
Performed 9 Post agglomeration using F-continuation condition with reduction of 33 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1531 place count 412 transition count 557
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1552 place count 412 transition count 536
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1554 place count 411 transition count 547
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1566 place count 411 transition count 535
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1584 place count 411 transition count 517
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1585 place count 410 transition count 516
Iterating global reduction 9 with 1 rules applied. Total rules applied 1586 place count 410 transition count 516
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1591 place count 410 transition count 511
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1592 place count 409 transition count 510
Iterating global reduction 9 with 1 rules applied. Total rules applied 1593 place count 409 transition count 510
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1597 place count 409 transition count 506
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1598 place count 408 transition count 505
Iterating global reduction 9 with 1 rules applied. Total rules applied 1599 place count 408 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1602 place count 408 transition count 502
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1603 place count 407 transition count 501
Iterating global reduction 9 with 1 rules applied. Total rules applied 1604 place count 407 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1605 place count 407 transition count 500
Free-agglomeration rule applied 202 times.
Iterating global reduction 10 with 202 rules applied. Total rules applied 1807 place count 407 transition count 298
Reduce places removed 202 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 548 edges and 205 vertex of which 101 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.0 ms
Discarding 104 places :
Also discarding 58 output transitions
Drop transitions (Output transitions of discarded places.) removed 58 transitions
Iterating post reduction 10 with 241 rules applied. Total rules applied 2048 place count 101 transition count 202
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 11 with 73 rules applied. Total rules applied 2121 place count 101 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 2124 place count 101 transition count 126
Graph (complete) has 252 edges and 101 vertex of which 88 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 2125 place count 88 transition count 124
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 2141 place count 88 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2143 place count 88 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 2145 place count 86 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2146 place count 85 transition count 105
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 24 edges and 76 vertex of which 7 / 76 are part of one of the 2 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 15 with 18 rules applied. Total rules applied 2164 place count 71 transition count 97
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 2184 place count 63 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 2187 place count 63 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 2190 place count 63 transition count 82
Applied a total of 2190 rules in 604 ms. Remains 63 /4251 variables (removed 4188) and now considering 82/5849 (removed 5767) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 605 ms. Remains : 63/4251 places, 82/5849 transitions.
RANDOM walk for 40000 steps (8 resets) in 547 ms. (72 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 30505 steps (6 resets) in 39 ms. (762 steps per ms) remains 0/2 properties
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' '!(G(F(p0)))'
Support contains 1 out of 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5146 edges and 4251 vertex of which 3258 / 4251 are part of one of the 33 SCC in 5 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4349 transitions
Reduce isomorphic transitions removed 4349 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 1498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1024 transition count 1498
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 3 place count 1024 transition count 1462
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 988 transition count 1462
Discarding 276 places :
Symmetric choice reduction at 2 with 276 rule applications. Total rules 351 place count 712 transition count 1052
Iterating global reduction 2 with 276 rules applied. Total rules applied 627 place count 712 transition count 1052
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 629 place count 712 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 629 place count 712 transition count 1049
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 631 place count 711 transition count 1049
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 833 place count 509 transition count 796
Iterating global reduction 3 with 202 rules applied. Total rules applied 1035 place count 509 transition count 796
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 1236 place count 509 transition count 595
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1494 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1495 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1505 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1553 place count 346 transition count 417
Applied a total of 1553 rules in 233 ms. Remains 346 /4251 variables (removed 3905) and now considering 417/5849 (removed 5432) transitions.
[2024-05-26 04:21:43] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2024-05-26 04:21:43] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 04:21:43] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-26 04:21:43] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 04:21:43] [INFO ] Invariant cache hit.
[2024-05-26 04:21:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 04:21:44] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-26 04:21:44] [INFO ] Redundant transitions in 23 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-26 04:21:44] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 04:21:44] [INFO ] Invariant cache hit.
[2024-05-26 04:21:44] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 33/346 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 384/730 variables, 346/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/730 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/731 variables, and 417 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9781 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 346/346 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 33/346 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 384/730 variables, 346/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 199/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/730 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/731 variables, and 616 constraints, problems are : Problem set: 0 solved, 199 unsolved in 10082 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 346/346 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 19898ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 19900ms
Starting structural reductions in SI_LTL mode, iteration 1 : 346/4251 places, 417/5849 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20799 ms. Remains : 346/4251 places, 417/5849 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-00 finished in 21041 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((F(G(p1))||p0)))))'
Support contains 4 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5828
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 4232 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 4232 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 4229 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 4229 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4226 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4226 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4223 transition count 5805
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4223 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 4221 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 4221 transition count 5801
Applied a total of 61 rules in 2582 ms. Remains 4221 /4251 variables (removed 30) and now considering 5801/5849 (removed 48) transitions.
// Phase 1: matrix 5801 rows 4221 cols
[2024-05-26 04:22:06] [INFO ] Computed 66 invariants in 31 ms
[2024-05-26 04:22:07] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-05-26 04:22:07] [INFO ] Invariant cache hit.
[2024-05-26 04:22:11] [INFO ] Implicit Places using invariants and state equation in 3676 ms returned []
Implicit Place search using SMT with State Equation took 4558 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2024-05-26 04:22:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints]
After SMT, in 63099ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 63148ms
Starting structural reductions in LTL mode, iteration 1 : 4221/4251 places, 5801/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70304 ms. Remains : 4221/4251 places, 5801/5849 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 727 ms.
Product exploration explored 100000 steps with 25000 reset in 687 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (13 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 240697 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 240697 steps, saw 232636 distinct states, run finished after 3004 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-26 04:23:19] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 434/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3783/4221 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4221 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5801/10022 variables, 4221/4287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10022 variables, 0/4287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/10022 variables, 0/4287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10022/10022 variables, and 4287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2352 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4221/4221 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 434/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3783/4221 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 04:23:22] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4221 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4221 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5801/10022 variables, 4221/4288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10022 variables, 2/4290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10022 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/10022 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10022/10022 variables, and 4290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3230 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4221/4221 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 5623ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1410 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=74 )
Parikh walk visited 2 properties in 27 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 4221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Applied a total of 0 rules in 331 ms. Remains 4221 /4221 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
[2024-05-26 04:23:26] [INFO ] Invariant cache hit.
[2024-05-26 04:23:27] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-26 04:23:27] [INFO ] Invariant cache hit.
[2024-05-26 04:23:30] [INFO ] Implicit Places using invariants and state equation in 3622 ms returned []
Implicit Place search using SMT with State Equation took 4398 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2024-05-26 04:23:30] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 1.0)
(s2422 1.0)
(s2423 1.0)
(s2424 1.0)
(s2425 1.0)
(s2426 1.0)
(s2427 1.0)
(s2428 1.0)
(s2429 1.0)
(s2430 1.0)
(s2431 1.0)
(s2432 1.0)
(s2433 1.0)
(s2434 1.0)
(s2435 1.0)
(s2436 1.0)
(s2437 1.0)
(s2438 1.0)
(s2439 1.0)
(s2440 1.0)
(s2441 1.0)
(s2442 1.0)
(s2443 1.0)
(s2444 1.0)
(s2445 1.0)
(s2446 1.0)
(s2447 1.0)
(s2448 1.0)
(s2449 1.0)
(s2450 1.0)
(s2451 1.0)
(s2452 1.0)
(s2453 1.0)
(s2454 1.0)
(s2455 1.0)
(s2456 1.0)
(s2457 1.0)
(s2458 1.0)
(s2459 1.0)
(s2460 1.0)
(s2461 1.0)
(s2462 1.0)
(s2463 1.0)
(s2464 1.0)
(s2465 1.0)
(s2466 1.0)
(s2467 1.0)
(s2468 1.0)
(s2469 1.0)
(s2470 1.0)
(s2471 1.0)
(s2472 1.0)
(s2473 1.0)
(s2474 1.0)
(s2475 1.0)
(s2476 1.0)
(s2477 1.0)
(s2478 1.0)
(s2479 1.0)
(s2480 1.0)
(s2481 1.0)
(s2482 1.0)
(s2483 1.0)
(s2484 1.0)
(s2485 1.0)
(s2486 1.0)
(s2487 1.0)
(s2488 1.0)
(s2489 1.0)
(s2490 1.0)
(s2491 1.0)
(s2492 1.0)
(s2493 1.0)
(s2494 1.0)
(s2495 1.0)
(s2496 1.0)
(s2497 1.0)
(s2498 1.0)
(s2499 1.0)
(s2500 1.0)
(s2501 1.0)
(s2502 1.0)
(s2503 1.0)
(s2504 1.0)
(s2505 1.0)
(s2506 1.0)
(s2507 1.0)
(s2508 1.0)
(s2509 1.0)
(s2510 1.0)
(s2511 1.0)
(s2512 1.0)
(s2513 1.0)
(s2514 1.0)
(s2515 1.0)
(s2516 1.0)
(s2517 1.0)
(s2518 1.0)
(s2519 1.0)
(s2520 1.0)
(s2521 1.0)
(s2522 1.0)
(s2523 1.0)
(s2524 1.0)
(s2525 1.0)
(s2526 1.0)
(s2527 1.0)
(s2528 1.0)
(s2529 1.0)
(s2530 1.0)
(s2531 1.0)
(s2532 1.0)
(s2533 1.0)
(s2534 1.0)
(s2535 1.0)
(s2536 1.0)
(s2537 1.0)
(s2538 1.0)
(s2539 1.0)
(s2540 1.0)
(s2541 1.0)
(s2542 1.0)
(s2543 1.0)
(s2544 1.0)
(s2545 1.0)
(s2546 1.0)
(s2547 1.0)
(s2548 1.0)
(s2549 1.0)
(s2550 1.0)
(s2551 1.0)
(s2552 1.0)
(s2553 1.0)
(s2554 1.0)
(s2555 1.0)
(s2556 1.0)
(s2557 1.0)
(s2558 1.0)
(s2559 1.0)
(s2560 1.0)
(s2561 1.0)
(s2562 1.0)
(s2563 1.0)
(s2564 1.0)
(s2565 1.0)
(s2566 1.0)
(s2567 1.0)
(s2568 1.0)
(s2569 1.0)
(s2570 1.0)
(s2571 1.0)
(s2572 1.0)
(s2573 1.0)
(s2574 1.0)
(s2575 1.0)
(s2576 1.0)
(s2577 1.0)
(s2578 1.0)
(s2579 1.0)
(s2580 1.0)
(s2581 1.0)
(s2582 1.0)
(s2583 1.0)
(s2584 1.0)
(s2585 1.0)
(s2586 1.0)
(s2587 1.0)
(s2588 1.0)
(s2589 1.0)
(s2590 1.0)
(s2591 1.0)
(s2592 1.0)
(s2593 1.0)
(s2594 1.0)
(s2595 1.0)
(s2596 1.0)
(s2597 1.0)
(s2598 1.0)
(s2599 1.0)
(s2600 1.0)
(s2601 1.0)
(s2602 1.0)
(s2603 1.0)
(s2604 1.0)
(s2605 1.0)
(s2606 1.0)
(s2607 1.0)
(s2608 1.0)
(s2609 1.0)
(s2610 1.0)
(s2611 1.0)
(s2612 1.0)
(s2613 1.0)
(s2614 1.0)
(s2615 1.0)
(s2616 1.0)
(s2617 1.0)
(s2618 1.0)
(s2619 1.0)
(s2620 1.0)
(s2621 1.0)
(s2622 1.0)
(s2623 1.0)
(s2624 1.0)
(s2625 1.0)
(s2626 1.0)
(s2627 1.0)
(s2628 1.0)
(s2629 1.0)
(s2630 1.0)
(s2631 1.0)
(s2632 1.0)
(s2633 1.0)
(s2634 1.0)
(s2635 1.0)
(s2636 1.0)
(s2637 1.0)
(s2638 1.0)
(s2639 1.0)
(s2640 1.0)
(s2641 1.0)
(s2642 1.0)
(s2643 1.0)
(s2644 1.0)
(s2645 1.0)
(s2646 1.0)
(s2647 1.0)
(s2648 1.0)
(s2649 1.0)
(s2650 1.0)
(s2651 1.0)
(s2652 1.0)
(s2653 1.0)
(s2654 1.0)
(s2655 1.0)
(s2656 1.0)
(s2657 1.0)
(s2658 1.0)
(s2659 1.0)
(s2660 1.0)
(s2661 1.0)
(s2662 1.0)
(s2663 1.0)
(s2664 1.0)
(s2665 1.0)
(s2666 1.0)
(s2667 1.0)
(s2668 1.0)
(s2669 1.0)
(s2670 1.0)
(s2671 1.0)
(s2672 1.0)
(s2673 1.0)
(s2674 1.0)
(s2675 1.0)
(s2676 1.0)
(s2677 1.0)
(s2678 1.0)
(s2679 1.0)
(s2680 1.0)
(s2681 1.0)
(s2682 1.0)
(s2683 1.0)
(s2684 1.0)
(s2685 1.0)
(s2686 1.0)
(s2687 1.0)
(s2688 1.0)
(s2689 1.0)
(s2690 1.0)
(s2691 1.0)
(s2692 1.0)
(s2693 1.0)
(s2694 1.0)
(s2695 1.0)
(s2696 1.0)
(s2697 1.0)
(s2698 1.0)
(s2699 1.0)
(s2700 1.0)
(s2701 1.0)
(s2702 1.0)
(s2703 1.0)
(s2704 1.0)
(s2705 1.0)
(s2706 1.0)
(s2707 1.0)
(s2708 1.0)
(s2709 1.0)
(s2710 1.0)
(s2711 1.0)
(s2712 1.0)
(s2713 1.0)
(s2714 1.0)
(s2715 1.0)
(s2716 1.0)
(s2717 1.0)
(s2718 1.0)
(s2719 1.0)
(s2720 1.0)
(s2721 1.0)
(s2722 1.0)
(s2723 1.0)
(s2724 1.0)
(s2725 1.0)
(s2726 1.0)
(s2727 1.0)
(s2728 1.0)
(s2729 1.0)
(s2730 1.0)
(s2731 1.0)
(s2732 1.0)
(s2733 1.0)
(s2734 1.0)
(s2735 1.0)
(s2736 1.0)
(s2737 1.0)
(s2738 1.0)
(s2739 1.0)
(s2740 1.0)
(s2741 1.0)
(s2742 1.0)
(s2743 1.0)
(s2744 1.0)
(s2745 1.0)
(s2746 1.0)
(s2747 1.0)
(s2748 1.0)
(s2749 1.0)
(s2750 1.0)
(s2751 1.0)
(s2752 1.0)
(s2753 1.0)
(s2754 1.0)
(s2755 1.0)
(s2756 1.0)
(s2757 1.0)
(s2758 1.0)
(s2759 1.0)
(s2760 1.0)
(s2761 1.0)
(s2762 1.0)
(s2763 1.0)
(s2764 1.0)
(s2765 1.0)
(s2766 1.0)
(s2767 1.0)
(s2768 1.0)
(s2769 1.0)
(s2770 1.0)
(s2771 1.0)
(s2772 1.0)
(s2773 1.0)
(s2774 1.0)
(s2775 1.0)
(s2776 1.0)
(s2777 1.0)
(s2778 1.0)
(s2779 1.0)
(s2780 1.0)
(s2781 1.0)
(s2782 1.0)
(s2783 1.0)
(s2784 1.0)
(s2785 1.0)
(s2786 1.0)
(s2787 1.0)
(s2788 1.0)
(s2789 1.0)
(s2790 1.0)
(s2791 1.0)
(s2792 1.0)
(s2793 1.0)
(s2794 1.0)
(s2795 1.0)
(s2796 1.0)
(s2797 1.0)
(s2798 1.0)
(s2799 1.0)
(s2800 1.0)
(s2801 1.0)
(s2802 1.0)
(s2803 1.0)
(s2804 1.0)
(s2805 1.0)
(s2806 1.0)
(s2807 1.0)
(s2808 1.0)
(s2809 1.0)
(s2810 1.0)
(s2811 1.0)
(s2812 1.0)
(s2813 1.0)
(s2814 1.0)
(s2815 1.0)
(s2816 1.0)
(s2817 1.0)
(s2818 1.0)
(s2819 1.0)
(s2820 1.0)
(s2821 1.0)
(s2822 1.0)
(s2823 1.0)
(s2824 1.0)
(s2825 1.0)
(s2826 1.0)
(s2827 1.0)
(s2828 1.0)
(s2829 1.0)
(s2830 1.0)
(s2831 1.0)
(s2832 1.0)
(s2833 1.0)
(s2834 1.0)
(s2835 1.0)
(s2836 1.0)
(s2837 1.0)
(s2838 1.0)
(s2839 1.0)
(s2840 1.0)
(s2841 1.0)
(s2842 1.0)
(s2843 1.0)
(s2844 1.0)
(s2845 1.0)
(s2846 1.0)
(s2847 1.0)
(s2848 1.0)
(s2849 1.0)
(s2850 1.0)
(s2851 1.0)
(s2852 1.0)
(s2853 1.0)
(s2854 1.0)
(s2855 1.0)
(s2856 1.0)
(s2857 1.0)
(s2858 1.0)
(s2859 1.0)
(s2860 1.0)
(s2861 1.0)
(s2862 1.0)
(s2863 1.0)
(s2864 1.0)
(s2865 1.0)
(s2866 1.0)
(s2867 1.0)
(s2868 1.0)
(s2869 1.0)
(s2870 1.0)
(s2871 1.0)
(s2872 1.0)
(s2873 1.0)
(s2874 1.0)
(s2875 1.0)
(s2876 1.0)
(s2877 1.0)
(s2878 1.0)
(s2879 1.0)
(s2880 1.0)
(s2881 1.0)
(s2882 1.0)
(s2883 1.0)
(s2884 1.0)
(s2885 1.0)
(s2886 1.0)
(s2887 1.0)
(s2888 1.0)
(s2889 1.0)
(s2890 1.0)
(s2891 1.0)
(s2892 1.0)
(s2893 1.0)
(s2894 1.0)
(s2895 1.0)
(s2896 1.0)
(s2897 1.0)
(s2898 1.0)
(s2899 1.0)
(s2900 1.0)
(s2901 1.0)
(s2902 1.0)
(s2903 1.0)
(s2904 1.0)
(s2905 1.0)
(s2906 1.0)
(s2907 1.0)
(s2908 1.0)
(s2909 1.0)
(s2910 1.0)
(s2911 1.0)
(s2912 1.0)
(s2913 1.0)
(s2914 1.0)
(s2915 1.0)
(s2916 1.0)
(s2917 1.0)
(s2918 1.0)
(s2919 1.0)
(s2920 1.0)
(s2921 1.0)
(s2922 1.0)
(s2923 1.0)
(s2924 1.0)
(s2925 1.0)
(s2926 1.0)
(s2927 1.0)
(s2928 1.0)
(s2929 1.0)
(s2930 1.0)
(s2931 1.0)
(s2932 1.0)
(s2933 1.0)
(s2934 1.0)
(s2935 1.0)
(s2936 1.0)
(s2937 1.0)
(s2938 1.0)
(s2939 1.0)
(s2940 1.0)
(s2941 1.0)
(s2942 1.0)
(s2943 1.0)
(s2944 1.0)
(s2945 1.0)
(s2946 1.0)
(s2947 1.0)
(s2948 1.0)
(s2949 1.0)
(s2950 1.0)
(s2951 1.0)
(s2952 1.0)
(s2953 1.0)
(s2954 1.0)
(s2955 1.0)
(s2956 1.0)
(s2957 1.0)
(s2958 1.0)
(s2959 1.0)
(s2960 1.0)
(s2961 1.0)
(s2962 1.0)
(s2963 1.0)
(s2964 1.0)
(s2965 1.0)
(s2966 1.0)
(s2967 1.0)
(s2968 1.0)
(s2969 1.0)
(s2970 1.0)
(s2971 1.0)
(s2972 1.0)
(s2973 1.0)
(s2974 1.0)
(s2975 1.0)
(s2976 1.0)
(s2977 1.0)
(s2978 1.0)
(s2979 1.0)
(s2980 1.0)
(s2981 1.0)
(s2982 1.0)
(s2983 1.0)
(s2984 1.0)
(s2985 1.0)
(s2986 1.0)
(s2987 1.0)
(s2988 1.0)
(s2989 1.0)
(s2990 1.0)
(s2991 1.0)
(s2992 1.0)
(s2993 1.0)
(s2994 1.0)
(s2995 1.0)
(s2996 1.0)
(s2997 1.0)
(s2998 1.0)
(s2999 1.0)
(s3000 1.0)
(s3001 1.0)
(s3002 1.0)
(s3003 1.0)
(s3004 1.0)
(s3005 1.0)
(s3006 1.0)
(s3007 1.0)
(s3008 1.0)
(s3009 1.0)
(s3010 1.0)
(s3011 1.0)
(s3012 1.0)
(s3013 1.0)
(s3014 1.0)
(s3015 1.0)
(s3016 1.0)
(s3017 1.0)
(s3018 1.0)
(s3019 1.0)
(s3020 1.0)
(s3021 1.0)
(s3022 1.0)
(s3023 1.0)
(s3024 1.0)
(s3025 1.0)
(s3026 1.0)
(s3027 1.0)
(s3028 1.0)
(s3029 1.0)
(s3030 1.0)
(s3031 1.0)
(s3032 1.0)
(s3033 1.0)
(s3034 1.0)
(s3035 1.0)
(s3036 1.0)
(s3037 1.0)
(s3038 1.0)
(s3039 1.0)
(s3040 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints]
After SMT, in 62977ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 63025ms
Finished structural reductions in LTL mode , in 1 iterations and 67777 ms. Remains : 4221/4221 places, 5801/5801 transitions.
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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (13 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 217908 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 217908 steps, saw 210620 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-26 04:24:37] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 434/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3783/4221 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4221 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5801/10022 variables, 4221/4287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10022 variables, 0/4287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/10022 variables, 0/4287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10022/10022 variables, and 4287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4221/4221 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 434/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3783/4221 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 04:24:40] [INFO ] Deduced a trap composed of 115 places in 95 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4221 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4221 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5801/10022 variables, 4221/4288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10022 variables, 2/4290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10022 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/10022 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10022/10022 variables, and 4290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3271 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4221/4221 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 5687ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1410 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=61 )
Parikh walk visited 2 properties in 25 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 600 ms.
Product exploration explored 100000 steps with 25000 reset in 612 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 4221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Graph (trivial) has 5102 edges and 4221 vertex of which 3231 / 4221 are part of one of the 33 SCC in 11 ms
Free SCC test removed 3198 places
Ensure Unique test removed 4312 transitions
Reduce isomorphic transitions removed 4312 transitions.
Discarding 246 places :
Symmetric choice reduction at 0 with 246 rule applications. Total rules 247 place count 777 transition count 1243
Iterating global reduction 0 with 246 rules applied. Total rules applied 493 place count 777 transition count 1243
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 691 place count 579 transition count 905
Iterating global reduction 0 with 198 rules applied. Total rules applied 889 place count 579 transition count 905
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 1087 place count 579 transition count 707
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 1087 place count 579 transition count 747
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 1120 place count 579 transition count 747
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 1143 place count 556 transition count 696
Deduced a syphon composed of 33 places in 2 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 1166 place count 556 transition count 696
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 1189 place count 533 transition count 645
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 1212 place count 533 transition count 645
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 135 rules applied. Total rules applied 1347 place count 533 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1349 place count 531 transition count 638
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1351 place count 531 transition count 638
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1353 place count 529 transition count 636
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1355 place count 529 transition count 636
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 1356 place count 529 transition count 635
Deduced a syphon composed of 143 places in 0 ms
Applied a total of 1356 rules in 318 ms. Remains 529 /4221 variables (removed 3692) and now considering 635/5801 (removed 5166) transitions.
[2024-05-26 04:24:45] [INFO ] Redundant transitions in 12 ms returned []
Running 634 sub problems to find dead transitions.
[2024-05-26 04:24:45] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 529 cols
[2024-05-26 04:24:45] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 04:24:45] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/529 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-26 04:24:55] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-26 04:24:55] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-26 04:24:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-26 04:24:55] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-26 04:24:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-26 04:24:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-26 04:24:56] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD610 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/86 constraints. Problems are: Problem set: 46 solved, 588 unsolved
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-26 04:24:57] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 8 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
Problem TDEAD166 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-26 04:24:58] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD559 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/106 constraints. Problems are: Problem set: 90 solved, 544 unsolved
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
Problem TDEAD213 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-05-26 04:25:04] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-26 04:25:05] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-26 04:25:05] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-26 04:25:05] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-26 04:25:05] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-05-26 04:25:05] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-05-26 04:25:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD535 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/126 constraints. Problems are: Problem set: 140 solved, 494 unsolved
[2024-05-26 04:25:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-05-26 04:25:07] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-05-26 04:25:07] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-05-26 04:25:07] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
[2024-05-26 04:25:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-05-26 04:25:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 6/132 constraints. Problems are: Problem set: 156 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/132 constraints. Problems are: Problem set: 156 solved, 478 unsolved
SMT process timed out in 30603ms, After SMT, problems are : Problem set: 156 solved, 478 unsolved
Search for dead transitions found 156 dead transitions in 30609ms
Found 156 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 156 transitions
Dead transitions reduction (with SMT) removed 156 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 529/4221 places, 479/5801 transitions.
Graph (complete) has 1185 edges and 529 vertex of which 386 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 386 /529 variables (removed 143) and now considering 479/479 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 386/4221 places, 479/5801 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30969 ms. Remains : 386/4221 places, 479/5801 transitions.
Support contains 4 out of 4221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4221/4221 places, 5801/5801 transitions.
Applied a total of 0 rules in 293 ms. Remains 4221 /4221 variables (removed 0) and now considering 5801/5801 (removed 0) transitions.
// Phase 1: matrix 5801 rows 4221 cols
[2024-05-26 04:25:16] [INFO ] Computed 66 invariants in 28 ms
[2024-05-26 04:25:17] [INFO ] Implicit Places using invariants in 804 ms returned []
[2024-05-26 04:25:17] [INFO ] Invariant cache hit.
[2024-05-26 04:25:21] [INFO ] Implicit Places using invariants and state equation in 3845 ms returned []
Implicit Place search using SMT with State Equation took 4651 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2024-05-26 04:25:21] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 1)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 1)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 1)
(s2164 1)
(s2165 1)
(s2166 1)
(s2167 1)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 1)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 1)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 1)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 1)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 1)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 1)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 1)
(s2252 1)
(s2253 1)
(s2254 1)
(s2255 1)
(s2256 1)
(s2257 1)
(s2258 1)
(s2259 1)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 1)
(s2264 1)
(s2265 1)
(s2266 1)
(s2267 1)
(s2268 1)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 1)
(s2273 1)
(s2274 1)
(s2275 1)
(s2276 1)
(s2277 1)
(s2278 1)
(s2279 1)
(s2280 1)
(s2281 1)
(s2282 1)
(s2283 1)
(s2284 1)
(s2285 1)
(s2286 1)
(s2287 1)
(s2288 1)
(s2289 1)
(s2290 1)
(s2291 1)
(s2292 1)
(s2293 1)
(s2294 1)
(s2295 1)
(s2296 1)
(s2297 1)
(s2298 1)
(s2299 1)
(s2300 1)
(s2301 1)
(s2302 1)
(s2303 1)
(s2304 1)
(s2305 1)
(s2306 1)
(s2307 1)
(s2308 1)
(s2309 1)
(s2310 1)
(s2311 1)
(s2312 1)
(s2313 1)
(s2314 1)
(s2315 1)
(s2316 1)
(s2317 1)
(s2318 1)
(s2319 1)
(s2320 1)
(s2321 1)
(s2322 1)
(s2323 1)
(s2324 1)
(s2325 1)
(s2326 1)
(s2327 1)
(s2328 1)
(s2329 1)
(s2330 1)
(s2331 1)
(s2332 1)
(s2333 1)
(s2334 1)
(s2335 1)
(s2336 1)
(s2337 1)
(s2338 1)
(s2339 1)
(s2340 1)
(s2341 1)
(s2342 1)
(s2343 1)
(s2344 1)
(s2345 1)
(s2346 1)
(s2347 1)
(s2348 1)
(s2349 1)
(s2350 1)
(s2351 1)
(s2352 1)
(s2353 1)
(s2354 1)
(s2355 1)
(s2356 1)
(s2357 1)
(s2358 1)
(s2359 1)
(s2360 1)
(s2361 1)
(s2362 1)
(s2363 1)
(s2364 1)
(s2365 1)
(s2366 1)
(s2367 1)
(s2368 1)
(s2369 1)
(s2370 1)
(s2371 1)
(s2372 1)
(s2373 1)
(s2374 1)
(s2375 1)
(s2376 1)
(s2377 1)
(s2378 1)
(s2379 1)
(s2380 1)
(s2381 1)
(s2382 1)
(s2383 1)
(s2384 1)
(s2385 1)
(s2386 1)
(s2387 1)
(s2388 1)
(s2389 1)
(s2390 1)
(s2391 1)
(s2392 1)
(s2393 1)
(s2394 1)
(s2395 1)
(s2396 1)
(s2397 1)
(s2398 1)
(s2399 1)
(s2400 1)
(s2401 1)
(s2402 1)
(s2403 1)
(s2404 1)
(s2405 1)
(s2406 1)
(s2407 1)
(s2408 1)
(s2409 1)
(s2410 1)
(s2411 1)
(s2412 1)
(s2413 1)
(s2414 1)
(s2415 1)
(s2416 1)
(s2417 1)
(s2418 1)
(s2419 1)
(s2420 1)
(s2421 1)
(s2422 1)
(s2423 1)
(s2424 1)
(s2425 1)
(s2426 1)
(s2427 1)
(s2428 1)
(s2429 1)
(s2430 1)
(s2431 1)
(s2432 1)
(s2433 1)
(s2434 1)
(s2435 1)
(s2436 1)
(s2437 1)
(s2438 1)
(s2439 1)
(s2440 1)
(s2441 1)
(s2442 1)
(s2443 1)
(s2444 1)
(s2445 1)
(s2446 1)
(s2447 1)
(s2448 1)
(s2449 1)
(s2450 1)
(s2451 1)
(s2452 1)
(s2453 1)
(s2454 1)
(s2455 1)
(s2456 1)
(s2457 1)
(s2458 1)
(s2459 1)
(s2460 1)
(s2461 1)
(s2462 1)
(s2463 1)
(s2464 1)
(s2465 1)
(s2466 1)
(s2467 1)
(s2468 1)
(s2469 1)
(s2470 1)
(s2471 1)
(s2472 1)
(s2473 1)
(s2474 1)
(s2475 1)
(s2476 1)
(s2477 1)
(s2478 1)
(s2479 1)
(s2480 1)
(s2481 1)
(s2482 1)
(s2483 1)
(s2484 1)
(s2485 1)
(s2486 1)
(s2487 1)
(s2488 1)
(s2489 1)
(s2490 1)
(s2491 1)
(s2492 1)
(s2493 1)
(s2494 1)
(s2495 1)
(s2496 1)
(s2497 1)
(s2498 1)
(s2499 1)
(s2500 1)
(s2501 1)
(s2502 1)
(s2503 1)
(s2504 1)
(s2505 1)
(s2506 1)
(s2507 1)
(s2508 1)
(s2509 1)
(s2510 1)
(s2511 1)
(s2512 1)
(s2513 1)
(s2514 1)
(s2515 1)
(s2516 1)
(s2517 1)
(s2518 1)
(s2519 1)
(s2520 1)
(s2521 1)
(s2522 1)
(s2523 1)
(s2524 1)
(s2525 1)
(s2526 1)
(s2527 1)
(s2528 1)
(s2529 1)
(s2530 1)
(s2531 1)
(s2532 1)
(s2533 1)
(s2534 1)
(s2535 1)
(s2536 1)
(s2537 1)
(s2538 1)
(s2539 1)
(s2540 1)
(s2541 1)
(s2542 1)
(s2543 1)
(s2544 1)
(s2545 1)
(s2546 1)
(s2547 1)
(s2548 1)
(s2549 1)
(s2550 1)
(s2551 1)
(s2552 1)
(s2553 1)
(s2554 1)
(s2555 1)
(s2556 1)
(s2557 1)
(s2558 1)
(s2559 1)
(s2560 1)
(s2561 1)
(s2562 1)
(s2563 1)
(s2564 1)
(s2565 1)
(s2566 1)
(s2567 1)
(s2568 1)
(s2569 1)
(s2570 1)
(s2571 1)
(s2572 1)
(s2573 1)
(s2574 1)
(s2575 1)
(s2576 1)
(s2577 1)
(s2578 1)
(s2579 1)
(s2580 1)
(s2581 1)
(s2582 1)
(s2583 1)
(s2584 1)
(s2585 1)
(s2586 1)
(s2587 1)
(s2588 1)
(s2589 1)
(s2590 1)
(s2591 1)
(s2592 1)
(s2593 1)
(s2594 1)
(s2595 1)
(s2596 1)
(s2597 1)
(s2598 1)
(s2599 1)
(s2600 1)
(s2601 1)
(s2602 1)
(s2603 1)
(s2604 1)
(s2605 1)
(s2606 1)
(s2607 1)
(s2608 1)
(s2609 1)
(s2610 1)
(s2611 1)
(s2612 1)
(s2613 1)
(s2614 1)
(s2615 1)
(s2616 1)
(s2617 1)
(s2618 1)
(s2619 1)
(s2620 1)
(s2621 1)
(s2622 1)
(s2623 1)
(s2624 1)
(s2625 1)
(s2626 1)
(s2627 1)
(s2628 1)
(s2629 1)
(s2630 1)
(s2631 1)
(s2632 1)
(s2633 1)
(s2634 1)
(s2635 1)
(s2636 1)
(s2637 1)
(s2638 1)
(s2639 1)
(s2640 1)
(s2641 1)
(s2642 1)
(s2643 1)
(s2644 1)
(s2645 1)
(s2646 1)
(s2647 1)
(s2648 1)
(s2649 1)
(s2650 1)
(s2651 1)
(s2652 1)
(s2653 1)
(s2654 1)
(s2655 1)
(s2656 1)
(s2657 1)
(s2658 1)
(s2659 1)
(s2660 1)
(s2661 1)
(s2662 1)
(s2663 1)
(s2664 1)
(s2665 1)
(s2666 1)
(s2667 1)
(s2668 1)
(s2669 1)
(s2670 1)
(s2671 1)
(s2672 1)
(s2673 1)
(s2674 1)
(s2675 1)
(s2676 1)
(s2677 1)
(s2678 1)
(s2679 1)
(s2680 1)
(s2681 1)
(s2682 1)
(s2683 1)
(s2684 1)
(s2685 1)
(s2686 1)
(s2687 1)
(s2688 1)
(s2689 1)
(s2690 1)
(s2691 1)
(s2692 1)
(s2693 1)
(s2694 1)
(s2695 1)
(s2696 1)
(s2697 1)
(s2698 1)
(s2699 1)
(s2700 1)
(s2701 1)
(s2702 1)
(s2703 1)
(s2704 1)
(s2705 1)
(s2706 1)
(s2707 1)
(s2708 1)
(s2709 1)
(s2710 1)
(s2711 1)
(s2712 1)
(s2713 1)
(s2714 1)
(s2715 1)
(s2716 1)
(s2717 1)
(s2718 1)
(s2719 1)
(s2720 1)
(s2721 1)
(s2722 1)
(s2723 1)
(s2724 1)
(s2725 1)
(s2726 1)
(s2727 1)
(s2728 1)
(s2729 1)
(s2730 1)
(s2731 1)
(s2732 1)
(s2733 1)
(s2734 1)
(s2735 1)
(s2736 1)
(s2737 1)
(s2738 1)
(s2739 1)
(s2740 1)
(s2741 1)
(s2742 1)
(s2743 1)
(s2744 1)
(s2745 1)
(s2746 1)
(s2747 1)
(s2748 1)
(s2749 1)
(s2750 1)
(s2751 1)
(s2752 1)
(s2753 1)
(s2754 1)
(s2755 1)
(s2756 1)
(s2757 1)
(s2758 1)
(s2759 1)
(s2760 1)
(s2761 1)
(s2762 1)
(s2763 1)
(s2764 1)
(s2765 1)
(s2766 1)
(s2767 1)
(s2768 1)
(s2769 1)
(s2770 1)
(s2771 1)
(s2772 1)
(s2773 1)
(s2774 1)
(s2775 1)
(s2776 1)
(s2777 1)
(s2778 1)
(s2779 1)
(s2780 1)
(s2781 1)
(s2782 1)
(s2783 1)
(s2784 1)
(s2785 1)
(s2786 1)
(s2787 1)
(s2788 1)
(s2789 1)
(s2790 1)
(s2791 1)
(s2792 1)
(s2793 1)
(s2794 1)
(s2795 1)
(s2796 1)
(s2797 1)
(s2798 1)
(s2799 1)
(s2800 1)
(s2801 1)
(s2802 1)
(s2803 1)
(s2804 1)
(s2805 1)
(s2806 1)
(s2807 1)
(s2808 1)
(s2809 1)
(s2810 1)
(s2811 1)
(s2812 1)
(s2813 1)
(s2814 1)
(s2815 1)
(s2816 1)
(s2817 1)
(s2818 1)
(s2819 1)
(s2820 1)
(s2821 1)
(s2822 1)
(s2823 1)
(s2824 1)
(s2825 1)
(s2826 1)
(s2827 1)
(s2828 1)
(s2829 1)
(s2830 1)
(s2831 1)
(s2832 1)
(s2833 1)
(s2834 1)
(s2835 1)
(s2836 1)
(s2837 1)
(s2838 1)
(s2839 1)
(s2840 1)
(s2841 1)
(s2842 1)
(s2843 1)
(s2844 1)
(s2845 1)
(s2846 1)
(s2847 1)
(s2848 1)
(s2849 1)
(s2850 1)
(s2851 1)
(s2852 1)
(s2853 1)
(s2854 1)
(s2855 1)
(s2856 1)
(s2857 1)
(s2858 1)
(s2859 1)
(s2860 1)
(s2861 1)
(s2862 1)
(s2863 1)
(s2864 1)
(s2865 1)
(s2866 1)
(s2867 1)
(s2868 1)
(s2869 1)
(s2870 1)
(s2871 1)
(s2872 1)
(s2873 1)
(s2874 1)
(s2875 1)
(s2876 1)
(s2877 1)
(s2878 1)
(s2879 1)
(s2880 1)
(s2881 1)
(s2882 1)
(s2883 1)
(s2884 1)
(s2885 1)
(s2886 1)
(s2887 1)
(s2888 1)
(s2889 1)
(s2890 1)
(s2891 1)
(s2892 1)
(s2893 1)
(s2894 1)
(s2895 1)
(s2896 1)
(s2897 1)
(s2898 1)
(s2899 1)
(s2900 1)
(s2901 1)
(s2902 1)
(s2903 1)
(s2904 1)
(s2905 1)
(s2906 1)
(s2907 1)
(s2908 1)
(s2909 1)
(s2910 1)
(s2911 1)
(s2912 1)
(s2913 1)
(s2914 1)
(s2915 1)
(s2916 1)
(s2917 1)
(s2918 1)
(s2919 1)
(s2920 1)
(s2921 1)
(s2922 1)
(s2923 1)
(s2924 1)
(s2925 1)
(s2926 1)
(s2927 1)
(s2928 1)
(s2929 1)
(s2930 1)
(s2931 1)
(s2932 1)
(s2933 1)
(s2934 1)
(s2935 1)
(s2936 1)
(s2937 1)
(s2938 1)
(s2939 1)
(s2940 1)
(s2941 1)
(s2942 1)
(s2943 1)
(s2944 1)
(s2945 1)
(s2946 1)
(s2947 1)
(s2948 1)
(s2949 1)
(s2950 1)
(s2951 1)
(s2952 1)
(s2953 1)
(s2954 1)
(s2955 1)
(s2956 1)
(s2957 1)
(s2958 1)
(s2959 1)
(s2960 1)
(s2961 1)
(s2962 1)
(s2963 1)
(s2964 1)
(s2965 1)
(s2966 1)
(s2967 1)
(s2968 1)
(s2969 1)
(s2970 1)
(s2971 1)
(s2972 1)
(s2973 1)
(s2974 1)
(s2975 1)
(s2976 1)
(s2977 1)
(s2978 1)
(s2979 1)
(s2980 1)
(s2981 1)
(s2982 1)
(s2983 1)
(s2984 1)
(s2985 1)
(s2986 1)
(s2987 1)
(s2988 1)
(s2989 1)
(s2990 1)
(s2991 1)
(s2992 1)
(s2993 1)
(s2994 1)
(s2995 1)
(s2996 1)
(s2997 1)
(s2998 1)
(s2999 1)
(s3000 1)
(s3001 1)
(s3002 1)
(s3003 1)
(s3004 1)
(s3005 1)
(s3006 1)
(s3007 1)
(s3008 1)
(s3009 1)
(s3010 1)
(s3011 1)
(s3012 1)
(s3013 1)
(s3014 1)
(s3015 1)
(s3016 1)
(s3017 1)
(s3018 1)
(s3019 1)
(s3020 1)
(s3021 1)
(s3022 1)
(s3023 1)
(s3024 1)
(s3025 1)
(s3026 1)
(s3027 1)
(s3028 1)
(s3029 1)
(s3030 1)
(s3031 1)
(s3032 1)
(s3033 1)
(s3034 1)
(s3035 1)
(s3036 1)
(s3037 1)
(s3038 1)
(s3039 1)
(s3040 1)
(s3041 1)
(s3042 1)
(s3043 1)
(s3044 1)
(s3045 1)
(s3046 1)
(s3047 1)
(s3048 1)
(s3049 1)
(s3050 1)
(s3051 1)
(s3052 1)
(s3053 1)
(s3054 1)
(s3055 1)
(s3056 1)
(s3057 1)
(s3058 1)
(s3059 1)
(s3060 1)
(s3061 1)
(s3062 1)
(s3063 1)
(s3064 1)
(s3065 1)
(s3066 1)
(s3067 1)
(s3068 1)
(s3069 1)
(s3070 1)
(s3071 1)
(s3072 1)
(s3073 1)
(s3074 1)
(s3075 1)
(s3076 1)
(s3077 1)
(s3078 1)
(s3079 1)
(s3080 1)
(s3081 1)
(s3082 1)
(s3083 1)
(s3084 1)
(s3085 1)
(s3086 1)
(s3087 1)
(s3088 1)
(s3089 1)
(s3090 1)
(s3091 1)
(s3092 1)
(s3093 1)
(s3094 1)
(s3095 1)
(s3096 1)
(s3097 1)
(s3098 1)
(s3099 1)
(s3100 1)
(s3101 1)
(s3102 1)
(s3103 1)
(s3104 1)
(s3105 1)
(s3106 1)
(s3107 1)
(s3108 1)
(s3109 1)
(s3110 1)
(s3111 1)
(s3112 1)
(s3113 1)
(s3114 1)
(s3115 1)
(s3116 1)
(s3117 1)
(s3118 1)
(s3119 1)
(s3120 1)
(s3121 1)
(s3122 1)
(s3123 1)
(s3124 1)
(s3125 1)
(s3126 1)
(s3127 1)
(s3128 1)
(s3129 1)
(s3130 1)
(s3131 1)
(s3132 1)
(s3133 1)
(s3134 1)
(s3135 1)
(s3136 1)
(s3137 1)
(s3138 1)
(s3139 1)
(s3140 1)
(s3141 1)
(s3142 1)
(s3143 1)
(s3144 1)
(s3145 1)
(s3146 1)
(s3147 1)
(s3148 1)
(s3149 1)
(s3150 1)
(s3151 1)
(s3152 1)
(s3153 1)
(s3154 1)
(s3155 1)
(s3156 1)
(s3157 1)
(s3158 1)
(s3159 1)
(s3160 1)
(s3161 1)
(s3162 1)
(s3163 1)
(s3164 1)
(s3165 1)
(s3166 1)
(s3167 1)
(s3168 1)
(s3169 1)
(s3170 1)
(s3171 1)
(s3172 1)
(s3173 1)
(s3174 1)
(s3175 1)
(s3176 1)
(s3177 1)
(s3178 1)
(s3179 1)
(s3180 1)
(s3181 1)
(s3182 1)
(s3183 1)
(s3184 1)
(s3185 1)
(s3186 1)
(s3187 1)
(s3188 1)
(s3189 1)
(s3190 1)
(s3191 1)
(s3192 1)
(s3193 1)
(s3194 1)
(s3195 1)
(s3196 1)
(s3197 1)
(s3198 1)
(s3199 1)
(s3200 1)
(s3201 1)
(s3202 1)
(s3203 1)
(s3204 1)
(s3205 1)
(s3206 1)
(s3207 1)
(s3208 1)
(s3209 1)
(s3210 1)
(s3211 1)
(s3212 1)
(s3213 1)
(s3214 1)
(s3215 1)
(s3216 1)
(s3217 1)
(s3218 1)
(s3219 1)
(s3220 1)
(s3221 1)
(s3222 1)
(s3223 1)
(s3224 1)
(s3225 1)
(s3226 1)
(s3227 1)
(s3228 1)
(s3229 1)
(s3230 1)
(s3231 1)
(s3232 1)
(s3233 1)
(s3234 1)
(s3235 1)
(s3236 1)
(s3237 1)
(s3238 1)
(s3239 1)
(s3240 1)
(s3241 1)
(s3242 1)
(s3243 1)
(s3244 1)
(s3245 1)
(s3246 1)
(s3247 1)
(s3248 1)
(s3249 1)timeout

(s3250 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints]
After SMT, in 63100ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 63155ms
Finished structural reductions in LTL mode , in 1 iterations and 68117 ms. Remains : 4221/4221 places, 5801/5801 transitions.
Treatment of property NoC3x3-PT-7B-LTLFireability-01 finished in 260637 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(G(p0)))))'
Support contains 1 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 4236 transition count 5826
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 4236 transition count 5826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 4236 transition count 5825
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 4231 transition count 5816
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 4231 transition count 5816
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 4228 transition count 5813
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 4228 transition count 5813
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 4225 transition count 5807
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 4225 transition count 5807
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 4222 transition count 5803
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 4222 transition count 5803
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 4220 transition count 5799
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 4220 transition count 5799
Applied a total of 63 rules in 2615 ms. Remains 4220 /4251 variables (removed 31) and now considering 5799/5849 (removed 50) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2024-05-26 04:26:27] [INFO ] Computed 66 invariants in 19 ms
[2024-05-26 04:26:28] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-05-26 04:26:28] [INFO ] Invariant cache hit.
[2024-05-26 04:26:31] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned []
Implicit Place search using SMT with State Equation took 4359 ms to find 0 implicit places.
Running 5798 sub problems to find dead transitions.
[2024-05-26 04:26:32] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4219/10019 variables, and 0 constraints, problems are : Problem set: 0 solved, 5798 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4220 constraints, PredecessorRefiner: 5798/5798 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5798 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4219/10019 variables, and 0 constraints, problems are : Problem set: 0 solved, 5798 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4220 constraints, PredecessorRefiner: 0/5798 constraints, Known Traps: 0/0 constraints]
After SMT, in 62920ms problems are : Problem set: 0 solved, 5798 unsolved
Search for dead transitions found 0 dead transitions in 62968ms
Starting structural reductions in LTL mode, iteration 1 : 4220/4251 places, 5799/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69957 ms. Remains : 4220/4251 places, 5799/5849 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-02
Product exploration explored 100000 steps with 36 reset in 445 ms.
Product exploration explored 100000 steps with 37 reset in 557 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 35295 steps (10 resets) in 213 ms. (164 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4220/4220 places, 5799/5799 transitions.
Applied a total of 0 rules in 339 ms. Remains 4220 /4220 variables (removed 0) and now considering 5799/5799 (removed 0) transitions.
[2024-05-26 04:27:37] [INFO ] Invariant cache hit.
[2024-05-26 04:27:38] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-05-26 04:27:38] [INFO ] Invariant cache hit.
[2024-05-26 04:27:41] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 4273 ms to find 0 implicit places.
Running 5798 sub problems to find dead transitions.
[2024-05-26 04:27:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4219/10019 variables, and 0 constraints, problems are : Problem set: 0 solved, 5798 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4220 constraints, PredecessorRefiner: 5798/5798 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5798 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 1)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 1)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 1)
(s2164 1)
(s2165 1)
(s2166 1)
(s2167 1)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 1)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 1)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 1)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 1)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 1)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 1)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 1)
(s2252 1)
(s2253 1)
(s2254 1)
(s2255 1)
(s2256 1)
(s2257 1)
(s2258 1)
(s2259 1)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 1)
(s2264 1)
(s2265 1)
(s2266 1)
(s2267 1)
(s2268 1)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 1)
(s2273 1)
(s2274 1)
(s2275 1)
(s2276 1)
(timeout
s2277 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4219/10019 variables, and 0 constraints, problems are : Problem set: 0 solved, 5798 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4220 constraints, PredecessorRefiner: 0/5798 constraints, Known Traps: 0/0 constraints]
After SMT, in 62927ms problems are : Problem set: 0 solved, 5798 unsolved
Search for dead transitions found 0 dead transitions in 62973ms
Finished structural reductions in LTL mode , in 1 iterations and 67600 ms. Remains : 4220/4220 places, 5799/5799 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (12 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461126 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461126 steps, saw 445717 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-05-26 04:28:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4074/4220 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4220 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5799/10019 variables, 4220/4286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10019 variables, 0/4286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/10019 variables, 0/4286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10019/10019 variables, and 4286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4220/4220 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4074/4220 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:28:50] [INFO ] Deduced a trap composed of 118 places in 224 ms of which 4 ms to minimize.
[2024-05-26 04:28:51] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 3 ms to minimize.
[2024-05-26 04:28:51] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 2 ms to minimize.
[2024-05-26 04:28:51] [INFO ] Deduced a trap composed of 142 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4220 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4220 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5799/10019 variables, 4220/4290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10019 variables, 1/4291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10019 variables, 0/4291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/10019 variables, 0/4291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10019/10019 variables, and 4291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3253 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4220/4220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 5303ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1172 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=146 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 3743 steps with 1 reset in 17 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-02 finished in 148935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1 U p2))))'
Support contains 4 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4238 transition count 5829
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4238 transition count 5829
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 4238 transition count 5828
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 4234 transition count 5820
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 4234 transition count 5820
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 4232 transition count 5818
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 4232 transition count 5818
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 4230 transition count 5816
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 4230 transition count 5816
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 4228 transition count 5814
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 4228 transition count 5814
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 4226 transition count 5810
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 4226 transition count 5810
Applied a total of 51 rules in 2543 ms. Remains 4226 /4251 variables (removed 25) and now considering 5810/5849 (removed 39) transitions.
// Phase 1: matrix 5810 rows 4226 cols
[2024-05-26 04:28:56] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 04:28:57] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-05-26 04:28:57] [INFO ] Invariant cache hit.
[2024-05-26 04:29:00] [INFO ] Implicit Places using invariants and state equation in 3586 ms returned []
Implicit Place search using SMT with State Equation took 4358 ms to find 0 implicit places.
Running 5809 sub problems to find dead transitions.
[2024-05-26 04:29:00] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4225/10036 variables, and 0 constraints, problems are : Problem set: 0 solved, 5809 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 5809/5809 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5809 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4225/10036 variables, and 0 constraints, problems are : Problem set: 0 solved, 5809 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 0/5809 constraints, Known Traps: 0/0 constraints]
After SMT, in 62918ms problems are : Problem set: 0 solved, 5809 unsolved
Search for dead transitions found 0 dead transitions in 62965ms
Starting structural reductions in LTL mode, iteration 1 : 4226/4251 places, 5810/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69879 ms. Remains : 4226/4251 places, 5810/5849 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 11306 steps with 3 reset in 55 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-04 finished in 70194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(((p2&&X(p3))||p1)))))'
Support contains 3 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5827
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5826
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 4233 transition count 5819
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 4233 transition count 5819
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 4231 transition count 5817
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 4231 transition count 5817
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 4229 transition count 5812
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 4229 transition count 5812
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 4227 transition count 5809
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 4227 transition count 5809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 4226 transition count 5807
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 4226 transition count 5807
Applied a total of 51 rules in 2493 ms. Remains 4226 /4251 variables (removed 25) and now considering 5807/5849 (removed 42) transitions.
// Phase 1: matrix 5807 rows 4226 cols
[2024-05-26 04:30:06] [INFO ] Computed 66 invariants in 22 ms
[2024-05-26 04:30:07] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-26 04:30:07] [INFO ] Invariant cache hit.
[2024-05-26 04:30:10] [INFO ] Implicit Places using invariants and state equation in 3459 ms returned []
Implicit Place search using SMT with State Equation took 4270 ms to find 0 implicit places.
Running 5806 sub problems to find dead transitions.
[2024-05-26 04:30:10] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 5806/5806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 0/5806 constraints, Known Traps: 0/0 constraints]
After SMT, in 62929ms problems are : Problem set: 0 solved, 5806 unsolved
Search for dead transitions found 0 dead transitions in 62976ms
Starting structural reductions in LTL mode, iteration 1 : 4226/4251 places, 5807/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69753 ms. Remains : 4226/4251 places, 5807/5849 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-06
Product exploration explored 100000 steps with 24970 reset in 714 ms.
Product exploration explored 100000 steps with 25033 reset in 644 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 p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 120 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 16 to 12
RANDOM walk for 40000 steps (12 resets) in 447 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 120115 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 12
Probabilistic random walk after 120115 steps, saw 116159 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-26 04:31:19] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 411/414 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3812/4226 variables, 63/66 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-26 04:31:20] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 3 ms to minimize.
[2024-05-26 04:31:21] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 3 ms to minimize.
[2024-05-26 04:31:21] [INFO ] Deduced a trap composed of 153 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4226 variables, 3/69 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4226 variables, 0/69 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5807/10033 variables, 4226/4295 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10033 variables, 0/4295 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10033/10033 variables, and 4295 constraints, problems are : Problem set: 6 solved, 6 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4226/4226 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 411/414 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3812/4226 variables, 63/66 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4226 variables, 3/69 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4226 variables, 0/69 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5807/10033 variables, 4226/4295 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10033 variables, 6/4301 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10033 variables, 0/4301 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/10033 variables, 0/4301 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10033/10033 variables, and 4301 constraints, problems are : Problem set: 6 solved, 6 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4226/4226 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 10013ms problems are : Problem set: 6 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 1278 steps, including 0 resets, run visited all 6 properties in 41 ms. (steps per millisecond=31 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 51 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) p0 p3)), (G (OR p1 p2 (NOT p0) p3)), (G (OR p1 p2 p3)), (G (OR p1 p2 p0 p3)), (G (OR p1 (NOT p2) (NOT p0) p3)), (G (OR p1 (NOT p2) p3)), (G (OR p1 p2 (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p1 p2 p0))), (F (NOT p3)), (F (NOT (AND (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 34 factoid took 402 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Applied a total of 0 rules in 346 ms. Remains 4226 /4226 variables (removed 0) and now considering 5807/5807 (removed 0) transitions.
[2024-05-26 04:31:30] [INFO ] Invariant cache hit.
[2024-05-26 04:31:31] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-26 04:31:31] [INFO ] Invariant cache hit.
[2024-05-26 04:31:35] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 4281 ms to find 0 implicit places.
Running 5806 sub problems to find dead transitions.
[2024-05-26 04:31:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 5806/5806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5806 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 0/5806 constraints, Known Traps: 0/0 constraints]
After SMT, in 62895ms problems are : Problem set: 0 solved, 5806 unsolved
Search for dead transitions found 0 dead transitions in 62942ms
Finished structural reductions in LTL mode , in 1 iterations and 67586 ms. Remains : 4226/4226 places, 5807/5807 transitions.
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 p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
RANDOM walk for 40000 steps (13 resets) in 1373 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 158753 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 6
Probabilistic random walk after 158753 steps, saw 153466 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-26 04:32:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 411/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3812/4226 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 04:32:43] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/4226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4226 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 5807/10033 variables, 4226/4293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10033 variables, 0/4293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/10033 variables, 0/4293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10033/10033 variables, and 4293 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4226/4226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 411/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3812/4226 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4226 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-26 04:32:48] [INFO ] Deduced a trap composed of 135 places in 266 ms of which 5 ms to minimize.
[2024-05-26 04:32:48] [INFO ] Deduced a trap composed of 173 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/4226 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4226 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 5807/10033 variables, 4226/4295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10033 variables, 6/4301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10033 variables, 0/4301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10033/10033 variables, and 4301 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 4226/4226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10053ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Graph (trivial) has 5108 edges and 4226 vertex of which 3231 / 4226 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3198 places
Drop transitions (Empty/Sink Transition effects.) removed 4183 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 4345 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1028 transition count 1459
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1025 transition count 1457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1024 transition count 1457
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 10 place count 1024 transition count 1420
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 84 place count 987 transition count 1420
Discarding 273 places :
Symmetric choice reduction at 3 with 273 rule applications. Total rules 357 place count 714 transition count 1011
Iterating global reduction 3 with 273 rules applied. Total rules applied 630 place count 714 transition count 1011
Discarding 199 places :
Symmetric choice reduction at 3 with 199 rule applications. Total rules 829 place count 515 transition count 770
Iterating global reduction 3 with 199 rules applied. Total rules applied 1028 place count 515 transition count 770
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 3 with 199 rules applied. Total rules applied 1227 place count 515 transition count 571
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 4 with 262 rules applied. Total rules applied 1489 place count 384 transition count 440
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1490 place count 383 transition count 439
Iterating global reduction 4 with 1 rules applied. Total rules applied 1491 place count 383 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 382 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1494 place count 382 transition count 449
Free-agglomeration rule applied 204 times.
Iterating global reduction 4 with 204 rules applied. Total rules applied 1698 place count 382 transition count 245
Reduce places removed 204 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 470 edges and 178 vertex of which 16 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.0 ms
Discarding 162 places :
Also discarding 165 output transitions
Drop transitions (Output transitions of discarded places.) removed 165 transitions
Iterating post reduction 4 with 243 rules applied. Total rules applied 1941 place count 16 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1968 place count 16 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1969 place count 15 transition count 14
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 5 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 4 rules applied. Total rules applied 1973 place count 9 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1978 place count 9 transition count 9
Applied a total of 1978 rules in 136 ms. Remains 9 /4226 variables (removed 4217) and now considering 9/5807 (removed 5798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 9/4226 places, 9/5807 transitions.
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p3))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p3))]
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Product exploration explored 100000 steps with 25044 reset in 605 ms.
Product exploration explored 100000 steps with 24998 reset in 606 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3)]
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Graph (trivial) has 5108 edges and 4226 vertex of which 3231 / 4226 are part of one of the 33 SCC in 3 ms
Free SCC test removed 3198 places
Ensure Unique test removed 4312 transitions
Reduce isomorphic transitions removed 4312 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1028 transition count 1495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1028 transition count 1494
Discarding 249 places :
Symmetric choice reduction at 2 with 249 rule applications. Total rules 255 place count 779 transition count 1245
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 2 with 249 rules applied. Total rules applied 504 place count 779 transition count 1245
Discarding 199 places :
Symmetric choice reduction at 2 with 199 rule applications. Total rules 703 place count 580 transition count 902
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 2 with 199 rules applied. Total rules applied 902 place count 580 transition count 902
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 2 with 199 rules applied. Total rules applied 1101 place count 580 transition count 703
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 1101 place count 580 transition count 751
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 1138 place count 580 transition count 751
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1164 place count 554 transition count 691
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 1190 place count 554 transition count 691
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1216 place count 528 transition count 631
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 1242 place count 528 transition count 631
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 3 with 131 rules applied. Total rules applied 1373 place count 528 transition count 631
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1376 place count 525 transition count 628
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1379 place count 525 transition count 628
Deduced a syphon composed of 142 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1380 place count 525 transition count 627
Deduced a syphon composed of 142 places in 0 ms
Applied a total of 1380 rules in 162 ms. Remains 525 /4226 variables (removed 3701) and now considering 627/5807 (removed 5180) transitions.
[2024-05-26 04:32:54] [INFO ] Redundant transitions in 7 ms returned []
Running 626 sub problems to find dead transitions.
[2024-05-26 04:32:54] [INFO ] Flow matrix only has 595 transitions (discarded 32 similar events)
// Phase 1: matrix 595 rows 525 cols
[2024-05-26 04:32:54] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 04:32:54] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (OVERLAPS) 1/525 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 626 unsolved
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-26 04:33:04] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD605 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 20/86 constraints. Problems are: Problem set: 43 solved, 583 unsolved
[2024-05-26 04:33:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
Problem TDEAD158 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-05-26 04:33:06] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-26 04:33:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-26 04:33:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD162 is UNSAT
[2024-05-26 04:33:07] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-05-26 04:33:07] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-26 04:33:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD554 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/106 constraints. Problems are: Problem set: 87 solved, 539 unsolved
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-05-26 04:33:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-26 04:33:13] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/126 constraints. Problems are: Problem set: 140 solved, 486 unsolved
[2024-05-26 04:33:15] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
Problem TDEAD261 is UNSAT
[2024-05-26 04:33:15] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-26 04:33:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-05-26 04:33:15] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-26 04:33:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD277 is UNSAT
[2024-05-26 04:33:15] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 6/132 constraints. Problems are: Problem set: 156 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/132 constraints. Problems are: Problem set: 156 solved, 470 unsolved
SMT process timed out in 30377ms, After SMT, problems are : Problem set: 156 solved, 470 unsolved
Search for dead transitions found 156 dead transitions in 30384ms
Found 156 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 156 transitions
Dead transitions reduction (with SMT) removed 156 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 525/4226 places, 471/5807 transitions.
Graph (complete) has 1170 edges and 525 vertex of which 383 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 383 /525 variables (removed 142) and now considering 471/471 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 383/4226 places, 471/5807 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30574 ms. Remains : 383/4226 places, 471/5807 transitions.
Support contains 3 out of 4226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4226/4226 places, 5807/5807 transitions.
Applied a total of 0 rules in 349 ms. Remains 4226 /4226 variables (removed 0) and now considering 5807/5807 (removed 0) transitions.
// Phase 1: matrix 5807 rows 4226 cols
[2024-05-26 04:33:25] [INFO ] Computed 66 invariants in 21 ms
[2024-05-26 04:33:26] [INFO ] Implicit Places using invariants in 811 ms returned []
[2024-05-26 04:33:26] [INFO ] Invariant cache hit.
[2024-05-26 04:33:30] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4521 ms to find 0 implicit places.
Running 5806 sub problems to find dead transitions.
[2024-05-26 04:33:30] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 5806/5806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4225/10033 variables, and 0 constraints, problems are : Problem set: 0 solved, 5806 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4226 constraints, PredecessorRefiner: 0/5806 constraints, Known Traps: 0/0 constraints]
After SMT, in 62978ms problems are : Problem set: 0 solved, 5806 unsolved
Search for dead transitions found 0 dead transitions in 63025ms
Finished structural reductions in LTL mode , in 1 iterations and 67908 ms. Remains : 4226/4226 places, 5807/5807 transitions.
Treatment of property NoC3x3-PT-7B-LTLFireability-06 finished in 269147 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))))'
Support contains 2 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5827
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5826
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 4232 transition count 5817
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 4232 transition count 5817
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 4229 transition count 5814
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 4229 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4226 transition count 5808
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4226 transition count 5808
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4223 transition count 5804
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4223 transition count 5804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 4221 transition count 5800
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 4221 transition count 5800
Applied a total of 61 rules in 2553 ms. Remains 4221 /4251 variables (removed 30) and now considering 5800/5849 (removed 49) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2024-05-26 04:34:35] [INFO ] Computed 66 invariants in 24 ms
[2024-05-26 04:34:36] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-26 04:34:36] [INFO ] Invariant cache hit.
[2024-05-26 04:34:40] [INFO ] Implicit Places using invariants and state equation in 3569 ms returned []
Implicit Place search using SMT with State Equation took 4357 ms to find 0 implicit places.
Running 5799 sub problems to find dead transitions.
[2024-05-26 04:34:40] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10021 variables, and 0 constraints, problems are : Problem set: 0 solved, 5799 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5799/5799 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10021 variables, and 0 constraints, problems are : Problem set: 0 solved, 5799 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5799 constraints, Known Traps: 0/0 constraints]
After SMT, in 62929ms problems are : Problem set: 0 solved, 5799 unsolved
Search for dead transitions found 0 dead transitions in 62975ms
Starting structural reductions in LTL mode, iteration 1 : 4221/4251 places, 5800/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69907 ms. Remains : 4221/4251 places, 5800/5849 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 782 ms.
Product exploration explored 100000 steps with 33333 reset in 747 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-07 finished in 71659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1||X(p1))) U p1))'
Support contains 3 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5831
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5831
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5830
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 4233 transition count 5823
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 4233 transition count 5823
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 4230 transition count 5820
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 4230 transition count 5820
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 4227 transition count 5814
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 4227 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 4224 transition count 5810
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 4224 transition count 5810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 4222 transition count 5806
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 4222 transition count 5806
Applied a total of 59 rules in 2615 ms. Remains 4222 /4251 variables (removed 29) and now considering 5806/5849 (removed 43) transitions.
// Phase 1: matrix 5806 rows 4222 cols
[2024-05-26 04:35:47] [INFO ] Computed 66 invariants in 21 ms
[2024-05-26 04:35:48] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-05-26 04:35:48] [INFO ] Invariant cache hit.
[2024-05-26 04:35:51] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 4368 ms to find 0 implicit places.
Running 5805 sub problems to find dead transitions.
[2024-05-26 04:35:51] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4221/10028 variables, and 0 constraints, problems are : Problem set: 0 solved, 5805 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 5805/5805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4221/10028 variables, and 0 constraints, problems are : Problem set: 0 solved, 5805 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 0/5805 constraints, Known Traps: 0/0 constraints]
After SMT, in 62947ms problems are : Problem set: 0 solved, 5805 unsolved
Search for dead transitions found 0 dead transitions in 62993ms
Starting structural reductions in LTL mode, iteration 1 : 4222/4251 places, 5806/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69992 ms. Remains : 4222/4251 places, 5806/5849 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-08 finished in 70183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p0||X(((p0 U p1) U (p0&&(p0 U p1))))))))'
Support contains 2 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4237 transition count 5828
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4237 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 4237 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 4232 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 4232 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 4229 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 4229 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 4226 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 4226 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 4223 transition count 5805
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 4223 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 4221 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 4221 transition count 5801
Applied a total of 61 rules in 2774 ms. Remains 4221 /4251 variables (removed 30) and now considering 5801/5849 (removed 48) transitions.
// Phase 1: matrix 5801 rows 4221 cols
[2024-05-26 04:36:57] [INFO ] Computed 66 invariants in 23 ms
[2024-05-26 04:36:58] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-05-26 04:36:58] [INFO ] Invariant cache hit.
[2024-05-26 04:37:02] [INFO ] Implicit Places using invariants and state equation in 3635 ms returned []
Implicit Place search using SMT with State Equation took 4431 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2024-05-26 04:37:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4220/10022 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4221 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints]
After SMT, in 62910ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 62955ms
Starting structural reductions in LTL mode, iteration 1 : 4221/4251 places, 5801/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70169 ms. Remains : 4221/4251 places, 5801/5849 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-09 finished in 70335 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 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5146 edges and 4251 vertex of which 3258 / 4251 are part of one of the 33 SCC in 1 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4349 transitions
Reduce isomorphic transitions removed 4349 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 1498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1024 transition count 1498
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 3 place count 1024 transition count 1462
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 988 transition count 1462
Discarding 276 places :
Symmetric choice reduction at 2 with 276 rule applications. Total rules 351 place count 712 transition count 1052
Iterating global reduction 2 with 276 rules applied. Total rules applied 627 place count 712 transition count 1052
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 629 place count 712 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 629 place count 712 transition count 1049
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 631 place count 711 transition count 1049
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 833 place count 509 transition count 796
Iterating global reduction 3 with 202 rules applied. Total rules applied 1035 place count 509 transition count 796
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 1236 place count 509 transition count 595
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1494 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1495 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1505 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1553 place count 346 transition count 417
Applied a total of 1553 rules in 105 ms. Remains 346 /4251 variables (removed 3905) and now considering 417/5849 (removed 5432) transitions.
[2024-05-26 04:38:05] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2024-05-26 04:38:05] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 04:38:05] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 04:38:05] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 04:38:05] [INFO ] Invariant cache hit.
[2024-05-26 04:38:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 04:38:05] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-26 04:38:06] [INFO ] Redundant transitions in 2 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-26 04:38:06] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 04:38:06] [INFO ] Invariant cache hit.
[2024-05-26 04:38:06] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 33/346 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 384/730 variables, 346/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/730 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/731 variables, and 417 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9394 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 346/346 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 33/346 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 384/730 variables, 346/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 199/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/730 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/731 variables, and 616 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9562 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 346/346 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 18978ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 18980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 346/4251 places, 417/5849 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19564 ms. Remains : 346/4251 places, 417/5849 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-10 finished in 19616 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 2 out of 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5144 edges and 4251 vertex of which 3258 / 4251 are part of one of the 33 SCC in 1 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4349 transitions
Reduce isomorphic transitions removed 4349 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 1025 transition count 1463
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 989 transition count 1463
Discarding 275 places :
Symmetric choice reduction at 0 with 275 rule applications. Total rules 348 place count 714 transition count 1054
Iterating global reduction 0 with 275 rules applied. Total rules applied 623 place count 714 transition count 1054
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 625 place count 714 transition count 1052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 625 place count 714 transition count 1051
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 627 place count 713 transition count 1051
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 828 place count 512 transition count 799
Iterating global reduction 1 with 201 rules applied. Total rules applied 1029 place count 512 transition count 799
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 1229 place count 512 transition count 599
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 1487 place count 383 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1488 place count 382 transition count 469
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 373 vertex of which 48 / 373 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 1498 place count 349 transition count 469
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1546 place count 349 transition count 421
Applied a total of 1546 rules in 98 ms. Remains 349 /4251 variables (removed 3902) and now considering 421/5849 (removed 5428) transitions.
[2024-05-26 04:38:25] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2024-05-26 04:38:25] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 04:38:25] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-26 04:38:25] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
[2024-05-26 04:38:25] [INFO ] Invariant cache hit.
[2024-05-26 04:38:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 04:38:25] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-26 04:38:25] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-26 04:38:25] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
[2024-05-26 04:38:25] [INFO ] Invariant cache hit.
[2024-05-26 04:38:25] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 33/349 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-26 04:38:27] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 388/737 variables, 349/407 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/737 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 737/738 variables, and 421 constraints, problems are : Problem set: 0 solved, 202 unsolved in 9668 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 349/349 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 33/349 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 388/737 variables, 349/407 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 202/623 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/737 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/737 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 737/738 variables, and 623 constraints, problems are : Problem set: 0 solved, 202 unsolved in 9730 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 349/349 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 1/1 constraints]
After SMT, in 19422ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 19423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 349/4251 places, 421/5849 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19973 ms. Remains : 349/4251 places, 421/5849 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-11 finished in 20028 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||G(p1)))&&F(G(p2)))))'
Support contains 3 out of 4251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Graph (trivial) has 5141 edges and 4251 vertex of which 3156 / 4251 are part of one of the 32 SCC in 2 ms
Free SCC test removed 3124 places
Ensure Unique test removed 4213 transitions
Reduce isomorphic transitions removed 4213 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 1126 transition count 1609
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 40 rules applied. Total rules applied 67 place count 1100 transition count 1595
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 77 place count 1091 transition count 1594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 1090 transition count 1594
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 78 place count 1090 transition count 1536
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 194 place count 1032 transition count 1536
Discarding 266 places :
Symmetric choice reduction at 4 with 266 rule applications. Total rules 460 place count 766 transition count 1136
Iterating global reduction 4 with 266 rules applied. Total rules applied 726 place count 766 transition count 1136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 728 place count 766 transition count 1134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 728 place count 766 transition count 1133
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 730 place count 765 transition count 1133
Discarding 194 places :
Symmetric choice reduction at 5 with 194 rule applications. Total rules 924 place count 571 transition count 891
Iterating global reduction 5 with 194 rules applied. Total rules applied 1118 place count 571 transition count 891
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Iterating post reduction 5 with 193 rules applied. Total rules applied 1311 place count 571 transition count 698
Performed 159 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 6 with 318 rules applied. Total rules applied 1629 place count 412 transition count 534
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1631 place count 412 transition count 532
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 7 with 4 rules applied. Total rules applied 1635 place count 410 transition count 530
Performed 13 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1661 place count 397 transition count 615
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 1688 place count 397 transition count 588
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 8 with 66 rules applied. Total rules applied 1754 place count 397 transition count 522
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1754 place count 397 transition count 521
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1756 place count 396 transition count 521
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1764 place count 392 transition count 552
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1770 place count 392 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1785 place count 392 transition count 531
Applied a total of 1785 rules in 149 ms. Remains 392 /4251 variables (removed 3859) and now considering 531/5849 (removed 5318) transitions.
[2024-05-26 04:38:45] [INFO ] Flow matrix only has 500 transitions (discarded 31 similar events)
// Phase 1: matrix 500 rows 392 cols
[2024-05-26 04:38:45] [INFO ] Computed 66 invariants in 3 ms
[2024-05-26 04:38:45] [INFO ] Implicit Places using invariants in 212 ms returned [10, 45, 86, 125, 180, 251, 292, 329, 372]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 223 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/4251 places, 531/5849 transitions.
Graph (trivial) has 269 edges and 383 vertex of which 46 / 383 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 359 transition count 484
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 5 place count 359 transition count 482
Applied a total of 5 rules in 22 ms. Remains 359 /383 variables (removed 24) and now considering 482/531 (removed 49) transitions.
[2024-05-26 04:38:45] [INFO ] Flow matrix only has 451 transitions (discarded 31 similar events)
// Phase 1: matrix 451 rows 359 cols
[2024-05-26 04:38:45] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 04:38:45] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-26 04:38:45] [INFO ] Flow matrix only has 451 transitions (discarded 31 similar events)
[2024-05-26 04:38:45] [INFO ] Invariant cache hit.
[2024-05-26 04:38:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 04:38:45] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 359/4251 places, 482/5849 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 832 ms. Remains : 359/4251 places, 482/5849 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-13 finished in 957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 4 out of 4251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4251/4251 places, 5849/5849 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4238 transition count 5828
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4238 transition count 5828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 4238 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 4233 transition count 5818
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 4233 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 4230 transition count 5815
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 4230 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 4227 transition count 5809
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 4227 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 4224 transition count 5805
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 4224 transition count 5805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 4222 transition count 5801
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 4222 transition count 5801
Applied a total of 59 rules in 2502 ms. Remains 4222 /4251 variables (removed 29) and now considering 5801/5849 (removed 48) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2024-05-26 04:38:48] [INFO ] Computed 66 invariants in 20 ms
[2024-05-26 04:38:49] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-05-26 04:38:49] [INFO ] Invariant cache hit.
[2024-05-26 04:38:52] [INFO ] Implicit Places using invariants and state equation in 3473 ms returned []
Implicit Place search using SMT with State Equation took 4227 ms to find 0 implicit places.
Running 5800 sub problems to find dead transitions.
[2024-05-26 04:38:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4221/10023 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 5800/5800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5800 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4221/10023 variables, and 0 constraints, problems are : Problem set: 0 solved, 5800 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/4222 constraints, PredecessorRefiner: 0/5800 constraints, Known Traps: 0/0 constraints]
After SMT, in 62901ms problems are : Problem set: 0 solved, 5800 unsolved
Search for dead transitions found 0 dead transitions in 62945ms
Starting structural reductions in LTL mode, iteration 1 : 4222/4251 places, 5801/5849 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69684 ms. Remains : 4222/4251 places, 5801/5849 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-15
Stuttering criterion allowed to conclude after 2847 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-15 finished in 69860 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((F(G(p1))||p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(((p2&&X(p3))||p1)))))'
[2024-05-26 04:39:56] [INFO ] Flatten gal took : 138 ms
[2024-05-26 04:39:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-26 04:39:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4251 places, 5849 transitions and 13035 arcs took 32 ms.
Total runtime 1180198 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-7B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/404/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4251
TRANSITIONS: 5849
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.082s, Sys 0.004s]


SAVING FILE /home/mcc/execution/404/model (.net / .def) ...
EXPORT TIME: [User 0.018s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2091
MODEL NAME: /home/mcc/execution/404/model
4251 places, 5849 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML