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.r355-tall-171683760101052.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 ShieldRVt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760101052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 ShieldRVt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717091750176

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 17:55:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 17:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:55:51] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2024-05-30 17:55:51] [INFO ] Transformed 5003 places.
[2024-05-30 17:55:51] [INFO ] Transformed 5003 transitions.
[2024-05-30 17:55:51] [INFO ] Found NUPN structural information;
[2024-05-30 17:55:51] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1093 places :
Symmetric choice reduction at 0 with 1093 rule applications. Total rules 1093 place count 3910 transition count 3910
Iterating global reduction 0 with 1093 rules applied. Total rules applied 2186 place count 3910 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2187 place count 3909 transition count 3909
Iterating global reduction 0 with 1 rules applied. Total rules applied 2188 place count 3909 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2189 place count 3908 transition count 3908
Iterating global reduction 0 with 1 rules applied. Total rules applied 2190 place count 3908 transition count 3908
Applied a total of 2190 rules in 1843 ms. Remains 3908 /5003 variables (removed 1095) and now considering 3908/5003 (removed 1095) transitions.
// Phase 1: matrix 3908 rows 3908 cols
[2024-05-30 17:55:54] [INFO ] Computed 401 invariants in 47 ms
[2024-05-30 17:55:55] [INFO ] Implicit Places using invariants in 1290 ms returned []
[2024-05-30 17:55:55] [INFO ] Invariant cache hit.
[2024-05-30 17:56:00] [INFO ] Implicit Places using invariants and state equation in 4586 ms returned []
Implicit Place search using SMT with State Equation took 5907 ms to find 0 implicit places.
Running 3907 sub problems to find dead transitions.
[2024-05-30 17:56:00] [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 3907/7816 variables, and 0 constraints, problems are : Problem set: 0 solved, 3907 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3908 constraints, PredecessorRefiner: 3907/3907 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3907/7816 variables, and 0 constraints, problems are : Problem set: 0 solved, 3907 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3908 constraints, PredecessorRefiner: 0/3907 constraints, Known Traps: 0/0 constraints]
After SMT, in 61990ms problems are : Problem set: 0 solved, 3907 unsolved
Search for dead transitions found 0 dead transitions in 62056ms
Starting structural reductions in LTL mode, iteration 1 : 3908/5003 places, 3908/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69856 ms. Remains : 3908/5003 places, 3908/5003 transitions.
Support contains 29 out of 3908 places after structural reductions.
[2024-05-30 17:57:02] [INFO ] Flatten gal took : 244 ms
[2024-05-30 17:57:02] [INFO ] Flatten gal took : 136 ms
[2024-05-30 17:57:03] [INFO ] Input system was already deterministic with 3908 transitions.
RANDOM walk for 40000 steps (8 resets) in 2335 ms. (17 steps per ms) remains 14/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
[2024-05-30 17:57:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 233/248 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3660/3908 variables, 386/401 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3908 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3908/7816 variables, 3908/4309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7816 variables, 0/4309 constraints. Problems are: Problem set: 0 solved, 14 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 7816/7816 variables, and 4309 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3908/3908 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 233/248 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3660/3908 variables, 386/401 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 17:57:11] [INFO ] Deduced a trap composed of 37 places in 841 ms of which 112 ms to minimize.
[2024-05-30 17:57:11] [INFO ] Deduced a trap composed of 26 places in 725 ms of which 13 ms to minimize.
[2024-05-30 17:57:12] [INFO ] Deduced a trap composed of 25 places in 752 ms of which 12 ms to minimize.
[2024-05-30 17:57:13] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 13 ms to minimize.
[2024-05-30 17:57:14] [INFO ] Deduced a trap composed of 35 places in 669 ms of which 11 ms to minimize.
[2024-05-30 17:57:14] [INFO ] Deduced a trap composed of 44 places in 635 ms of which 9 ms to minimize.
SMT process timed out in 10466ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 3908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1085 transitions
Trivial Post-agglo rules discarded 1085 transitions
Performed 1085 trivial Post agglomeration. Transition count delta: 1085
Iterating post reduction 0 with 1085 rules applied. Total rules applied 1085 place count 3908 transition count 2823
Reduce places removed 1085 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1090 rules applied. Total rules applied 2175 place count 2823 transition count 2818
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2180 place count 2818 transition count 2818
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 792 Pre rules applied. Total rules applied 2180 place count 2818 transition count 2026
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 3 with 1584 rules applied. Total rules applied 3764 place count 2026 transition count 2026
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3766 place count 2024 transition count 2024
Iterating global reduction 3 with 2 rules applied. Total rules applied 3768 place count 2024 transition count 2024
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3768 place count 2024 transition count 2022
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3772 place count 2022 transition count 2022
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 1 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 5580 place count 1118 transition count 1118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5581 place count 1118 transition count 1117
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5583 place count 1117 transition count 1116
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5785 place count 1016 transition count 1213
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5987 place count 915 transition count 1313
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 6167 place count 825 transition count 1398
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6168 place count 825 transition count 1397
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6169 place count 825 transition count 1396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6170 place count 824 transition count 1396
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6171 place count 824 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6172 place count 823 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6173 place count 822 transition count 1394
Applied a total of 6173 rules in 975 ms. Remains 822 /3908 variables (removed 3086) and now considering 1394/3908 (removed 2514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 975 ms. Remains : 822/3908 places, 1394/3908 transitions.
RANDOM walk for 40000 steps (14 resets) in 788 ms. (50 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 318 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 314 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 245 ms. (162 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 313 ms. (127 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 330 ms. (120 steps per ms) remains 11/11 properties
// Phase 1: matrix 1394 rows 822 cols
[2024-05-30 17:57:17] [INFO ] Computed 400 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 97/139 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 235/374 variables, 84/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 42/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 255/629 variables, 96/276 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 48/324 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 217/846 variables, 80/404 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 40/444 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 197/1043 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1043 variables, 35/553 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 3/1046 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1046 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 155/1201 variables, 63/619 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1201 variables, 30/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1201 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 135/1336 variables, 50/699 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1336 variables, 25/724 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1336 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 132/1468 variables, 48/772 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1468 variables, 24/796 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1468 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 112/1580 variables, 44/840 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1580 variables, 22/862 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1580 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 88/1668 variables, 32/894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1668 variables, 16/910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1668 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 88/1756 variables, 32/942 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1756 variables, 16/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1756 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 75/1831 variables, 30/988 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1831 variables, 15/1003 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1831 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 47/1878 variables, 18/1021 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1878 variables, 9/1030 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1878 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 44/1922 variables, 16/1046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1922 variables, 8/1054 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1922 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 44/1966 variables, 16/1070 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1966 variables, 8/1078 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1966 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (OVERLAPS) 44/2010 variables, 16/1094 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2010 variables, 8/1102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2010 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (OVERLAPS) 44/2054 variables, 16/1118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2054 variables, 8/1126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2054 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (OVERLAPS) 44/2098 variables, 16/1142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2098 variables, 8/1150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2098 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 59 (OVERLAPS) 41/2139 variables, 16/1166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2139 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2139 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (OVERLAPS) 28/2167 variables, 12/1186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2167 variables, 6/1192 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2167 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (OVERLAPS) 22/2189 variables, 8/1200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2189 variables, 4/1204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2189 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (OVERLAPS) 19/2208 variables, 8/1212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2208 variables, 4/1216 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2208 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 71 (OVERLAPS) 8/2216 variables, 4/1220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2216 variables, 2/1222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2216 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 74 (OVERLAPS) 0/2216 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2216/2216 variables, and 1222 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5372 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 822/822 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 97/139 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 235/374 variables, 84/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 42/188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 255/629 variables, 96/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 48/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 217/846 variables, 80/415 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 40/455 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/846 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 197/1043 variables, 74/529 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1043 variables, 35/564 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1043 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 3/1046 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1046 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 155/1201 variables, 63/630 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1201 variables, 30/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1201 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 135/1336 variables, 50/710 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1336 variables, 25/735 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1336 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 132/1468 variables, 48/783 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1468 variables, 24/807 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1468 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 112/1580 variables, 44/851 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1580 variables, 22/873 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1580 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 88/1668 variables, 32/905 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1668 variables, 16/921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1668 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (OVERLAPS) 88/1756 variables, 32/953 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1756 variables, 16/969 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1756 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 75/1831 variables, 30/999 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1831 variables, 15/1014 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1831 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (OVERLAPS) 47/1878 variables, 18/1032 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1878 variables, 9/1041 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1878 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (OVERLAPS) 44/1922 variables, 16/1057 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1922 variables, 8/1065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1922 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (OVERLAPS) 44/1966 variables, 16/1081 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1966 variables, 8/1089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1966 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (OVERLAPS) 44/2010 variables, 16/1105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2010 variables, 8/1113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2010 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (OVERLAPS) 44/2054 variables, 16/1129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2054 variables, 8/1137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2054 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (OVERLAPS) 44/2098 variables, 16/1153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2098 variables, 8/1161 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2098 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (OVERLAPS) 41/2139 variables, 16/1177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2139 variables, 8/1185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2139 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (OVERLAPS) 28/2167 variables, 12/1197 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2167 variables, 6/1203 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2167 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (OVERLAPS) 22/2189 variables, 8/1211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2189 variables, 4/1215 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2189 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 70 (OVERLAPS) 19/2208 variables, 8/1223 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2208 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2208 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 73 (OVERLAPS) 8/2216 variables, 4/1231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2216 variables, 2/1233 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2216 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 76 (OVERLAPS) 0/2216 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2216/2216 variables, and 1233 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7093 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 822/822 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 12490ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1076 ms.
Support contains 12 out of 822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 1394/1394 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 1 place count 822 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 821 transition count 1393
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 818 transition count 1395
Applied a total of 8 rules in 62 ms. Remains 818 /822 variables (removed 4) and now considering 1395/1394 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 818/822 places, 1395/1394 transitions.
RANDOM walk for 40000 steps (10 resets) in 661 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 103831 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 11
Probabilistic random walk after 103831 steps, saw 63860 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1395 rows 818 cols
[2024-05-30 17:57:34] [INFO ] Computed 400 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 97/139 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 235/374 variables, 84/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 42/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 255/629 variables, 96/276 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 48/324 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 220/849 variables, 80/404 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 40/444 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 195/1044 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1044 variables, 37/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 154/1198 variables, 60/615 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1198 variables, 30/645 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1198 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 135/1333 variables, 50/695 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1333 variables, 25/720 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1333 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 132/1465 variables, 48/768 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1465 variables, 24/792 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1465 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 112/1577 variables, 44/836 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1577 variables, 22/858 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1577 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 88/1665 variables, 32/890 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1665 variables, 16/906 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1665 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 88/1753 variables, 32/938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1753 variables, 16/954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1753 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 75/1828 variables, 30/984 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1828 variables, 15/999 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1828 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 47/1875 variables, 18/1017 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1875 variables, 9/1026 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1875 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 44/1919 variables, 16/1042 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1919 variables, 8/1050 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1919 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 44/1963 variables, 16/1066 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1963 variables, 8/1074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1963 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 44/2007 variables, 16/1090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2007 variables, 8/1098 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2007 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (OVERLAPS) 44/2051 variables, 16/1114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2051 variables, 8/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2051 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (OVERLAPS) 44/2095 variables, 16/1138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2095 variables, 8/1146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2095 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (OVERLAPS) 41/2136 variables, 16/1162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2136 variables, 8/1170 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2136 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 59 (OVERLAPS) 28/2164 variables, 12/1182 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2164 variables, 6/1188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2164 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (OVERLAPS) 22/2186 variables, 8/1196 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2186 variables, 4/1200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2186 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (OVERLAPS) 19/2205 variables, 8/1208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2205 variables, 4/1212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2205 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (OVERLAPS) 8/2213 variables, 4/1216 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2213 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2213 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 71 (OVERLAPS) 0/2213 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2213/2213 variables, and 1218 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5424 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 818/818 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 30/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 97/139 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 235/374 variables, 84/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 42/188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 255/629 variables, 96/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 48/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 220/849 variables, 80/415 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 40/455 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 195/1044 variables, 74/529 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 37/566 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 154/1198 variables, 60/626 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1198 variables, 30/656 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1198 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 135/1333 variables, 50/706 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1333 variables, 25/731 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1333 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 132/1465 variables, 48/779 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1465 variables, 24/803 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1465 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 112/1577 variables, 44/847 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1577 variables, 22/869 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1577 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 88/1665 variables, 32/901 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1665 variables, 16/917 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1665 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 88/1753 variables, 32/949 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1753 variables, 16/965 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1753 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (OVERLAPS) 75/1828 variables, 30/995 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1828 variables, 15/1010 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1828 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 47/1875 variables, 18/1028 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1875 variables, 9/1037 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1875 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (OVERLAPS) 44/1919 variables, 16/1053 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1919 variables, 8/1061 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1919 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (OVERLAPS) 44/1963 variables, 16/1077 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1963 variables, 8/1085 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1963 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (OVERLAPS) 44/2007 variables, 16/1101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2007 variables, 8/1109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2007 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (OVERLAPS) 44/2051 variables, 16/1125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2051 variables, 8/1133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2051 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (OVERLAPS) 44/2095 variables, 16/1149 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2095 variables, 8/1157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2095 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (OVERLAPS) 41/2136 variables, 16/1173 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2136 variables, 8/1181 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2136 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (OVERLAPS) 28/2164 variables, 12/1193 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2164 variables, 6/1199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2164 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (OVERLAPS) 22/2186 variables, 8/1207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2186 variables, 4/1211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2186 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (OVERLAPS) 19/2205 variables, 8/1219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2205 variables, 4/1223 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2205 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 70 (OVERLAPS) 8/2213 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2213 variables, 2/1229 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2213 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 73 (OVERLAPS) 0/2213 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2213/2213 variables, and 1229 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6663 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 818/818 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 12118ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 782 ms.
Support contains 12 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 1395/1395 transitions.
Applied a total of 0 rules in 36 ms. Remains 818 /818 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 818/818 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 1395/1395 transitions.
Applied a total of 0 rules in 27 ms. Remains 818 /818 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2024-05-30 17:57:47] [INFO ] Invariant cache hit.
[2024-05-30 17:57:48] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-30 17:57:48] [INFO ] Invariant cache hit.
[2024-05-30 17:57:49] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2024-05-30 17:57:49] [INFO ] Redundant transitions in 68 ms returned []
Running 1391 sub problems to find dead transitions.
[2024-05-30 17:57:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/2213 variables, and 399 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 399/400 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 1391/1391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/817 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 2 (OVERLAPS) 1/818 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1391 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 818/2213 variables, and 400 constraints, problems are : Problem set: 0 solved, 1391 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 0/1391 constraints, Known Traps: 0/0 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 1391 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62081 ms. Remains : 818/818 places, 1395/1395 transitions.
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1199 stabilizing places and 1199 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p1||X(p2)))))))'
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 749 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-30 17:58:50] [INFO ] Computed 401 invariants in 18 ms
[2024-05-30 17:58:51] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-30 17:58:51] [INFO ] Invariant cache hit.
[2024-05-30 17:58:56] [INFO ] Implicit Places using invariants and state equation in 4502 ms returned []
Implicit Place search using SMT with State Equation took 5478 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-05-30 17:58:56] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 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 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61473ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61506ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67745 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-00
Product exploration explored 100000 steps with 3 reset in 859 ms.
Product exploration explored 100000 steps with 4 reset in 1040 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 439 ms. (90 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-30 18:00:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3902/7804 variables, 3902/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7804/7804 variables, and 4303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3902/3902 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 18:00:03] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 8 ms to minimize.
[2024-05-30 18:00:04] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 7 ms to minimize.
[2024-05-30 18:00:04] [INFO ] Deduced a trap composed of 33 places in 408 ms of which 10 ms to minimize.
[2024-05-30 18:00:05] [INFO ] Deduced a trap composed of 46 places in 387 ms of which 7 ms to minimize.
[2024-05-30 18:00:05] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 7 ms to minimize.
[2024-05-30 18:00:05] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 7 ms to minimize.
[2024-05-30 18:00:06] [INFO ] Deduced a trap composed of 28 places in 346 ms of which 7 ms to minimize.
[2024-05-30 18:00:06] [INFO ] Deduced a trap composed of 45 places in 348 ms of which 7 ms to minimize.
[2024-05-30 18:00:07] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 7 ms to minimize.
[2024-05-30 18:00:07] [INFO ] Deduced a trap composed of 57 places in 328 ms of which 6 ms to minimize.
[2024-05-30 18:00:07] [INFO ] Deduced a trap composed of 63 places in 333 ms of which 6 ms to minimize.
SMT process timed out in 7153ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 5 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
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 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 649 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 804/3902 places, 1394/3902 transitions.
RANDOM walk for 39615 steps (15 resets) in 622 ms. (63 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 3902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 375 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2024-05-30 18:00:09] [INFO ] Invariant cache hit.
[2024-05-30 18:00:10] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-30 18:00:10] [INFO ] Invariant cache hit.
[2024-05-30 18:00:15] [INFO ] Implicit Places using invariants and state equation in 4661 ms returned []
Implicit Place search using SMT with State Equation took 5653 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-05-30 18:00:15] [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)
(s3041 1.0)
(s3042 1.0)
(s3043 1.0)
(s3044 1.0)
(s3045 1.0)
(s3046 1.0)
(s3047 1.0)
(s3048 1.0)
(s3049 1.0)
(s3050 1.0)
(s3051 1.0)
(s3052 1.0)
(s3053 1.0)
(s3054 1.0)
(s3055 1.0)
(s3056 1.0)
(s3057 1.0)
(s3058 1.0)
(s3059 1.0)
(s3060 1.0)
(s3061 1.0)
(s3062 1.0)
(s3063 1.0)
(s3064 1.0)
(s3065 1.0)
(s3066 1.0)
(s3067 1.0)
(s3068 1.0)
(s3069 1.0)
(s3070 1.0)
(s3071 1.0)
(s3072 1.0)
(s3073 1.0)
(s3074 1.0)
(s3075 1.0)
(s3076 1.0)
(s3077 1.0)
(s3078 1.0)
(s3079 1.0)
(s3080 1.0)
(s3081 1.0)
(s3082 1.0)
(s3083 1.0)
(s3084 1.0)
(s3085 1.0)
(s3086 1.0)
(s3087 1.0)
(s3088 1.0)
(s3089 1.0)
(s3090 1.0)
(s3091 1.0)
(s3092 1.0)
(s3093 1.0)
(s3094 1.0)
(s3095 1.0)
(s3096 1.0)
(s3097 1.0)
(s3098 1.0)
(s3099 1.0)
(s3100 1.0)
(s3101 1.0)
(s3102 1.0)
(s3103 1.0)
(s3104 1.0)
(s3105 1.0)
(s3106 1.0)
(s3107 1.0)
(s3108 1.0)
(s3109 1.0)
(s3110 1.0)
(s3111 1.0)
(s3112 1.0)
(s3113 1.0)
(s3114 1.0)
(s3115 1.0)
(s3116 1.0)timeout

(s3117 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61493ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61524ms
Finished structural reductions in LTL mode , in 1 iterations and 67564 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 480 ms. (83 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2024-05-30 18:01:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3902/7804 variables, 3902/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7804/7804 variables, and 4303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3902/3902 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3860/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 18:01:20] [INFO ] Deduced a trap composed of 26 places in 416 ms of which 8 ms to minimize.
[2024-05-30 18:01:20] [INFO ] Deduced a trap composed of 28 places in 398 ms of which 8 ms to minimize.
[2024-05-30 18:01:21] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 8 ms to minimize.
[2024-05-30 18:01:21] [INFO ] Deduced a trap composed of 46 places in 380 ms of which 7 ms to minimize.
[2024-05-30 18:01:22] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 7 ms to minimize.
[2024-05-30 18:01:22] [INFO ] Deduced a trap composed of 24 places in 364 ms of which 7 ms to minimize.
[2024-05-30 18:01:22] [INFO ] Deduced a trap composed of 28 places in 352 ms of which 7 ms to minimize.
[2024-05-30 18:01:23] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 6 ms to minimize.
[2024-05-30 18:01:23] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 6 ms to minimize.
[2024-05-30 18:01:24] [INFO ] Deduced a trap composed of 57 places in 324 ms of which 6 ms to minimize.
[2024-05-30 18:01:24] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 6 ms to minimize.
SMT process timed out in 7061ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 5 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
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 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 631 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 631 ms. Remains : 804/3902 places, 1394/3902 transitions.
RANDOM walk for 40000 steps (15 resets) in 700 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 36147 steps (8 resets) in 269 ms. (133 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 784 ms.
Product exploration explored 100000 steps with 0 reset in 1062 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3901 transition count 3901
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3901 transition count 3901
Applied a total of 2 rules in 775 ms. Remains 3901 /3902 variables (removed 1) and now considering 3901/3902 (removed 1) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2024-05-30 18:01:28] [INFO ] Computed 401 invariants in 18 ms
[2024-05-30 18:01:29] [INFO ] Implicit Places using invariants in 960 ms returned []
[2024-05-30 18:01:29] [INFO ] Invariant cache hit.
[2024-05-30 18:01:33] [INFO ] Implicit Places using invariants and state equation in 3649 ms returned []
Implicit Place search using SMT with State Equation took 4610 ms to find 0 implicit places.
Running 3900 sub problems to find dead transitions.
[2024-05-30 18:01:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3900/7802 variables, and 0 constraints, problems are : Problem set: 0 solved, 3900 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3901 constraints, PredecessorRefiner: 3900/3900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3900/7802 variables, and 0 constraints, problems are : Problem set: 0 solved, 3900 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3901 constraints, PredecessorRefiner: 0/3900 constraints, Known Traps: 0/0 constraints]
After SMT, in 61484ms problems are : Problem set: 0 solved, 3900 unsolved
Search for dead transitions found 0 dead transitions in 61516ms
Starting structural reductions in LTL mode, iteration 1 : 3901/3902 places, 3901/3902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66913 ms. Remains : 3901/3902 places, 3901/3902 transitions.
Treatment of property ShieldRVt-PT-100B-LTLFireability-00 finished in 225178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3907 transition count 2809
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2809 transition count 2809
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2196 place count 2809 transition count 2013
Deduced a syphon composed of 796 places in 5 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3788 place count 2013 transition count 2013
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3793 place count 2008 transition count 2008
Iterating global reduction 2 with 5 rules applied. Total rules applied 3798 place count 2008 transition count 2008
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3798 place count 2008 transition count 2003
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 3808 place count 2003 transition count 2003
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 1 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5606 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 5609 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5811 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6013 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6207 place count 804 transition count 1399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6209 place count 802 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6210 place count 801 transition count 1397
Applied a total of 6210 rules in 709 ms. Remains 801 /3908 variables (removed 3107) and now considering 1397/3908 (removed 2511) transitions.
// Phase 1: matrix 1397 rows 801 cols
[2024-05-30 18:02:36] [INFO ] Computed 400 invariants in 8 ms
[2024-05-30 18:02:36] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-30 18:02:36] [INFO ] Invariant cache hit.
[2024-05-30 18:02:37] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
[2024-05-30 18:02:37] [INFO ] Redundant transitions in 18 ms returned []
Running 1393 sub problems to find dead transitions.
[2024-05-30 18:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 1.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 1.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 1.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/2198 variables, and 400 constraints, problems are : Problem set: 0 solved, 1393 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/801 constraints, PredecessorRefiner: 1393/1393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/801 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 2 (OVERLAPS) 1396/2197 variables, 801/1201 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2197 variables, 1393/2594 constraints. Problems are: Problem set: 0 solved, 1393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2197/2198 variables, and 2594 constraints, problems are : Problem set: 0 solved, 1393 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 1393/1393 constraints, Known Traps: 0/0 constraints]
After SMT, in 60707ms problems are : Problem set: 0 solved, 1393 unsolved
Search for dead transitions found 0 dead transitions in 60725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 801/3908 places, 1397/3908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63092 ms. Remains : 801/3908 places, 1397/3908 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-01
Stuttering criterion allowed to conclude after 52856 steps with 19 reset in 425 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-01 finished in 63624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 779 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-30 18:03:39] [INFO ] Computed 401 invariants in 15 ms
[2024-05-30 18:03:40] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-30 18:03:40] [INFO ] Invariant cache hit.
[2024-05-30 18:03:44] [INFO ] Implicit Places using invariants and state equation in 4144 ms returned []
Implicit Place search using SMT with State Equation took 5132 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-05-30 18:03:44] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 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 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61525ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61556ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67479 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-03
Stuttering criterion allowed to conclude after 24959 steps with 1 reset in 224 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-03 finished in 67842 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) U X((p1 U G(p2)))))'
Support contains 3 out of 3908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3908/3908 places, 3908/3908 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3902 transition count 3902
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3902 transition count 3902
Applied a total of 12 rules in 764 ms. Remains 3902 /3908 variables (removed 6) and now considering 3902/3908 (removed 6) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-30 18:04:47] [INFO ] Computed 401 invariants in 18 ms
[2024-05-30 18:04:48] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-05-30 18:04:48] [INFO ] Invariant cache hit.
[2024-05-30 18:04:53] [INFO ] Implicit Places using invariants and state equation in 4760 ms returned []
Implicit Place search using SMT with State Equation took 5755 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-05-30 18:04:53] [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 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61470ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61502ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3908 places, 3902/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68032 ms. Remains : 3902/3908 places, 3902/3908 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05
Product exploration explored 100000 steps with 53 reset in 640 ms.
Product exploration explored 100000 steps with 53 reset in 791 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3902 stabilizing places and 1198/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 186 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
[2024-05-30 18:05:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3751/3902 variables, 396/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 18:05:58] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 7 ms to minimize.
[2024-05-30 18:05:59] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 7 ms to minimize.
[2024-05-30 18:05:59] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 7 ms to minimize.
[2024-05-30 18:05:59] [INFO ] Deduced a trap composed of 57 places in 340 ms of which 7 ms to minimize.
[2024-05-30 18:06:00] [INFO ] Deduced a trap composed of 63 places in 317 ms of which 6 ms to minimize.
[2024-05-30 18:06:00] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 7 ms to minimize.
[2024-05-30 18:06:00] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 6 ms to minimize.
[2024-05-30 18:06:01] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 6 ms to minimize.
[2024-05-30 18:06:01] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 6 ms to minimize.
[2024-05-30 18:06:01] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 6 ms to minimize.
[2024-05-30 18:06:02] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3902/7804 variables, and 412 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3751/3902 variables, 396/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 11/412 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 18:06:03] [INFO ] Deduced a trap composed of 54 places in 504 ms of which 9 ms to minimize.
[2024-05-30 18:06:03] [INFO ] Deduced a trap composed of 25 places in 437 ms of which 8 ms to minimize.
[2024-05-30 18:06:04] [INFO ] Deduced a trap composed of 74 places in 427 ms of which 8 ms to minimize.
[2024-05-30 18:06:04] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 7 ms to minimize.
[2024-05-30 18:06:05] [INFO ] Deduced a trap composed of 59 places in 398 ms of which 8 ms to minimize.
[2024-05-30 18:06:05] [INFO ] Deduced a trap composed of 47 places in 357 ms of which 7 ms to minimize.
[2024-05-30 18:06:06] [INFO ] Deduced a trap composed of 48 places in 386 ms of which 7 ms to minimize.
[2024-05-30 18:06:06] [INFO ] Deduced a trap composed of 60 places in 390 ms of which 8 ms to minimize.
[2024-05-30 18:06:07] [INFO ] Deduced a trap composed of 93 places in 377 ms of which 7 ms to minimize.
[2024-05-30 18:06:07] [INFO ] Deduced a trap composed of 46 places in 347 ms of which 7 ms to minimize.
SMT process timed out in 10150ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5592 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 5595 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 903 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 806 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1400
Applied a total of 6196 rules in 570 ms. Remains 804 /3902 variables (removed 3098) and now considering 1400/3902 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 804/3902 places, 1400/3902 transitions.
RANDOM walk for 40000 steps (8 resets) in 1275 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 346 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 355 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (10 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 128739 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 5
Probabilistic random walk after 128739 steps, saw 79615 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 1400 rows 804 cols
[2024-05-30 18:06:11] [INFO ] Computed 400 invariants in 8 ms
[2024-05-30 18:06:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 131/282 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 23/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 132/414 variables, 48/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 24/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 129/543 variables, 48/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 116/659 variables, 44/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/659 variables, 22/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 110/769 variables, 40/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/769 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 85/854 variables, 34/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/854 variables, 17/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 69/923 variables, 26/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 13/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 66/989 variables, 24/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/989 variables, 12/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 66/1055 variables, 24/566 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1055 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 66/1121 variables, 24/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1121 variables, 12/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 66/1187 variables, 24/638 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1187 variables, 12/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 66/1253 variables, 24/674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1253 variables, 12/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 66/1319 variables, 24/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1319 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 66/1385 variables, 24/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1385 variables, 12/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 66/1451 variables, 24/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1451 variables, 12/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 66/1517 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1517 variables, 12/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 66/1583 variables, 24/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1583 variables, 12/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 66/1649 variables, 24/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1649 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 66/1715 variables, 24/926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1715 variables, 12/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 66/1781 variables, 24/962 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1781 variables, 12/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 66/1847 variables, 24/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1847 variables, 12/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 66/1913 variables, 24/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1913 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 66/1979 variables, 24/1070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1979 variables, 12/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 66/2045 variables, 24/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2045 variables, 12/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (OVERLAPS) 53/2098 variables, 22/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2098 variables, 11/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (OVERLAPS) 25/2123 variables, 10/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2123 variables, 5/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (OVERLAPS) 22/2145 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2145 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (OVERLAPS) 22/2167 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2167 variables, 4/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (OVERLAPS) 20/2187 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2187 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (OVERLAPS) 14/2201 variables, 6/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2201 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (OVERLAPS) 3/2204 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2204 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (OVERLAPS) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2204/2204 variables, and 1214 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3278 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 131/282 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 132/414 variables, 48/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 24/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 129/543 variables, 48/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 24/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 116/659 variables, 44/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 22/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/659 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 110/769 variables, 40/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 85/854 variables, 34/455 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/854 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 69/923 variables, 26/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 13/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 66/989 variables, 24/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/989 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 66/1055 variables, 24/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 12/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1055 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 66/1121 variables, 24/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 12/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1121 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 66/1187 variables, 24/643 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 12/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1187 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 66/1253 variables, 24/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 12/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1253 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 66/1319 variables, 24/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 12/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1319 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 66/1385 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 12/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1385 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 66/1451 variables, 24/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 12/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1451 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 66/1517 variables, 24/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1517 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 66/1583 variables, 24/859 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 12/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1583 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 66/1649 variables, 24/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 12/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1649 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 66/1715 variables, 24/931 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 12/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1715 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 66/1781 variables, 24/967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 12/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1781 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 66/1847 variables, 24/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 12/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1847 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 66/1913 variables, 24/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 12/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1913 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 66/1979 variables, 24/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 12/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1979 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (OVERLAPS) 66/2045 variables, 24/1111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 12/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2045 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (OVERLAPS) 53/2098 variables, 22/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 11/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2098 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (OVERLAPS) 25/2123 variables, 10/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 5/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2123 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (OVERLAPS) 22/2145 variables, 8/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2145 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (OVERLAPS) 22/2167 variables, 8/1191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 4/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2167 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (OVERLAPS) 20/2187 variables, 8/1203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2187 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (OVERLAPS) 14/2201 variables, 6/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 3/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2201 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (OVERLAPS) 3/2204 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 106 (OVERLAPS) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2204/2204 variables, and 1219 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3914 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 7218ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2044 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 24 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 804/804 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 24 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-30 18:06:21] [INFO ] Invariant cache hit.
[2024-05-30 18:06:21] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-30 18:06:21] [INFO ] Invariant cache hit.
[2024-05-30 18:06:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 18:06:22] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2024-05-30 18:06:22] [INFO ] Redundant transitions in 79 ms returned []
Running 1396 sub problems to find dead transitions.
[2024-05-30 18:06:22] [INFO ] Invariant cache hit.
[2024-05-30 18:06:22] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 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 803/2204 variables, and 396 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 396/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1396/1396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 2 (OVERLAPS) 1/804 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
[2024-05-30 18:07:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 1)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 1)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 1)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 1)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 1)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 1)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 1)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 1)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 1)
(s377 1)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 1)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 1)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 1)
(s423 1)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 1)
(s431 1)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 1)
(s447 1)
(s448 0)
(s449 1)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 1)
(s455 1)
(s456 0)
(s457 1)
(s458 0)
(s459 0)
(s460 1)
(s461 0)
(s462 1)
(s463 1)
(s464 0)
(s465 1)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 1)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 1)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 1)
(s495 1)
(s496 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/2204 variables, and 401 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1396 constraints, Known Traps: 1/1 constraints]
After SMT, in 60596ms problems are : Problem set: 0 solved, 1396 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62259 ms. Remains : 804/804 places, 1400/1400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 399 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2787 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 572 vertex of which 6 / 572 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 282 edges and 566 vertex of which 6 / 566 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 563 transition count 983
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 279 edges and 560 vertex of which 6 / 560 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 16 rules applied. Total rules applied 578 place count 557 transition count 971
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 593 place count 550 transition count 960
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 274 edges and 546 vertex of which 10 / 546 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 613 place count 541 transition count 945
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 268 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 25 rules applied. Total rules applied 638 place count 532 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 263 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 659 place count 523 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 515 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 507 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 499 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 491 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 483 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 475 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 467 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 459 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 451 transition count 785
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 849 place count 443 transition count 771
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 219 edges and 439 vertex of which 8 / 439 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 868 place count 435 transition count 757
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 215 edges and 431 vertex of which 8 / 431 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 887 place count 427 transition count 743
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 211 edges and 423 vertex of which 8 / 423 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 906 place count 419 transition count 729
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 207 edges and 415 vertex of which 8 / 415 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 925 place count 411 transition count 715
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 203 edges and 407 vertex of which 8 / 407 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 944 place count 403 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 199 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 963 place count 395 transition count 687
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 195 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 982 place count 387 transition count 673
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 191 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1001 place count 379 transition count 659
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1020 place count 371 transition count 645
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1039 place count 363 transition count 631
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1058 place count 355 transition count 617
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1077 place count 347 transition count 603
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1096 place count 339 transition count 589
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1115 place count 331 transition count 575
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1134 place count 323 transition count 561
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1153 place count 315 transition count 547
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 311 vertex of which 8 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1172 place count 307 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 303 vertex of which 8 / 303 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1191 place count 299 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 295 vertex of which 8 / 295 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1210 place count 291 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1229 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1248 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1267 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 19 rules applied. Total rules applied 1286 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 19 rules applied. Total rules applied 1305 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 72 with 19 rules applied. Total rules applied 1362 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 73 with 19 rules applied. Total rules applied 1381 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 19 rules applied. Total rules applied 1400 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 75 with 19 rules applied. Total rules applied 1419 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 76 with 19 rules applied. Total rules applied 1438 place count 195 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 77 with 19 rules applied. Total rules applied 1457 place count 187 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 78 with 19 rules applied. Total rules applied 1476 place count 179 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 79 with 19 rules applied. Total rules applied 1495 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 80 with 19 rules applied. Total rules applied 1514 place count 164 transition count 281
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 79 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 81 with 14 rules applied. Total rules applied 1528 place count 159 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 82 with 9 rules applied. Total rules applied 1537 place count 156 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 83 with 5 rules applied. Total rules applied 1542 place count 155 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 84 with 2 Pre rules applied. Total rules applied 1542 place count 155 transition count 259
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 84 with 5 rules applied. Total rules applied 1547 place count 152 transition count 259
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 2 places and 0 transitions.
Iterating global reduction 84 with 3 rules applied. Total rules applied 1550 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 84 with 4 rules applied. Total rules applied 1554 place count 150 transition count 254
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1555 place count 150 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1556 place count 150 transition count 253
Applied a total of 1556 rules in 297 ms. Remains 150 /804 variables (removed 654) and now considering 253/1400 (removed 1147) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 253 rows 150 cols
[2024-05-30 18:07:23] [INFO ] Computed 74 invariants in 1 ms
[2024-05-30 18:07:23] [INFO ] [Real]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-05-30 18:07:23] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-30 18:07:23] [INFO ] [Nat]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-05-30 18:07:24] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-30 18:07:24] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-30 18:07:24] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 692 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 14 factoid took 313 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-30 18:07:24] [INFO ] Computed 401 invariants in 16 ms
[2024-05-30 18:07:27] [INFO ] [Real]Absence check using 401 positive place invariants in 936 ms returned sat
[2024-05-30 18:07:39] [INFO ] [Real]Absence check using state equation in 12384 ms returned unknown
Could not prove EG (NOT p2)
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 359 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2024-05-30 18:07:40] [INFO ] Invariant cache hit.
[2024-05-30 18:07:41] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-30 18:07:41] [INFO ] Invariant cache hit.
[2024-05-30 18:07:45] [INFO ] Implicit Places using invariants and state equation in 4712 ms returned []
Implicit Place search using SMT with State Equation took 5681 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-05-30 18:07:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 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 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61432ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61464ms
Finished structural reductions in LTL mode , in 1 iterations and 67514 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3902 stabilizing places and 1198/3902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 183 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 1080 ms. (37 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
[2024-05-30 18:08:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3751/3902 variables, 396/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 18:08:49] [INFO ] Deduced a trap composed of 23 places in 371 ms of which 7 ms to minimize.
[2024-05-30 18:08:50] [INFO ] Deduced a trap composed of 34 places in 366 ms of which 7 ms to minimize.
[2024-05-30 18:08:50] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 7 ms to minimize.
[2024-05-30 18:08:50] [INFO ] Deduced a trap composed of 57 places in 379 ms of which 7 ms to minimize.
[2024-05-30 18:08:51] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 6 ms to minimize.
[2024-05-30 18:08:51] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 15 ms to minimize.
[2024-05-30 18:08:52] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 7 ms to minimize.
[2024-05-30 18:08:52] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 6 ms to minimize.
[2024-05-30 18:08:52] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 6 ms to minimize.
[2024-05-30 18:08:53] [INFO ] Deduced a trap composed of 58 places in 294 ms of which 6 ms to minimize.
[2024-05-30 18:08:53] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 6 ms to minimize.
SMT process timed out in 5148ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 6 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5592 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 5595 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 903 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 806 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1400
Applied a total of 6196 rules in 571 ms. Remains 804 /3902 variables (removed 3098) and now considering 1400/3902 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 804/3902 places, 1400/3902 transitions.
RANDOM walk for 40000 steps (15 resets) in 1526 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 402 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 395 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 119478 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 5
Probabilistic random walk after 119478 steps, saw 73888 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 1400 rows 804 cols
[2024-05-30 18:08:58] [INFO ] Computed 400 invariants in 2 ms
[2024-05-30 18:08:58] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 131/282 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 23/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 132/414 variables, 48/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 24/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 129/543 variables, 48/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 116/659 variables, 44/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/659 variables, 22/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 110/769 variables, 40/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/769 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 85/854 variables, 34/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/854 variables, 17/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 69/923 variables, 26/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/923 variables, 13/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 66/989 variables, 24/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/989 variables, 12/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 66/1055 variables, 24/566 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1055 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 66/1121 variables, 24/602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1121 variables, 12/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 66/1187 variables, 24/638 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1187 variables, 12/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 66/1253 variables, 24/674 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1253 variables, 12/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 66/1319 variables, 24/710 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1319 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 66/1385 variables, 24/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1385 variables, 12/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (OVERLAPS) 66/1451 variables, 24/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1451 variables, 12/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (OVERLAPS) 66/1517 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1517 variables, 12/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (OVERLAPS) 66/1583 variables, 24/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1583 variables, 12/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (OVERLAPS) 66/1649 variables, 24/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1649 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (OVERLAPS) 66/1715 variables, 24/926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1715 variables, 12/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (OVERLAPS) 66/1781 variables, 24/962 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1781 variables, 12/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (OVERLAPS) 66/1847 variables, 24/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1847 variables, 12/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (OVERLAPS) 66/1913 variables, 24/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1913 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (OVERLAPS) 66/1979 variables, 24/1070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1979 variables, 12/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (OVERLAPS) 66/2045 variables, 24/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2045 variables, 12/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (OVERLAPS) 53/2098 variables, 22/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2098 variables, 11/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (OVERLAPS) 25/2123 variables, 10/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2123 variables, 5/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (OVERLAPS) 22/2145 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2145 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (OVERLAPS) 22/2167 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2167 variables, 4/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (OVERLAPS) 20/2187 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2187 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (OVERLAPS) 14/2201 variables, 6/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2201 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (OVERLAPS) 3/2204 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2204 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (OVERLAPS) 0/2204 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2204/2204 variables, and 1214 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3482 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/54 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 97/151 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 131/282 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 23/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 132/414 variables, 48/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 24/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 129/543 variables, 48/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 24/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 116/659 variables, 44/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 22/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/659 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 110/769 variables, 40/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 85/854 variables, 34/455 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/854 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 69/923 variables, 26/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/923 variables, 13/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/923 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 66/989 variables, 24/535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/989 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/989 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 66/1055 variables, 24/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1055 variables, 12/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1055 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 66/1121 variables, 24/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1121 variables, 12/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1121 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 66/1187 variables, 24/643 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1187 variables, 12/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1187 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 66/1253 variables, 24/679 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1253 variables, 12/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1253 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 66/1319 variables, 24/715 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1319 variables, 12/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1319 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 66/1385 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1385 variables, 12/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1385 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 66/1451 variables, 24/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1451 variables, 12/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1451 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 66/1517 variables, 24/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1517 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1517 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 66/1583 variables, 24/859 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1583 variables, 12/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1583 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 66/1649 variables, 24/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1649 variables, 12/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1649 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 66/1715 variables, 24/931 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1715 variables, 12/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1715 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 70 (OVERLAPS) 66/1781 variables, 24/967 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1781 variables, 12/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1781 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 73 (OVERLAPS) 66/1847 variables, 24/1003 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1847 variables, 12/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1847 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 76 (OVERLAPS) 66/1913 variables, 24/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1913 variables, 12/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1913 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 79 (OVERLAPS) 66/1979 variables, 24/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1979 variables, 12/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1979 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 82 (OVERLAPS) 66/2045 variables, 24/1111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2045 variables, 12/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2045 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 85 (OVERLAPS) 53/2098 variables, 22/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2098 variables, 11/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2098 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 88 (OVERLAPS) 25/2123 variables, 10/1166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2123 variables, 5/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2123 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 91 (OVERLAPS) 22/2145 variables, 8/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2145 variables, 4/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2145 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 94 (OVERLAPS) 22/2167 variables, 8/1191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2167 variables, 4/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2167 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 97 (OVERLAPS) 20/2187 variables, 8/1203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2187 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2187 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 100 (OVERLAPS) 14/2201 variables, 6/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2201 variables, 3/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2201 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 103 (OVERLAPS) 3/2204 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2204 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 106 (OVERLAPS) 0/2204 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2204/2204 variables, and 1219 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 804/804 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 7519ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1736 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 25 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 804/804 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1400/1400 transitions.
Applied a total of 0 rules in 27 ms. Remains 804 /804 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-30 18:09:07] [INFO ] Invariant cache hit.
[2024-05-30 18:09:07] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-30 18:09:07] [INFO ] Invariant cache hit.
[2024-05-30 18:09:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 18:09:09] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-05-30 18:09:09] [INFO ] Redundant transitions in 28 ms returned []
Running 1396 sub problems to find dead transitions.
[2024-05-30 18:09:09] [INFO ] Invariant cache hit.
[2024-05-30 18:09:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 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 803/2204 variables, and 396 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 396/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1396/1396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 396/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
At refinement iteration 2 (OVERLAPS) 1/804 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1396 unsolved
[2024-05-30 18:10:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/2204 variables, and 401 constraints, problems are : Problem set: 0 solved, 1396 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/804 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1396 constraints, Known Traps: 1/1 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 1396 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62238 ms. Remains : 804/804 places, 1400/1400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 399 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2787 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 572 vertex of which 6 / 572 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 282 edges and 566 vertex of which 6 / 566 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 562 place count 563 transition count 983
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 279 edges and 560 vertex of which 6 / 560 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 16 rules applied. Total rules applied 578 place count 557 transition count 971
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 593 place count 550 transition count 960
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 274 edges and 546 vertex of which 10 / 546 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 613 place count 541 transition count 945
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 268 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 34 with 25 rules applied. Total rules applied 638 place count 532 transition count 926
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 263 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 659 place count 523 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 515 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 507 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 499 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 491 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 483 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 475 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 467 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 459 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 451 transition count 785
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 849 place count 443 transition count 771
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 219 edges and 439 vertex of which 8 / 439 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 868 place count 435 transition count 757
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 215 edges and 431 vertex of which 8 / 431 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 887 place count 427 transition count 743
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 211 edges and 423 vertex of which 8 / 423 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 906 place count 419 transition count 729
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 207 edges and 415 vertex of which 8 / 415 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 925 place count 411 transition count 715
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 203 edges and 407 vertex of which 8 / 407 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 944 place count 403 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 199 edges and 399 vertex of which 8 / 399 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 963 place count 395 transition count 687
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 195 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 982 place count 387 transition count 673
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 191 edges and 383 vertex of which 8 / 383 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1001 place count 379 transition count 659
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 375 vertex of which 8 / 375 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1020 place count 371 transition count 645
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1039 place count 363 transition count 631
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1058 place count 355 transition count 617
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 351 vertex of which 8 / 351 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1077 place count 347 transition count 603
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 343 vertex of which 8 / 343 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1096 place count 339 transition count 589
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1115 place count 331 transition count 575
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 327 vertex of which 8 / 327 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1134 place count 323 transition count 561
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1153 place count 315 transition count 547
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 311 vertex of which 8 / 311 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1172 place count 307 transition count 533
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 303 vertex of which 8 / 303 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1191 place count 299 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 147 edges and 295 vertex of which 8 / 295 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1210 place count 291 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1229 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1248 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1267 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 19 rules applied. Total rules applied 1286 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 19 rules applied. Total rules applied 1305 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 72 with 19 rules applied. Total rules applied 1362 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 73 with 19 rules applied. Total rules applied 1381 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 19 rules applied. Total rules applied 1400 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 75 with 19 rules applied. Total rules applied 1419 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 76 with 19 rules applied. Total rules applied 1438 place count 195 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 77 with 19 rules applied. Total rules applied 1457 place count 187 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 78 with 19 rules applied. Total rules applied 1476 place count 179 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 79 with 19 rules applied. Total rules applied 1495 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 6 / 167 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 80 with 19 rules applied. Total rules applied 1514 place count 164 transition count 281
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 79 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 81 with 14 rules applied. Total rules applied 1528 place count 159 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 76 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 82 with 9 rules applied. Total rules applied 1537 place count 156 transition count 265
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 83 with 5 rules applied. Total rules applied 1542 place count 155 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 84 with 2 Pre rules applied. Total rules applied 1542 place count 155 transition count 259
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 84 with 5 rules applied. Total rules applied 1547 place count 152 transition count 259
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 2 places and 0 transitions.
Iterating global reduction 84 with 3 rules applied. Total rules applied 1550 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 84 with 4 rules applied. Total rules applied 1554 place count 150 transition count 254
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1555 place count 150 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 85 with 1 rules applied. Total rules applied 1556 place count 150 transition count 253
Applied a total of 1556 rules in 149 ms. Remains 150 /804 variables (removed 654) and now considering 253/1400 (removed 1147) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 253 rows 150 cols
[2024-05-30 18:10:09] [INFO ] Computed 74 invariants in 0 ms
[2024-05-30 18:10:09] [INFO ] [Real]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-05-30 18:10:09] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-30 18:10:09] [INFO ] [Nat]Absence check using 74 positive place invariants in 8 ms returned sat
[2024-05-30 18:10:10] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-30 18:10:10] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-30 18:10:10] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 530 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 14 factoid took 247 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-30 18:10:10] [INFO ] Computed 401 invariants in 14 ms
[2024-05-30 18:10:13] [INFO ] [Real]Absence check using 401 positive place invariants in 883 ms returned sat
[2024-05-30 18:10:25] [INFO ] [Real]Absence check using state equation in 12471 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 53 reset in 640 ms.
Product exploration explored 100000 steps with 53 reset in 737 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1098 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1098 place count 3902 transition count 4301
Deduced a syphon composed of 1498 places in 12 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1498 place count 3902 transition count 4301
Performed 1199 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2697 places in 9 ms
Iterating global reduction 1 with 1199 rules applied. Total rules applied 2697 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2698 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 799 places :
Symmetric choice reduction at 2 with 799 rule applications. Total rules 3497 place count 3103 transition count 3502
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 799 rules applied. Total rules applied 4296 place count 3103 transition count 3502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1899 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4297 place count 3103 transition count 3502
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4299 place count 3101 transition count 3500
Deduced a syphon composed of 1897 places in 7 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4301 place count 3101 transition count 3500
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1998 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4402 place count 3101 transition count 4232
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4503 place count 3000 transition count 4030
Deduced a syphon composed of 1897 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4604 place count 3000 transition count 4030
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1998 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4705 place count 3000 transition count 4757
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4806 place count 2899 transition count 4555
Deduced a syphon composed of 1897 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4907 place count 2899 transition count 4555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -743
Deduced a syphon composed of 1998 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5008 place count 2899 transition count 5298
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5109 place count 2798 transition count 5096
Deduced a syphon composed of 1897 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5210 place count 2798 transition count 5096
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1992 places in 2 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5305 place count 2798 transition count 5779
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5400 place count 2703 transition count 5589
Deduced a syphon composed of 1897 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5495 place count 2703 transition count 5589
Deduced a syphon composed of 1897 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5498 place count 2703 transition count 5586
Deduced a syphon composed of 1897 places in 1 ms
Applied a total of 5498 rules in 3917 ms. Remains 2703 /3902 variables (removed 1199) and now considering 5586/3902 (removed -1684) transitions.
[2024-05-30 18:10:31] [INFO ] Redundant transitions in 244 ms returned []
Running 5585 sub problems to find dead transitions.
// Phase 1: matrix 5586 rows 2703 cols
[2024-05-30 18:10:31] [INFO ] Computed 401 invariants in 65 ms
[2024-05-30 18:10:31] [INFO ] State equation strengthened by 1794 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2702/8289 variables, and 0 constraints, problems are : Problem set: 0 solved, 5585 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2703 constraints, ReadFeed: 0/1794 constraints, PredecessorRefiner: 5585/5585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2702/8289 variables, and 0 constraints, problems are : Problem set: 0 solved, 5585 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2703 constraints, ReadFeed: 0/1794 constraints, PredecessorRefiner: 0/5585 constraints, Known Traps: 0/0 constraints]
After SMT, in 88321ms problems are : Problem set: 0 solved, 5585 unsolved
Search for dead transitions found 0 dead transitions in 88368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2703/3902 places, 5586/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92550 ms. Remains : 2703/3902 places, 5586/3902 transitions.
Support contains 3 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 344 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-05-30 18:12:00] [INFO ] Computed 401 invariants in 14 ms
[2024-05-30 18:12:01] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2024-05-30 18:12:01] [INFO ] Invariant cache hit.
[2024-05-30 18:12:06] [INFO ] Implicit Places using invariants and state equation in 5114 ms returned []
Implicit Place search using SMT with State Equation took 6120 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-05-30 18:12:06] [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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-100B

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 5003
TRANSITIONS: 5003
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 11806
NUPN UNITS: 801
LOADING TIME: 3.305

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.155
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 3.899
OK.
----------------------------------------------------------------------
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: 1527
MODEL NAME: /home/mcc/execution/model
5003 places, 5003 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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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