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.r464-smll-171620117800099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 921K May 18 16:42 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 ASLink-PT-06b-LTLCardinality-00
FORMULA_NAME ASLink-PT-06b-LTLCardinality-01
FORMULA_NAME ASLink-PT-06b-LTLCardinality-02
FORMULA_NAME ASLink-PT-06b-LTLCardinality-03
FORMULA_NAME ASLink-PT-06b-LTLCardinality-04
FORMULA_NAME ASLink-PT-06b-LTLCardinality-05
FORMULA_NAME ASLink-PT-06b-LTLCardinality-06
FORMULA_NAME ASLink-PT-06b-LTLCardinality-07
FORMULA_NAME ASLink-PT-06b-LTLCardinality-08
FORMULA_NAME ASLink-PT-06b-LTLCardinality-09
FORMULA_NAME ASLink-PT-06b-LTLCardinality-10
FORMULA_NAME ASLink-PT-06b-LTLCardinality-11
FORMULA_NAME ASLink-PT-06b-LTLCardinality-12
FORMULA_NAME ASLink-PT-06b-LTLCardinality-13
FORMULA_NAME ASLink-PT-06b-LTLCardinality-14
FORMULA_NAME ASLink-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717208628355

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:23:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:23:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:23:51] [INFO ] Load time of PNML (sax parser for PT used): 579 ms
[2024-06-01 02:23:51] [INFO ] Transformed 2826 places.
[2024-06-01 02:23:51] [INFO ] Transformed 3513 transitions.
[2024-06-01 02:23:51] [INFO ] Found NUPN structural information;
[2024-06-01 02:23:51] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 943 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-06b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 2826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Discarding 171 places :
Symmetric choice reduction at 0 with 171 rule applications. Total rules 171 place count 2655 transition count 3342
Iterating global reduction 0 with 171 rules applied. Total rules applied 342 place count 2655 transition count 3342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 343 place count 2655 transition count 3341
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 409 place count 2589 transition count 3237
Iterating global reduction 1 with 66 rules applied. Total rules applied 475 place count 2589 transition count 3237
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 494 place count 2589 transition count 3218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 504 place count 2579 transition count 3208
Iterating global reduction 2 with 10 rules applied. Total rules applied 514 place count 2579 transition count 3208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 517 place count 2576 transition count 3198
Iterating global reduction 2 with 3 rules applied. Total rules applied 520 place count 2576 transition count 3198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 522 place count 2574 transition count 3196
Iterating global reduction 2 with 2 rules applied. Total rules applied 524 place count 2574 transition count 3196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 526 place count 2572 transition count 3187
Iterating global reduction 2 with 2 rules applied. Total rules applied 528 place count 2572 transition count 3187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 529 place count 2571 transition count 3179
Iterating global reduction 2 with 1 rules applied. Total rules applied 530 place count 2571 transition count 3179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 531 place count 2570 transition count 3178
Iterating global reduction 2 with 1 rules applied. Total rules applied 532 place count 2570 transition count 3178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 533 place count 2569 transition count 3170
Iterating global reduction 2 with 1 rules applied. Total rules applied 534 place count 2569 transition count 3170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 535 place count 2568 transition count 3162
Iterating global reduction 2 with 1 rules applied. Total rules applied 536 place count 2568 transition count 3162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 537 place count 2567 transition count 3161
Iterating global reduction 2 with 1 rules applied. Total rules applied 538 place count 2567 transition count 3161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 2566 transition count 3153
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 2566 transition count 3153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 541 place count 2565 transition count 3145
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 2565 transition count 3145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 543 place count 2564 transition count 3144
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 2564 transition count 3144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 545 place count 2563 transition count 3136
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 2563 transition count 3136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 2562 transition count 3128
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 2562 transition count 3128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 549 place count 2561 transition count 3127
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 2561 transition count 3127
Applied a total of 550 rules in 4404 ms. Remains 2561 /2826 variables (removed 265) and now considering 3127/3513 (removed 386) transitions.
// Phase 1: matrix 3127 rows 2561 cols
[2024-06-01 02:23:56] [INFO ] Computed 277 invariants in 143 ms
[2024-06-01 02:23:59] [INFO ] Implicit Places using invariants in 2648 ms returned [2395, 2406, 2417, 2425, 2433, 2441, 2449, 2460, 2468, 2476, 2487]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2699 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2550/2826 places, 3127/3513 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2537 transition count 3114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2537 transition count 3114
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 2527 transition count 3104
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 2527 transition count 3104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 2519 transition count 3096
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 2519 transition count 3096
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 2515 transition count 3092
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 2515 transition count 3092
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 2513 transition count 3090
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 2513 transition count 3090
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2511 transition count 3088
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2511 transition count 3088
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2509 transition count 3086
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2509 transition count 3086
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2507 transition count 3084
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2507 transition count 3084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2506 transition count 3083
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2506 transition count 3083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 2505 transition count 3082
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 2505 transition count 3082
Applied a total of 90 rules in 2694 ms. Remains 2505 /2550 variables (removed 45) and now considering 3082/3127 (removed 45) transitions.
// Phase 1: matrix 3082 rows 2505 cols
[2024-06-01 02:24:02] [INFO ] Computed 266 invariants in 151 ms
[2024-06-01 02:24:05] [INFO ] Implicit Places using invariants in 3118 ms returned []
[2024-06-01 02:24:05] [INFO ] Invariant cache hit.
[2024-06-01 02:24:17] [INFO ] Implicit Places using invariants and state equation in 12517 ms returned []
Implicit Place search using SMT with State Equation took 15650 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2505/2826 places, 3082/3513 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25478 ms. Remains : 2505/2826 places, 3082/3513 transitions.
Support contains 22 out of 2505 places after structural reductions.
[2024-06-01 02:24:18] [INFO ] Flatten gal took : 425 ms
[2024-06-01 02:24:18] [INFO ] Flatten gal took : 184 ms
[2024-06-01 02:24:19] [INFO ] Input system was already deterministic with 3082 transitions.
RANDOM walk for 40000 steps (68 resets) in 2178 ms. (18 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
[2024-06-01 02:24:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 184/193 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 560/753 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1696/2449 variables, 192/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2449 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 56/2505 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2505 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3082/5587 variables, 2505/2771 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5587 variables, 0/2771 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/5587 variables, 0/2771 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5587/5587 variables, and 2771 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4006 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 199/199 constraints, State Equation: 2505/2505 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 184/193 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 560/753 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1696/2449 variables, 192/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 02:24:25] [INFO ] Deduced a trap composed of 101 places in 478 ms of which 59 ms to minimize.
[2024-06-01 02:24:26] [INFO ] Deduced a trap composed of 91 places in 487 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2449 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2449 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 56/2505 variables, 7/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2505 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5587/5587 variables, and 2773 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 199/199 constraints, State Equation: 2505/2505 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 9097ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 2505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 459 transitions
Trivial Post-agglo rules discarded 459 transitions
Performed 459 trivial Post agglomeration. Transition count delta: 459
Iterating post reduction 0 with 459 rules applied. Total rules applied 459 place count 2505 transition count 2623
Reduce places removed 459 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 466 rules applied. Total rules applied 925 place count 2046 transition count 2616
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 930 place count 2042 transition count 2615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 931 place count 2041 transition count 2615
Performed 670 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 670 Pre rules applied. Total rules applied 931 place count 2041 transition count 1945
Deduced a syphon composed of 670 places in 6 ms
Ensure Unique test removed 63 places
Reduce places removed 733 places and 0 transitions.
Iterating global reduction 4 with 1403 rules applied. Total rules applied 2334 place count 1308 transition count 1945
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2380 place count 1302 transition count 1905
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2420 place count 1262 transition count 1905
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2420 place count 1262 transition count 1881
Deduced a syphon composed of 24 places in 8 ms
Ensure Unique test removed 23 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 71 rules applied. Total rules applied 2491 place count 1215 transition count 1881
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 2491 place count 1215 transition count 1859
Deduced a syphon composed of 22 places in 23 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 2535 place count 1193 transition count 1859
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2537 place count 1191 transition count 1850
Iterating global reduction 6 with 2 rules applied. Total rules applied 2539 place count 1191 transition count 1850
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2540 place count 1190 transition count 1842
Iterating global reduction 6 with 1 rules applied. Total rules applied 2541 place count 1190 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2542 place count 1189 transition count 1834
Iterating global reduction 6 with 1 rules applied. Total rules applied 2543 place count 1189 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2544 place count 1188 transition count 1826
Iterating global reduction 6 with 1 rules applied. Total rules applied 2545 place count 1188 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2546 place count 1187 transition count 1818
Iterating global reduction 6 with 1 rules applied. Total rules applied 2547 place count 1187 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2548 place count 1186 transition count 1810
Iterating global reduction 6 with 1 rules applied. Total rules applied 2549 place count 1186 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2550 place count 1185 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 2551 place count 1185 transition count 1802
Performed 205 Post agglomeration using F-continuation condition.Transition count delta: 205
Deduced a syphon composed of 205 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 6 with 412 rules applied. Total rules applied 2963 place count 978 transition count 1597
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2967 place count 974 transition count 1593
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2972 place count 973 transition count 1593
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 6 with 1 rules applied. Total rules applied 2973 place count 973 transition count 1592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2974 place count 972 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2976 place count 970 transition count 1590
Iterating global reduction 8 with 2 rules applied. Total rules applied 2978 place count 970 transition count 1590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2980 place count 970 transition count 1588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2981 place count 969 transition count 1588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2983 place count 968 transition count 1593
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 2990 place count 968 transition count 1586
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2997 place count 961 transition count 1586
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 3002 place count 961 transition count 1581
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3007 place count 956 transition count 1581
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 3013 place count 956 transition count 1581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3014 place count 955 transition count 1580
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 12 with 18 rules applied. Total rules applied 3032 place count 943 transition count 1574
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3038 place count 937 transition count 1574
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 18 Pre rules applied. Total rules applied 3038 place count 937 transition count 1556
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 14 with 37 rules applied. Total rules applied 3075 place count 918 transition count 1556
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 14 with 8 rules applied. Total rules applied 3083 place count 910 transition count 1556
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3083 place count 910 transition count 1555
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3085 place count 909 transition count 1555
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3086 place count 908 transition count 1554
Iterating global reduction 15 with 1 rules applied. Total rules applied 3087 place count 908 transition count 1554
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3088 place count 907 transition count 1553
Iterating global reduction 15 with 1 rules applied. Total rules applied 3089 place count 907 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3090 place count 906 transition count 1552
Iterating global reduction 15 with 1 rules applied. Total rules applied 3091 place count 906 transition count 1552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3092 place count 906 transition count 1551
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 16 with 24 rules applied. Total rules applied 3116 place count 894 transition count 1539
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3121 place count 889 transition count 1534
Iterating global reduction 16 with 5 rules applied. Total rules applied 3126 place count 889 transition count 1534
Free-agglomeration rule applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 3132 place count 889 transition count 1528
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 3138 place count 883 transition count 1528
Applied a total of 3138 rules in 2278 ms. Remains 883 /2505 variables (removed 1622) and now considering 1528/3082 (removed 1554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2280 ms. Remains : 883/2505 places, 1528/3082 transitions.
RANDOM walk for 40000 steps (450 resets) in 705 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (74 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (70 resets) in 116 ms. (341 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (74 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
// Phase 1: matrix 1528 rows 883 cols
[2024-06-01 02:24:32] [INFO ] Computed 150 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/124 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 16/140 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/141 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 331/472 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 83/555 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/561 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 283/844 variables, 54/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/844 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/849 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/849 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 34/883 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1528/2411 variables, 883/1033 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2411 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/2411 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2411/2411 variables, and 1033 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 883/883 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/124 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 16/140 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/141 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 331/472 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 02:24:34] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 83/555 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/561 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 283/844 variables, 54/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/844 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 5/849 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/849 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 34/883 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/883 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1528/2411 variables, 883/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2411 variables, 4/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2411 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/2411 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2411/2411 variables, and 1038 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2780 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 883/883 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4810ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8852 ms.
Support contains 7 out of 883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 883/883 places, 1528/1528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 883 transition count 1527
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 882 transition count 1527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 880 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 879 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 879 transition count 1525
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 879 transition count 1524
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 878 transition count 1524
Applied a total of 9 rules in 119 ms. Remains 878 /883 variables (removed 5) and now considering 1524/1528 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 878/883 places, 1524/1528 transitions.
RANDOM walk for 40000 steps (466 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (73 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (70 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 173885 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 173885 steps, saw 40015 distinct states, run finished after 3020 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 1524 rows 878 cols
[2024-06-01 02:24:49] [INFO ] Computed 149 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/63 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 237/300 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 119/419 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/426 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 370/796 variables, 65/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/812 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/812 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/876 variables, 17/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/876 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/878 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/878 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1524/2402 variables, 878/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2402 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/2402 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2402/2402 variables, and 1027 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 878/878 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/63 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 237/300 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 119/419 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/426 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 370/796 variables, 65/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 16/812 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/812 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/876 variables, 17/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/876 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/878 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/878 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1524/2402 variables, 878/1027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2402 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 02:24:55] [INFO ] Deduced a trap composed of 26 places in 943 ms of which 14 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2402 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2402 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/2402 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2402/2402 variables, and 1032 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5255 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 878/878 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 7725ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 10009 ms.
Support contains 7 out of 878 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 878/878 places, 1524/1524 transitions.
Applied a total of 0 rules in 40 ms. Remains 878 /878 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 878/878 places, 1524/1524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 878/878 places, 1524/1524 transitions.
Applied a total of 0 rules in 37 ms. Remains 878 /878 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2024-06-01 02:25:07] [INFO ] Invariant cache hit.
[2024-06-01 02:25:08] [INFO ] Implicit Places using invariants in 1066 ms returned [1, 18, 19, 31, 48, 66, 102, 141, 145, 154, 155, 157, 174, 193, 262, 266, 267, 278, 279, 281, 298, 316, 386, 390, 391, 402, 403, 405, 422, 440, 462, 480, 514, 515, 526, 527, 529, 546, 564, 633, 637, 638, 649, 650, 652, 669, 687, 756, 760, 761, 764, 776, 777, 778, 796, 817, 818, 819, 820]
[2024-06-01 02:25:08] [INFO ] Actually due to overlaps returned [796, 778, 31, 48, 174, 298, 422, 546, 669, 157, 281, 529, 652, 154, 278, 402, 405, 526, 649, 776, 817, 155, 279, 403, 527, 650, 777, 818, 1, 18, 266, 267, 390, 391, 514, 515, 637, 638, 760, 761, 66, 193, 316, 564, 687, 819, 19, 440, 462, 764, 820]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 1078 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 827/878 places, 1524/1524 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 820 transition count 1418
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 114 rules applied. Total rules applied 227 place count 714 transition count 1410
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 231 place count 710 transition count 1410
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 231 place count 710 transition count 1379
Deduced a syphon composed of 31 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 294 place count 678 transition count 1379
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 306 place count 674 transition count 1371
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 314 place count 666 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 317 place count 663 transition count 1368
Iterating global reduction 5 with 3 rules applied. Total rules applied 320 place count 663 transition count 1368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 323 place count 663 transition count 1365
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 405 place count 622 transition count 1324
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 410 place count 617 transition count 1319
Iterating global reduction 6 with 5 rules applied. Total rules applied 415 place count 617 transition count 1319
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 420 place count 617 transition count 1314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 424 place count 615 transition count 1315
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 437 place count 615 transition count 1302
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 451 place count 601 transition count 1302
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 470 place count 601 transition count 1302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 471 place count 601 transition count 1301
Applied a total of 471 rules in 383 ms. Remains 601 /827 variables (removed 226) and now considering 1301/1524 (removed 223) transitions.
// Phase 1: matrix 1301 rows 601 cols
[2024-06-01 02:25:08] [INFO ] Computed 85 invariants in 16 ms
[2024-06-01 02:25:09] [INFO ] Implicit Places using invariants in 959 ms returned [73, 92, 98, 101, 103, 105, 108, 109, 163, 179, 185, 188, 190, 195, 196, 249, 265, 271, 274, 277, 282, 283, 353, 359, 362, 364, 369, 370, 423, 439, 445, 448, 450, 455, 456, 509, 525, 531, 534, 536]
[2024-06-01 02:25:09] [INFO ] Actually due to overlaps returned [108, 195, 282, 369, 455, 109, 196, 370, 456, 283, 92, 98, 103, 179, 185, 190, 265, 271, 277, 353, 359, 364, 439, 445, 450, 525, 531, 536, 73, 105, 163, 249, 423, 509]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 961 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 567/878 places, 1301/1524 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 1300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 566 transition count 1300
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 25 place count 543 transition count 1277
Iterating global reduction 2 with 23 rules applied. Total rules applied 48 place count 543 transition count 1277
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 537 transition count 1271
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 537 transition count 1271
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 526 transition count 1260
Free-agglomeration rule applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 100 place count 526 transition count 1242
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 118 place count 508 transition count 1242
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 508 transition count 1237
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 128 place count 503 transition count 1237
Applied a total of 128 rules in 175 ms. Remains 503 /567 variables (removed 64) and now considering 1237/1301 (removed 64) transitions.
// Phase 1: matrix 1237 rows 503 cols
[2024-06-01 02:25:09] [INFO ] Computed 51 invariants in 20 ms
[2024-06-01 02:25:10] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-06-01 02:25:10] [INFO ] Invariant cache hit.
[2024-06-01 02:25:12] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 503/878 places, 1237/1524 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5325 ms. Remains : 503/878 places, 1237/1524 transitions.
RANDOM walk for 40000 steps (665 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (146 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (154 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (147 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (143 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 229112 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :1 out of 4
Probabilistic random walk after 229112 steps, saw 70101 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :1
[2024-06-01 02:25:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 274/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/290 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 121/411 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/428 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 51/479 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 22/501 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/503 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1237/1740 variables, 503/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1740 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1740 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1740/1740 variables, and 554 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1453 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 274/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/290 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 121/411 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/428 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 51/479 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 22/501 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/503 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1237/1740 variables, 503/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1740 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1740 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1740 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1740/1740 variables, and 557 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2858ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3754 ms.
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 1237/1237 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1234
Applied a total of 6 rules in 39 ms. Remains 500 /503 variables (removed 3) and now considering 1234/1237 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 500/503 places, 1234/1237 transitions.
RANDOM walk for 40000 steps (694 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (160 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (150 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 274854 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 3
Probabilistic random walk after 274854 steps, saw 63851 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 1234 rows 500 cols
[2024-06-01 02:25:25] [INFO ] Computed 51 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 272/277 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/288 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 129/417 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 40/457 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 43/500 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1234/1734 variables, 500/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1734 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1734 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 551 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 272/277 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/288 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 129/417 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 40/457 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 43/500 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1234/1734 variables, 500/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1734 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 02:25:28] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1734 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1734 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1734 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 555 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3047ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3130 ms.
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1234/1234 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 500/500 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1234/1234 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-06-01 02:25:31] [INFO ] Invariant cache hit.
[2024-06-01 02:25:32] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-06-01 02:25:32] [INFO ] Invariant cache hit.
[2024-06-01 02:25:34] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2024-06-01 02:25:34] [INFO ] Redundant transitions in 147 ms returned []
Running 1201 sub problems to find dead transitions.
[2024-06-01 02:25:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 1201 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 499/1734 variables, and 49 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/1734 variables, and 51 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 0/1201 constraints, Known Traps: 0/0 constraints]
After SMT, in 61333ms problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 61370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64055 ms. Remains : 500/500 places, 1234/1234 transitions.
Computed a total of 101 stabilizing places and 101 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X(p1)||G(p0))))))'
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2499 transition count 3069
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2499 transition count 3069
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 2494 transition count 3057
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 2494 transition count 3057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 2494 transition count 3056
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 2491 transition count 3053
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 2491 transition count 3053
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 2489 transition count 3044
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 2489 transition count 3044
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2488 transition count 3036
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2488 transition count 3036
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2487 transition count 3035
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2487 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2486 transition count 3027
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2486 transition count 3027
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2485 transition count 3019
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2485 transition count 3019
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2484 transition count 3018
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2484 transition count 3018
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2483 transition count 3010
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2483 transition count 3010
Applied a total of 45 rules in 2361 ms. Remains 2483 /2505 variables (removed 22) and now considering 3010/3082 (removed 72) transitions.
// Phase 1: matrix 3010 rows 2483 cols
[2024-06-01 02:26:38] [INFO ] Computed 266 invariants in 41 ms
[2024-06-01 02:26:40] [INFO ] Implicit Places using invariants in 1859 ms returned []
[2024-06-01 02:26:40] [INFO ] Invariant cache hit.
[2024-06-01 02:26:51] [INFO ] Implicit Places using invariants and state equation in 11121 ms returned []
Implicit Place search using SMT with State Equation took 12985 ms to find 0 implicit places.
Running 3009 sub problems to find dead transitions.
[2024-06-01 02:26:51] [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 13.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 3.0)
(s50 1.0)
(s51 6.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 26.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 5.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.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 16.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.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 10.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.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 7.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 4.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.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 21.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 21.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 18.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 4.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 28.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 0.0)
(s488 0.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 0.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 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 0.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 5.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 4.0)
(s660 0.0)
(s661 1.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 3.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.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 0.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 4.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 0.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 23.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 17.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 17.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 14.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 4.0)
(s776 1.0)
(s777 99.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 0.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 1.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 0.0)
(s830 1.0)
(s831 1.0)
(s832 6.0)
(s833 1.0)
(s834 0.0)
(s835 1.0)
(s836 1.0)
(s837 0.0)
(s838 0.0)
(s839 1.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 1.0)
(s851 0.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 1.0)
(s858 0.0)
(s859 1.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 1.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 0.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 16.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 0.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 0.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 10.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 0.0)
(s1041 0.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 7.0)
(s1067 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2482 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3009 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2482/5493 variables, and 152 constraints, problems are : Problem set: 0 solved, 3009 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 152/203 constraints, State Equation: 0/2483 constraints, PredecessorRefiner: 3009/3009 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3009 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2482 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3009 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 2482/5493 variables, and 152 constraints, problems are : Problem set: 0 solved, 3009 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 152/203 constraints, State Equation: 0/2483 constraints, PredecessorRefiner: 0/3009 constraints, Known Traps: 0/0 constraints]
After SMT, in 62165ms problems are : Problem set: 0 solved, 3009 unsolved
Search for dead transitions found 0 dead transitions in 62204ms
Starting structural reductions in LTL mode, iteration 1 : 2483/2505 places, 3010/3082 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77562 ms. Remains : 2483/2505 places, 3010/3082 transitions.
Stuttering acceptance computed with spot in 482 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-00
Product exploration explored 100000 steps with 202 reset in 835 ms.
Product exploration explored 100000 steps with 203 reset in 705 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 25896 steps (39 resets) in 413 ms. (62 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3010/3010 transitions.
Applied a total of 0 rules in 275 ms. Remains 2483 /2483 variables (removed 0) and now considering 3010/3010 (removed 0) transitions.
[2024-06-01 02:27:57] [INFO ] Invariant cache hit.
[2024-06-01 02:27:59] [INFO ] Implicit Places using invariants in 2082 ms returned []
[2024-06-01 02:27:59] [INFO ] Invariant cache hit.
[2024-06-01 02:28:11] [INFO ] Implicit Places using invariants and state equation in 11761 ms returned []
Implicit Place search using SMT with State Equation took 13847 ms to find 0 implicit places.
Running 3009 sub problems to find dead transitions.
[2024-06-01 02:28:11] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2482 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3009 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2482/5493 variables, and 152 constraints, problems are : Problem set: 0 solved, 3009 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 152/203 constraints, State Equation: 0/2483 constraints, PredecessorRefiner: 3009/3009 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3009 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2482 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3009 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 2482/5493 variables, and 152 constraints, problems are : Problem set: 0 solved, 3009 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 152/203 constraints, State Equation: 0/2483 constraints, PredecessorRefiner: 0/3009 constraints, Known Traps: 0/0 constraints]
After SMT, in 61712ms problems are : Problem set: 0 solved, 3009 unsolved
Search for dead transitions found 0 dead transitions in 61750ms
Finished structural reductions in LTL mode , in 1 iterations and 75893 ms. Remains : 2483/2483 places, 3010/3010 transitions.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 22785 steps (36 resets) in 366 ms. (62 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 299 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 203 reset in 628 ms.
Product exploration explored 100000 steps with 194 reset in 470 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2483/2483 places, 3010/3010 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 2483 transition count 3010
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 448 place count 2483 transition count 3009
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 452 Pre rules applied. Total rules applied 448 place count 2483 transition count 3119
Deduced a syphon composed of 899 places in 12 ms
Iterating global reduction 2 with 452 rules applied. Total rules applied 900 place count 2483 transition count 3119
Discarding 246 places :
Symmetric choice reduction at 2 with 246 rule applications. Total rules 1146 place count 2237 transition count 2873
Deduced a syphon composed of 653 places in 7 ms
Iterating global reduction 2 with 246 rules applied. Total rules applied 1392 place count 2237 transition count 2873
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1392 place count 2237 transition count 2878
Deduced a syphon composed of 658 places in 6 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1397 place count 2237 transition count 2878
Performed 427 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1085 places in 6 ms
Iterating global reduction 2 with 427 rules applied. Total rules applied 1824 place count 2237 transition count 2879
Discarding 167 places :
Symmetric choice reduction at 2 with 167 rule applications. Total rules 1991 place count 2070 transition count 2710
Deduced a syphon composed of 921 places in 4 ms
Iterating global reduction 2 with 167 rules applied. Total rules applied 2158 place count 2070 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2159 place count 2069 transition count 2708
Deduced a syphon composed of 921 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2160 place count 2069 transition count 2708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2162 place count 2069 transition count 2706
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 958 places in 5 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 2199 place count 2069 transition count 2832
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2209 place count 2059 transition count 2810
Deduced a syphon composed of 948 places in 5 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 2219 place count 2059 transition count 2810
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 949 places in 5 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2220 place count 2059 transition count 2812
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2221 place count 2058 transition count 2810
Deduced a syphon composed of 948 places in 5 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2222 place count 2058 transition count 2810
Deduced a syphon composed of 948 places in 5 ms
Applied a total of 2222 rules in 1905 ms. Remains 2058 /2483 variables (removed 425) and now considering 2810/3010 (removed 200) transitions.
[2024-06-01 02:29:18] [INFO ] Redundant transitions in 181 ms returned []
Running 2809 sub problems to find dead transitions.
// Phase 1: matrix 2810 rows 2058 cols
[2024-06-01 02:29:18] [INFO ] Computed 266 invariants in 52 ms
(s614 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 4.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 3.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 0.0)
(s42 2.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 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 5.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 36.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.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 16.0)
(s183 1.0)
(s184 0.0)
(s185 0.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 2.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 16.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.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 10.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 0.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 24.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 23.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 0.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 0.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 91.0)
(s357 1.0)
(s358 1.0)
(s359 31.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 39.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 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.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 23.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 14.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 2.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 0.0)
(s524 0.0)
(s525 1.0)
(s526 13.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 2.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 9.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 2.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 0.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 5.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 2.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 0.0)
(s610 1.0)
(s611 7.0)
(s612 0.0)
(s613 1.0)
(s614 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2057 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 2809 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2057/4868 variables, and 187 constraints, problems are : Problem set: 0 solved, 2809 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/60 constraints, Generalized P Invariants (flows): 187/206 constraints, State Equation: 0/2058 constraints, PredecessorRefiner: 2809/2809 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2809 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2057 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 2809 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 4)
(s6 0)
(s7 1)
(s8 1)
(s9 1)
(s10 3)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 2)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 5)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 36)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 1)
(s116 0)
(s117 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2057/4868 variables, and 187 constraints, problems are : Problem set: 0 solved, 2809 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/60 constraints, Generalized P Invariants (flows): 187/206 constraints, State Equation: 0/2058 constraints, PredecessorRefiner: 0/2809 constraints, Known Traps: 0/0 constraints]
After SMT, in 62403ms problems are : Problem set: 0 solved, 2809 unsolved
Search for dead transitions found 0 dead transitions in 62438ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2058/2483 places, 2810/3010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64542 ms. Remains : 2058/2483 places, 2810/3010 transitions.
Support contains 3 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3010/3010 transitions.
Applied a total of 0 rules in 307 ms. Remains 2483 /2483 variables (removed 0) and now considering 3010/3010 (removed 0) transitions.
// Phase 1: matrix 3010 rows 2483 cols
[2024-06-01 02:30:20] [INFO ] Computed 266 invariants in 62 ms
[2024-06-01 02:30:23] [INFO ] Implicit Places using invariants in 2577 ms returned []
[2024-06-01 02:30:23] [INFO ] Invariant cache hit.
[2024-06-01 02:30:34] [INFO ] Implicit Places using invariants and state equation in 11523 ms returned []
Implicit Place search using SMT with State Equation took 14103 ms to find 0 implicit places.
Running 3009 sub problems to find dead transitions.
[2024-06-01 02:30:35] [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 13.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 3.0)
(s50 1.0)
(s51 6.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 26.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 5.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.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 16.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.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 10.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.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 7.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 4.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.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 21.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 21.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 18.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 4.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 28.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 0.0)
(s488 0.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 0.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 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 0.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 5.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 4.0)
(s660 0.0)
(s661 1.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 3.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.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 0.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 4.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 0.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 23.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 17.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 17.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 14.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 4.0)
(s776 1.0)
(s777 99.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 0.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 1.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 0.0)
(s830 1.0)
(s831 1.0)
(s832 6.0)
(s833 1.0)
(s834 0.0)
(s835 1.0)
(s836 1.0)
(s837 0.0)
(s838 0.0)
(s839 1.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 1.0)
(s851 0.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 1.0)
(s858 0.0)
(s859 1.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 1.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 0.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 16.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 0.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 0.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 10.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 0.0)
(s1041 0.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 7.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 0.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 0.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 4.0)
(s1083 1.0)
(s1084 0.0)
(s1085 1.0)
(s1086 1.0)
(s1087 0.0)
(s1088 0.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 13.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 13.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 10.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 4.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 28.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 0.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 0.0)
(s1177 0.0)
(s1178 5.0)
(s1179 1.0)
(s1180 0.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 1.0)
(s1187 1.0)
(s1188 0.0)
(s1189 0.0)
(s1190 1.0)
(s1191 6.0)
(s1192 1.0)
(s1193 0.0)
(s1194 1.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 1.0)
(s1199 1.0)
(s1200 0.0)
(s1201 0.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 3.0)
(s1210 1.0)
(s1211 0.0)
(s1212 1.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 1.0)
(s1217 0.0)
(s1218 1.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 1.0)
(s1223 0.0)
(s1224 1.0)
(s1225 1.0)
(s1226 0.0)
(s1227 1.0)
(s1228 1.0)
(s1229 0.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 0.0)
(s1331 0.0)
(s1332 1.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 1.0)
(s1338 1.0)
(s1339 0.0)
(s1340 1.0)
(s1341 1.0)
(s1342 0.0)
(s1343 1.0)
(s1344 1.0)
(s1345 0.0)
(s1346 1.0)
(s1347 1.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.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 0.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 0.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 0.0)
(s1373 0.0)
(s1374 1.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 1.0)
(s1380 1.0)
(s1381 0.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 0.0)
(s1387 1.0)
(s1388 1.0)
(s1389 0.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 0.0)
(s1400 1.0)
(s1401 1.0)
(s1402 0.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 0.0)
(s1409 1.0)
(s1410 1.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 0.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 0.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 0.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 4.0)
(s1442 1.0)
(s1443 0.0)
(s1444 1.0)
(s1445 1.0)
(s1446 0.0)
(s1447 0.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 23.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 9.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 9.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 6.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 2.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 93.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 0.0)
(s1536 0.0)
(s1537 1.0)
(s1538 1.0)
(s1539 0.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 0.0)
(s1544 0.0)
(s1545 1.0)
(s1546 6.0)
(s1547 0.0)
(s1548 0.0)
(s1549 1.0)
(s1550 1.0)
(s1551 0.0)
(s1552 0.0)
(s1553 1.0)
(s1554 1.0)
(s1555 0.0)
(s1556 0.0)
(s1557 1.0)
(s1558 1.0)
(s1559 0.0)
(s1560 0.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 23.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 16.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 0.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 0.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 10.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 0.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 0.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 0.0)
(s1792 1.0)
(s1793 1.0)
(s1794 0.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 0.0)
(s1802 0.0)
(s1803 4.0)
(s1804 1.0)
(s1805 1.0)timeout

(s1806 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2482 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3009 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2482/5493 variables, and 152 constraints, problems are : Problem set: 0 solved, 3009 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 152/203 constraints, State Equation: 0/2483 constraints, PredecessorRefiner: 3009/3009 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3009 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2482 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3009 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 2482/5493 variables, and 152 constraints, problems are : Problem set: 0 solved, 3009 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 152/203 constraints, State Equation: 0/2483 constraints, PredecessorRefiner: 0/3009 constraints, Known Traps: 0/0 constraints]
After SMT, in 61582ms problems are : Problem set: 0 solved, 3009 unsolved
Search for dead transitions found 0 dead transitions in 61616ms
Finished structural reductions in LTL mode , in 1 iterations and 76038 ms. Remains : 2483/2483 places, 3010/3010 transitions.
Treatment of property ASLink-PT-06b-LTLCardinality-00 finished in 301162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F(p1))))))'
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2504 transition count 2616
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 472 rules applied. Total rules applied 937 place count 2039 transition count 2609
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 941 place count 2035 transition count 2609
Performed 672 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 672 Pre rules applied. Total rules applied 941 place count 2035 transition count 1937
Deduced a syphon composed of 672 places in 5 ms
Ensure Unique test removed 63 places
Reduce places removed 735 places and 0 transitions.
Iterating global reduction 3 with 1407 rules applied. Total rules applied 2348 place count 1300 transition count 1937
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 46 rules applied. Total rules applied 2394 place count 1294 transition count 1897
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2434 place count 1254 transition count 1897
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2434 place count 1254 transition count 1873
Deduced a syphon composed of 24 places in 6 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 2506 place count 1206 transition count 1873
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 2506 place count 1206 transition count 1850
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 2552 place count 1183 transition count 1850
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2554 place count 1181 transition count 1841
Iterating global reduction 5 with 2 rules applied. Total rules applied 2556 place count 1181 transition count 1841
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2557 place count 1180 transition count 1833
Iterating global reduction 5 with 1 rules applied. Total rules applied 2558 place count 1180 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2559 place count 1179 transition count 1825
Iterating global reduction 5 with 1 rules applied. Total rules applied 2560 place count 1179 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2561 place count 1178 transition count 1817
Iterating global reduction 5 with 1 rules applied. Total rules applied 2562 place count 1178 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2563 place count 1177 transition count 1809
Iterating global reduction 5 with 1 rules applied. Total rules applied 2564 place count 1177 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2565 place count 1176 transition count 1801
Iterating global reduction 5 with 1 rules applied. Total rules applied 2566 place count 1176 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2567 place count 1175 transition count 1793
Iterating global reduction 5 with 1 rules applied. Total rules applied 2568 place count 1175 transition count 1793
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 203
Deduced a syphon composed of 203 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 5 with 408 rules applied. Total rules applied 2976 place count 970 transition count 1590
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2980 place count 966 transition count 1586
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2985 place count 965 transition count 1586
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 5 with 1 rules applied. Total rules applied 2986 place count 965 transition count 1585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2987 place count 964 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2989 place count 962 transition count 1583
Iterating global reduction 7 with 2 rules applied. Total rules applied 2991 place count 962 transition count 1583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2993 place count 962 transition count 1581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2994 place count 961 transition count 1581
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2996 place count 960 transition count 1586
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2998 place count 958 transition count 1584
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 18 rules applied. Total rules applied 3016 place count 946 transition count 1578
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3022 place count 940 transition count 1578
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 18 Pre rules applied. Total rules applied 3022 place count 940 transition count 1560
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 37 rules applied. Total rules applied 3059 place count 921 transition count 1560
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 3072 place count 908 transition count 1560
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3072 place count 908 transition count 1559
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3074 place count 907 transition count 1559
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 3112 place count 888 transition count 1540
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 3124 place count 876 transition count 1528
Iterating global reduction 12 with 12 rules applied. Total rules applied 3136 place count 876 transition count 1528
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3142 place count 870 transition count 1522
Iterating global reduction 12 with 6 rules applied. Total rules applied 3148 place count 870 transition count 1522
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3154 place count 870 transition count 1516
Applied a total of 3154 rules in 1017 ms. Remains 870 /2505 variables (removed 1635) and now considering 1516/3082 (removed 1566) transitions.
// Phase 1: matrix 1516 rows 870 cols
[2024-06-01 02:31:38] [INFO ] Computed 144 invariants in 35 ms
[2024-06-01 02:31:39] [INFO ] Implicit Places using invariants in 1701 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 379, 380, 392, 393, 395, 412, 430, 450, 469, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 752, 763, 764, 765, 783, 784, 805, 806, 807, 808]
[2024-06-01 02:31:39] [INFO ] Actually due to overlaps returned [783, 765, 48, 167, 289, 412, 537, 659, 31, 147, 150, 269, 272, 392, 395, 517, 520, 639, 642, 763, 805, 148, 270, 393, 518, 640, 764, 806, 1, 18, 256, 257, 379, 380, 504, 505, 626, 627, 748, 749, 784, 807, 19, 66, 85, 137, 185, 205, 307, 327, 430, 450, 555, 575, 677, 697, 752, 808]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 1705 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 812/2505 places, 1516/3082 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 811 transition count 1415
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 710 transition count 1414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 709 transition count 1414
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 205 place count 709 transition count 1383
Deduced a syphon composed of 31 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 268 place count 677 transition count 1383
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 280 place count 673 transition count 1375
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 288 place count 665 transition count 1375
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 291 place count 662 transition count 1372
Iterating global reduction 5 with 3 rules applied. Total rules applied 294 place count 662 transition count 1372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 297 place count 662 transition count 1369
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 393 place count 614 transition count 1321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 397 place count 612 transition count 1322
Applied a total of 397 rules in 188 ms. Remains 612 /812 variables (removed 200) and now considering 1322/1516 (removed 194) transitions.
// Phase 1: matrix 1322 rows 612 cols
[2024-06-01 02:31:40] [INFO ] Computed 80 invariants in 21 ms
[2024-06-01 02:31:40] [INFO ] Implicit Places using invariants in 819 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 354, 360, 365, 442, 448, 453, 530, 536, 541, 609]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 821 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 593/2505 places, 1322/3082 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 593 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 592 transition count 1321
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 580 transition count 1309
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 580 transition count 1309
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 568 transition count 1297
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 568 transition count 1297
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 563 transition count 1292
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 563 transition count 1292
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 557 transition count 1286
Applied a total of 72 rules in 96 ms. Remains 557 /593 variables (removed 36) and now considering 1286/1322 (removed 36) transitions.
// Phase 1: matrix 1286 rows 557 cols
[2024-06-01 02:31:41] [INFO ] Computed 61 invariants in 12 ms
[2024-06-01 02:31:42] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2024-06-01 02:31:42] [INFO ] Invariant cache hit.
[2024-06-01 02:31:44] [INFO ] Implicit Places using invariants and state equation in 2491 ms returned []
Implicit Place search using SMT with State Equation took 3607 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 557/2505 places, 1286/3082 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7434 ms. Remains : 557/2505 places, 1286/3082 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-02
Product exploration explored 100000 steps with 24983 reset in 639 ms.
Product exploration explored 100000 steps with 25001 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (501 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (105 resets) in 447 ms. (89 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (107 resets) in 394 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (110 resets) in 344 ms. (115 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175401 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :2 out of 3
Probabilistic random walk after 175401 steps, saw 81844 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :2
[2024-06-01 02:31:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/130 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/407 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/453 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 104/557 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1286/1843 variables, 557/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1843 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1843 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1843/1843 variables, and 618 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 557/557 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/130 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/407 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/453 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 104/557 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1286/1843 variables, 557/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1843 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1843 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1843 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1843/1843 variables, and 619 constraints, problems are : Problem set: 0 solved, 1 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 557/557 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 1 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 1284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 555 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 554 transition count 1283
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 554 transition count 1283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 554 transition count 1282
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 553 transition count 1282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 552 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 551 transition count 1280
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 551 transition count 1280
Free-agglomeration rule applied 30 times.
Iterating global reduction 2 with 30 rules applied. Total rules applied 42 place count 551 transition count 1250
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 78 place count 521 transition count 1244
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 95 place count 521 transition count 1227
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 112 place count 504 transition count 1227
Applied a total of 112 rules in 202 ms. Remains 504 /557 variables (removed 53) and now considering 1227/1286 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 504/557 places, 1227/1286 transitions.
RANDOM walk for 40000 steps (729 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (145 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265741 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265741 steps, saw 72986 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1227 rows 504 cols
[2024-06-01 02:31:55] [INFO ] Computed 61 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/102 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/342 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/395 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/504 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1731 variables, 504/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1731 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1731 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/102 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/342 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/395 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/504 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1731 variables, 504/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1731 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1731 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1731 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1991ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1227/1227 transitions.
Applied a total of 0 rules in 35 ms. Remains 504 /504 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 504/504 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 504 /504 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-06-01 02:31:57] [INFO ] Invariant cache hit.
[2024-06-01 02:31:58] [INFO ] Implicit Places using invariants in 854 ms returned [88, 89, 159, 160, 230, 231, 303, 304, 374, 375]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 858 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/504 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 926 ms. Remains : 494/504 places, 1227/1227 transitions.
RANDOM walk for 40000 steps (689 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (146 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 263646 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263646 steps, saw 72343 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 1227 rows 494 cols
[2024-06-01 02:32:01] [INFO ] Computed 51 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/125 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/349 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/402 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/494 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1721 variables, 494/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1721 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1721 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1721/1721 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 494/494 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/125 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/349 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/402 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/494 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:32:02] [INFO ] Deduced a trap composed of 64 places in 649 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1227/1721 variables, 494/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1721 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1721 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1721 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 494/494 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2310ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 494/494 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-06-01 02:32:03] [INFO ] Invariant cache hit.
[2024-06-01 02:32:04] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-06-01 02:32:04] [INFO ] Invariant cache hit.
[2024-06-01 02:32:06] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
[2024-06-01 02:32:06] [INFO ] Redundant transitions in 17 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-06-01 02:32:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/1721 variables, and 47 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/494 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/1721 variables, and 47 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/494 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 0/0 constraints]
After SMT, in 60993ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 61007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64158 ms. Remains : 494/494 places, 1227/1227 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 34 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 02:33:07] [INFO ] Invariant cache hit.
[2024-06-01 02:33:07] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:33:08] [INFO ] [Real]Absence check using 11 positive and 40 generalized place invariants in 39 ms returned sat
[2024-06-01 02:33:08] [INFO ] After 938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 02:33:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 02:33:08] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 38 ms returned sat
[2024-06-01 02:33:09] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 02:33:09] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 02:33:09] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2102 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Applied a total of 0 rules in 36 ms. Remains 557 /557 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
// Phase 1: matrix 1286 rows 557 cols
[2024-06-01 02:33:10] [INFO ] Computed 61 invariants in 18 ms
[2024-06-01 02:33:11] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-06-01 02:33:11] [INFO ] Invariant cache hit.
[2024-06-01 02:33:13] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 3325 ms to find 0 implicit places.
[2024-06-01 02:33:13] [INFO ] Redundant transitions in 31 ms returned []
Running 1241 sub problems to find dead transitions.
[2024-06-01 02:33:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.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 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.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)
(s73 4.0)
(s74 1.0)
(s75 0.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 6.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.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 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.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)
(s149 1.0)
(s150 4.0)
(s151 1.0)
(s152 0.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 6.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.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 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1843 variables, and 40 constraints, problems are : Problem set: 0 solved, 1241 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/10 constraints, Generalized P Invariants (flows): 34/51 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1241/1241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 3 (OVERLAPS) 2/552 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
[2024-06-01 02:34:10] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1843 variables, and 46 constraints, problems are : Problem set: 0 solved, 1241 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/51 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1241 constraints, Known Traps: 1/1 constraints]
After SMT, in 61427ms problems are : Problem set: 0 solved, 1241 unsolved
Search for dead transitions found 0 dead transitions in 61451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64858 ms. Remains : 557/557 places, 1286/1286 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (517 resets) in 1002 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (106 resets) in 418 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 382 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (104 resets) in 342 ms. (116 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 177277 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :2 out of 3
Probabilistic random walk after 177277 steps, saw 82431 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :2
[2024-06-01 02:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/130 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/407 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/453 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 104/557 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1286/1843 variables, 557/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1843 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1843 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1843/1843 variables, and 618 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 557/557 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/130 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 277/407 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/453 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 104/557 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1286/1843 variables, 557/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1843 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1843 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1843 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1843/1843 variables, and 619 constraints, problems are : Problem set: 0 solved, 1 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 557/557 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2032ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 1284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 555 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 554 transition count 1283
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 554 transition count 1283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 554 transition count 1282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 553 transition count 1282
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 2 with 2 rules applied. Total rules applied 10 place count 552 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 551 transition count 1280
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 551 transition count 1280
Free-agglomeration rule applied 30 times.
Iterating global reduction 2 with 30 rules applied. Total rules applied 42 place count 551 transition count 1250
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 78 place count 521 transition count 1244
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 95 place count 521 transition count 1227
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 112 place count 504 transition count 1227
Applied a total of 112 rules in 126 ms. Remains 504 /557 variables (removed 53) and now considering 1227/1286 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 504/557 places, 1227/1286 transitions.
RANDOM walk for 40000 steps (675 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (149 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276226 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276226 steps, saw 76080 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 1227 rows 504 cols
[2024-06-01 02:34:24] [INFO ] Computed 61 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/102 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/342 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/395 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/504 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1731 variables, 504/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1731 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1731 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/102 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/342 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/395 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/504 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1731 variables, 504/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1731 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1731 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1731 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 504 /504 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 504/504 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 504 /504 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-06-01 02:34:26] [INFO ] Invariant cache hit.
[2024-06-01 02:34:27] [INFO ] Implicit Places using invariants in 1085 ms returned [88, 89, 159, 160, 230, 231, 303, 304, 374, 375]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1088 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 494/504 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1156 ms. Remains : 494/504 places, 1227/1227 transitions.
RANDOM walk for 40000 steps (676 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (147 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 269263 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 269263 steps, saw 73921 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 1227 rows 494 cols
[2024-06-01 02:34:30] [INFO ] Computed 51 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/125 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/349 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/402 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/494 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1227/1721 variables, 494/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1721 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1721 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1721/1721 variables, and 545 constraints, problems are : Problem set: 0 solved, 1 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 494/494 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/125 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 224/349 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/402 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/494 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:34:32] [INFO ] Deduced a trap composed of 64 places in 644 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1227/1721 variables, 494/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1721 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1721 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1721 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 494/494 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2600ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1227/1227 transitions.
Applied a total of 0 rules in 32 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 494/494 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1227/1227 transitions.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2024-06-01 02:34:33] [INFO ] Invariant cache hit.
[2024-06-01 02:34:34] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-06-01 02:34:34] [INFO ] Invariant cache hit.
[2024-06-01 02:34:36] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
[2024-06-01 02:34:36] [INFO ] Redundant transitions in 29 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-06-01 02:34:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/1721 variables, and 47 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/494 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 1194 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 493/1721 variables, and 47 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 39/40 constraints, State Equation: 0/494 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 0/0 constraints]
After SMT, in 61245ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 61268ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64517 ms. Remains : 494/494 places, 1227/1227 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 02:35:37] [INFO ] Invariant cache hit.
[2024-06-01 02:35:37] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 02:35:37] [INFO ] [Real]Absence check using 11 positive and 40 generalized place invariants in 40 ms returned sat
[2024-06-01 02:35:38] [INFO ] After 927ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 02:35:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 02:35:38] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 36 ms returned sat
[2024-06-01 02:35:39] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 02:35:39] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 02:35:39] [INFO ] After 998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1975 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1265 reset in 401 ms.
Product exploration explored 100000 steps with 1279 reset in 468 ms.
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1286/1286 transitions.
Applied a total of 0 rules in 36 ms. Remains 557 /557 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
// Phase 1: matrix 1286 rows 557 cols
[2024-06-01 02:35:41] [INFO ] Computed 61 invariants in 18 ms
[2024-06-01 02:35:41] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-06-01 02:35:41] [INFO ] Invariant cache hit.
[2024-06-01 02:35:43] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2629 ms to find 0 implicit places.
[2024-06-01 02:35:43] [INFO ] Redundant transitions in 18 ms returned []
Running 1241 sub problems to find dead transitions.
[2024-06-01 02:35:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1241 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 550/1843 variables, and 40 constraints, problems are : Problem set: 0 solved, 1241 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/10 constraints, Generalized P Invariants (flows): 34/51 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1241/1241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 3 (OVERLAPS) 2/552 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
[2024-06-01 02:36:41] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1843 variables, and 46 constraints, problems are : Problem set: 0 solved, 1241 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/51 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1241 constraints, Known Traps: 1/1 constraints]
After SMT, in 60876ms problems are : Problem set: 0 solved, 1241 unsolved
Search for dead transitions found 0 dead transitions in 60890ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63586 ms. Remains : 557/557 places, 1286/1286 transitions.
Treatment of property ASLink-PT-06b-LTLCardinality-02 finished in 307505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((G(p1) U X(X(p2))))))))'
Support contains 6 out of 2505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2500 transition count 3077
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2500 transition count 3077
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 2496 transition count 3073
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 2496 transition count 3073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2496 transition count 3072
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2494 transition count 3070
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2494 transition count 3070
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2493 transition count 3069
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2493 transition count 3069
Applied a total of 25 rules in 1272 ms. Remains 2493 /2505 variables (removed 12) and now considering 3069/3082 (removed 13) transitions.
// Phase 1: matrix 3069 rows 2493 cols
[2024-06-01 02:36:46] [INFO ] Computed 266 invariants in 38 ms
[2024-06-01 02:36:48] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2024-06-01 02:36:48] [INFO ] Invariant cache hit.
[2024-06-01 02:37:00] [INFO ] Implicit Places using invariants and state equation in 11893 ms returned []
Implicit Place search using SMT with State Equation took 14396 ms to find 0 implicit places.
Running 3068 sub problems to find dead transitions.
[2024-06-01 02:37:00] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2492 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 3068 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2492/5562 variables, and 150 constraints, problems are : Problem set: 0 solved, 3068 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/65 constraints, Generalized P Invariants (flows): 150/201 constraints, State Equation: 0/2493 constraints, PredecessorRefiner: 3068/3068 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3068 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2492 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 3068 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2492/5562 variables, and 150 constraints, problems are : Problem set: 0 solved, 3068 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/65 constraints, Generalized P Invariants (flows): 150/201 constraints, State Equation: 0/2493 constraints, PredecessorRefiner: 0/3068 constraints, Known Traps: 0/0 constraints]
After SMT, in 61971ms problems are : Problem set: 0 solved, 3068 unsolved
Search for dead transitions found 0 dead transitions in 62007ms
Starting structural reductions in LTL mode, iteration 1 : 2493/2505 places, 3069/3082 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77682 ms. Remains : 2493/2505 places, 3069/3082 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-03
Product exploration explored 100000 steps with 19981 reset in 439 ms.
Product exploration explored 100000 steps with 20010 reset in 499 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (64 resets) in 356 ms. (112 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-06-01 02:38:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/295 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 493/788 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1630/2418 variables, 188/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2418 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/2493 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2493 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3069/5562 variables, 2493/2759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5562 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5562 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5562/5562 variables, and 2759 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2414 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 201/201 constraints, State Equation: 2493/2493 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 185/295 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 4 ms to minimize.
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 493/788 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1630/2418 variables, 188/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:38:10] [INFO ] Deduced a trap composed of 49 places in 2529 ms of which 27 ms to minimize.
[2024-06-01 02:38:14] [INFO ] Deduced a trap composed of 24 places in 3082 ms of which 30 ms to minimize.
SMT process timed out in 9505ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 3069/3069 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 456 transitions
Trivial Post-agglo rules discarded 456 transitions
Performed 456 trivial Post agglomeration. Transition count delta: 456
Iterating post reduction 0 with 456 rules applied. Total rules applied 456 place count 2493 transition count 2613
Reduce places removed 456 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 459 rules applied. Total rules applied 915 place count 2037 transition count 2610
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 918 place count 2035 transition count 2609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 919 place count 2034 transition count 2609
Performed 673 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 673 Pre rules applied. Total rules applied 919 place count 2034 transition count 1936
Deduced a syphon composed of 673 places in 5 ms
Ensure Unique test removed 62 places
Reduce places removed 735 places and 0 transitions.
Iterating global reduction 4 with 1408 rules applied. Total rules applied 2327 place count 1299 transition count 1936
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2372 place count 1293 transition count 1897
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2411 place count 1254 transition count 1897
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2411 place count 1254 transition count 1873
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2483 place count 1206 transition count 1873
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2483 place count 1206 transition count 1850
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2529 place count 1183 transition count 1850
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 6 with 406 rules applied. Total rules applied 2935 place count 979 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2939 place count 975 transition count 1644
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2944 place count 974 transition count 1644
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 6 with 1 rules applied. Total rules applied 2945 place count 974 transition count 1643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2946 place count 973 transition count 1643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2946 place count 973 transition count 1642
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2948 place count 972 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2950 place count 970 transition count 1640
Iterating global reduction 8 with 2 rules applied. Total rules applied 2952 place count 970 transition count 1640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2954 place count 970 transition count 1638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2955 place count 969 transition count 1638
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2957 place count 968 transition count 1643
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 2964 place count 968 transition count 1636
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2971 place count 961 transition count 1636
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 2976 place count 961 transition count 1631
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2981 place count 956 transition count 1631
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 2987 place count 956 transition count 1631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2988 place count 955 transition count 1630
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 16 rules applied. Total rules applied 3004 place count 944 transition count 1625
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 3009 place count 939 transition count 1625
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 17 Pre rules applied. Total rules applied 3009 place count 939 transition count 1608
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 35 rules applied. Total rules applied 3044 place count 921 transition count 1608
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 3050 place count 915 transition count 1608
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3050 place count 915 transition count 1607
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3052 place count 914 transition count 1607
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 3076 place count 902 transition count 1595
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3081 place count 897 transition count 1590
Iterating global reduction 15 with 5 rules applied. Total rules applied 3086 place count 897 transition count 1590
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 3091 place count 897 transition count 1585
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 3096 place count 892 transition count 1585
Applied a total of 3096 rules in 880 ms. Remains 892 /2493 variables (removed 1601) and now considering 1585/3069 (removed 1484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 881 ms. Remains : 892/2493 places, 1585/3069 transitions.
RANDOM walk for 32463 steps (380 resets) in 166 ms. (194 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 9 factoid took 229 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06b-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLCardinality-03 finished in 90548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2504 transition count 2616
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 472 rules applied. Total rules applied 937 place count 2039 transition count 2609
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 942 place count 2035 transition count 2608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 943 place count 2034 transition count 2608
Performed 673 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 673 Pre rules applied. Total rules applied 943 place count 2034 transition count 1935
Deduced a syphon composed of 673 places in 6 ms
Ensure Unique test removed 64 places
Reduce places removed 737 places and 0 transitions.
Iterating global reduction 4 with 1410 rules applied. Total rules applied 2353 place count 1297 transition count 1935
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2399 place count 1291 transition count 1895
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2439 place count 1251 transition count 1895
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2439 place count 1251 transition count 1870
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2514 place count 1201 transition count 1870
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2514 place count 1201 transition count 1846
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2562 place count 1177 transition count 1846
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2565 place count 1174 transition count 1836
Iterating global reduction 6 with 3 rules applied. Total rules applied 2568 place count 1174 transition count 1836
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2568 place count 1174 transition count 1835
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2570 place count 1173 transition count 1835
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2572 place count 1171 transition count 1826
Iterating global reduction 6 with 2 rules applied. Total rules applied 2574 place count 1171 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2575 place count 1170 transition count 1818
Iterating global reduction 6 with 1 rules applied. Total rules applied 2576 place count 1170 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2577 place count 1169 transition count 1810
Iterating global reduction 6 with 1 rules applied. Total rules applied 2578 place count 1169 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2579 place count 1168 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 2580 place count 1168 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2581 place count 1167 transition count 1794
Iterating global reduction 6 with 1 rules applied. Total rules applied 2582 place count 1167 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2583 place count 1166 transition count 1786
Iterating global reduction 6 with 1 rules applied. Total rules applied 2584 place count 1166 transition count 1786
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 6 with 400 rules applied. Total rules applied 2984 place count 965 transition count 1587
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2988 place count 961 transition count 1583
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2993 place count 960 transition count 1583
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 6 with 1 rules applied. Total rules applied 2994 place count 960 transition count 1582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2995 place count 959 transition count 1582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2995 place count 959 transition count 1581
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2997 place count 958 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2999 place count 956 transition count 1579
Iterating global reduction 8 with 2 rules applied. Total rules applied 3001 place count 956 transition count 1579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3003 place count 956 transition count 1577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3004 place count 955 transition count 1577
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3006 place count 954 transition count 1582
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3008 place count 952 transition count 1580
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3026 place count 940 transition count 1574
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3032 place count 934 transition count 1574
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3032 place count 934 transition count 1556
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3069 place count 915 transition count 1556
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3082 place count 902 transition count 1556
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3082 place count 902 transition count 1555
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3084 place count 901 transition count 1555
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 13 with 36 rules applied. Total rules applied 3120 place count 883 transition count 1537
Discarding 11 places :
Symmetric choice reduction at 13 with 11 rule applications. Total rules 3131 place count 872 transition count 1526
Iterating global reduction 13 with 11 rules applied. Total rules applied 3142 place count 872 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3148 place count 866 transition count 1520
Iterating global reduction 13 with 6 rules applied. Total rules applied 3154 place count 866 transition count 1520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3160 place count 866 transition count 1514
Applied a total of 3160 rules in 1029 ms. Remains 866 /2505 variables (removed 1639) and now considering 1514/3082 (removed 1568) transitions.
// Phase 1: matrix 1514 rows 866 cols
[2024-06-01 02:38:16] [INFO ] Computed 142 invariants in 18 ms
[2024-06-01 02:38:17] [INFO ] Implicit Places using invariants in 1502 ms returned [1, 18, 19, 31, 48, 66, 86, 140, 150, 151, 153, 170, 188, 208, 259, 260, 272, 273, 275, 292, 310, 330, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 752, 763, 764, 765, 783, 804, 805, 806, 807]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1505 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 809/2505 places, 1514/3082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 809 transition count 1410
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 705 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 704 transition count 1409
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 210 place count 704 transition count 1378
Deduced a syphon composed of 31 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 273 place count 672 transition count 1378
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 285 place count 668 transition count 1370
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 293 place count 660 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 296 place count 657 transition count 1367
Iterating global reduction 5 with 3 rules applied. Total rules applied 299 place count 657 transition count 1367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 302 place count 657 transition count 1364
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 396 place count 610 transition count 1317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 400 place count 608 transition count 1318
Applied a total of 400 rules in 157 ms. Remains 608 /809 variables (removed 201) and now considering 1318/1514 (removed 196) transitions.
// Phase 1: matrix 1318 rows 608 cols
[2024-06-01 02:38:17] [INFO ] Computed 80 invariants in 19 ms
[2024-06-01 02:38:19] [INFO ] Implicit Places using invariants in 1114 ms returned [89, 95, 100, 176, 182, 187, 264, 270, 276, 353, 359, 364, 441, 447, 452, 529, 535, 540, 605]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1116 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/2505 places, 1318/3082 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 589 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 564 transition count 1293
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 564 transition count 1293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 558 transition count 1287
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 558 transition count 1287
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 552 transition count 1281
Applied a total of 74 rules in 145 ms. Remains 552 /589 variables (removed 37) and now considering 1281/1318 (removed 37) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-06-01 02:38:19] [INFO ] Computed 61 invariants in 18 ms
[2024-06-01 02:38:20] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2024-06-01 02:38:20] [INFO ] Invariant cache hit.
[2024-06-01 02:38:22] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 552/2505 places, 1281/3082 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6957 ms. Remains : 552/2505 places, 1281/3082 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-04
Product exploration explored 100000 steps with 1255 reset in 601 ms.
Product exploration explored 100000 steps with 1321 reset in 439 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (505 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (109 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247016 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247016 steps, saw 103834 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 02:38:26] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/205 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 262/467 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/515 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/552 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1281/1833 variables, 552/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1833 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1833/1833 variables, and 613 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/205 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 262/467 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/515 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/552 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1281/1833 variables, 552/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1833 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1833/1833 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1972ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 552 transition count 1251
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 65 place count 522 transition count 1246
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 522 transition count 1229
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 99 place count 505 transition count 1229
Applied a total of 99 rules in 73 ms. Remains 505 /552 variables (removed 47) and now considering 1229/1281 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 505/552 places, 1229/1281 transitions.
RANDOM walk for 40000 steps (719 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (152 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 277146 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 277146 steps, saw 76470 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 1229 rows 505 cols
[2024-06-01 02:38:31] [INFO ] Computed 61 invariants in 11 ms
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/171 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 219/390 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/416 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/472 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/494 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/505 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1229/1734 variables, 505/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1734 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1734 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/171 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 219/390 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/416 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/472 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/494 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/505 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1229/1734 variables, 505/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1734 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:38:33] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1734 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1734 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1734 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1802ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 169 ms.
Support contains 2 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 505/505 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-06-01 02:38:33] [INFO ] Invariant cache hit.
[2024-06-01 02:38:34] [INFO ] Implicit Places using invariants in 663 ms returned [90, 91, 161, 162, 233, 234, 304, 305, 375, 376]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 665 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 495/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 731 ms. Remains : 495/505 places, 1229/1229 transitions.
RANDOM walk for 40000 steps (691 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (155 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302652 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302652 steps, saw 84080 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 1229 rows 495 cols
[2024-06-01 02:38:37] [INFO ] Computed 51 invariants in 11 ms
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/209 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/212 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/225 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/258 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/460 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/478 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/495 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1229/1724 variables, 495/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1724 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1724 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 546 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/209 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/212 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/225 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/258 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/460 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/478 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/495 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1229/1724 variables, 495/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1724 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:38:39] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1724 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1724 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1724 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 548 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2237ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 27 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 495/495 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 18 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-06-01 02:38:40] [INFO ] Invariant cache hit.
[2024-06-01 02:38:40] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-06-01 02:38:40] [INFO ] Invariant cache hit.
[2024-06-01 02:38:42] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2401 ms to find 0 implicit places.
[2024-06-01 02:38:42] [INFO ] Redundant transitions in 17 ms returned []
Running 1196 sub problems to find dead transitions.
[2024-06-01 02:38:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1724 variables, and 46 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/495 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 3 (OVERLAPS) 1/495 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/1724 variables, and 51 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/495 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 0/0 constraints]
After SMT, in 60907ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 60922ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63365 ms. Remains : 495/495 places, 1229/1229 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 30 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 02:39:43] [INFO ] Invariant cache hit.
[2024-06-01 02:39:43] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 02:39:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 02:39:43] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 37 ms returned sat
[2024-06-01 02:39:44] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 02:39:44] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 02:39:44] [INFO ] After 1196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1384 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 35 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-06-01 02:39:45] [INFO ] Computed 61 invariants in 18 ms
[2024-06-01 02:39:46] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-06-01 02:39:46] [INFO ] Invariant cache hit.
[2024-06-01 02:39:48] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 3076 ms to find 0 implicit places.
[2024-06-01 02:39:48] [INFO ] Redundant transitions in 31 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-06-01 02:39:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1236 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 545/1833 variables, and 39 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/11 constraints, Generalized P Invariants (flows): 33/50 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (OVERLAPS) 2/547 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1833 variables, and 45 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 34/50 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 0/0 constraints]
After SMT, in 61179ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64356 ms. Remains : 552/552 places, 1281/1281 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (510 resets) in 422 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (106 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 227034 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 227034 steps, saw 98052 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 02:40:52] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/205 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 262/467 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/515 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/552 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1833/1833 variables, and 613 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/205 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 262/467 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/515 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/552 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1281/1833 variables, 552/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1833 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1833/1833 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2229ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 552 transition count 1251
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 65 place count 522 transition count 1246
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 522 transition count 1229
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 99 place count 505 transition count 1229
Applied a total of 99 rules in 66 ms. Remains 505 /552 variables (removed 47) and now considering 1229/1281 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 505/552 places, 1229/1281 transitions.
RANDOM walk for 40000 steps (680 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (151 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 273823 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 273823 steps, saw 75308 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 1229 rows 505 cols
[2024-06-01 02:40:58] [INFO ] Computed 61 invariants in 17 ms
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/171 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 219/390 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/416 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/472 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/494 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/505 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1229/1734 variables, 505/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1734 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1734 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/171 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 219/390 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/416 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/472 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/494 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/505 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1229/1734 variables, 505/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1734 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:41:00] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1734 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1734 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1734 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 505/505 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 505 /505 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-06-01 02:41:00] [INFO ] Invariant cache hit.
[2024-06-01 02:41:01] [INFO ] Implicit Places using invariants in 680 ms returned [90, 91, 161, 162, 233, 234, 304, 305, 375, 376]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 683 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 495/505 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 721 ms. Remains : 495/505 places, 1229/1229 transitions.
RANDOM walk for 40000 steps (723 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (151 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 281855 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 281855 steps, saw 77888 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
// Phase 1: matrix 1229 rows 495 cols
[2024-06-01 02:41:04] [INFO ] Computed 51 invariants in 17 ms
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/209 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/212 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/225 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/258 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/460 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/478 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/495 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1229/1724 variables, 495/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1724 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1724 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1724/1724 variables, and 546 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/209 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/212 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/225 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/258 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/460 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/478 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/495 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1229/1724 variables, 495/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1724 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:41:07] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1724 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1724 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1724 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 548 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 33 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 495/495 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1229/1229 transitions.
Applied a total of 0 rules in 32 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2024-06-01 02:41:07] [INFO ] Invariant cache hit.
[2024-06-01 02:41:08] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2024-06-01 02:41:08] [INFO ] Invariant cache hit.
[2024-06-01 02:41:10] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2024-06-01 02:41:10] [INFO ] Redundant transitions in 17 ms returned []
Running 1196 sub problems to find dead transitions.
[2024-06-01 02:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1724 variables, and 46 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/495 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1724 variables, and 46 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/495 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 0/0 constraints]
After SMT, in 61167ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64095 ms. Remains : 495/495 places, 1229/1229 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 33 ms. Remains 495 /495 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 02:42:11] [INFO ] Invariant cache hit.
[2024-06-01 02:42:11] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 02:42:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 02:42:12] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 37 ms returned sat
[2024-06-01 02:42:12] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 02:42:13] [INFO ] After 905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 02:42:13] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1371 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1298 reset in 330 ms.
Product exploration explored 100000 steps with 1269 reset in 351 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 22 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-06-01 02:42:14] [INFO ] Computed 61 invariants in 19 ms
[2024-06-01 02:42:15] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-06-01 02:42:15] [INFO ] Invariant cache hit.
[2024-06-01 02:42:17] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 3293 ms to find 0 implicit places.
[2024-06-01 02:42:17] [INFO ] Redundant transitions in 30 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-06-01 02:42:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1833 variables, and 39 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/11 constraints, Generalized P Invariants (flows): 33/50 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (OVERLAPS) 2/547 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1236 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 547/1833 variables, and 45 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 34/50 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 0/0 constraints]
After SMT, in 61093ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61166ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64539 ms. Remains : 552/552 places, 1281/1281 transitions.
Treatment of property ASLink-PT-06b-LTLCardinality-04 finished in 303534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2498 transition count 3068
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2498 transition count 3068
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 2492 transition count 3055
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 2492 transition count 3055
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 2492 transition count 3053
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 2489 transition count 3050
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 2489 transition count 3050
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 2487 transition count 3041
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 2486 transition count 3033
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 2485 transition count 3032
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2484 transition count 3024
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 2483 transition count 3016
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 2482 transition count 3015
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 2481 transition count 3007
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 2481 transition count 3007
Applied a total of 50 rules in 2681 ms. Remains 2481 /2505 variables (removed 24) and now considering 3007/3082 (removed 75) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2024-06-01 02:43:21] [INFO ] Computed 266 invariants in 36 ms
[2024-06-01 02:43:23] [INFO ] Implicit Places using invariants in 2026 ms returned []
[2024-06-01 02:43:23] [INFO ] Invariant cache hit.
[2024-06-01 02:43:37] [INFO ] Implicit Places using invariants and state equation in 13606 ms returned []
Implicit Place search using SMT with State Equation took 15640 ms to find 0 implicit places.
Running 3006 sub problems to find dead transitions.
[2024-06-01 02:43:37] [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 13.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 3.0)
(s49 1.0)
(s50 1.0)
(s51 6.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 26.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 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 6.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.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 16.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.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 10.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.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 7.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 4.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.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 21.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 21.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 18.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 4.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 28.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 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 6.0)
(s464 0.0)
(s465 0.0)
(s466 5.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 0.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 23.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 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 1.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 0.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 0.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 1.0)
(s669 0.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 0.0)
(s680 1.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 0.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 0.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 4.0)
(s722 1.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 0.0)
(s727 0.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 17.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 17.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 14.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 3.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 93.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 0.0)
(s812 5.0)
(s813 5.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 1.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 1.0)
(s827 0.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 0.0)
(s832 0.0)
(s833 1.0)
(s834 1.0)
(s835 0.0)
(s836 0.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 0.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 2.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 1.0)
(s862 0.0)
(s863 0.0)
(s864 1.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.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 23.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 0.0)
(s970 0.0)
(s971 1.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 1.0)
(s977 0.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 0.0)
(s983 0.0)
(s984 1.0)
(s985 0.0)
(s986 0.0)
(s987 1.0)
(s988 0.0)
(s989 0.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 0.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 0.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 0.0)
(s1012 0.0)
(s1013 1.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 0.0)
(s1024 1.0)
(s1025 0.0)
(s1026 1.0)
(s1027 1.0)
(s1028 0.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 0.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 0.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 0.0)
(s1049 1.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 0.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 0.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 0.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 4.0)
(s1081 0.0)
(s1082 0.0)
(s1083 1.0)
(s1084 1.0)
(s1085 0.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 13.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 13.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 10.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 0.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 4.0)
(s1133 93.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 0.0)
(s1206 1.0)
(s1207 1.0)
(s1208 0.0)
(s1209 0.0)
(s1210 1.0)
(s1211 0.0)
(s1212 0.0)
(s1213 1.0)
(s1214 0.0)
(s1215 0.0)
(s1216 1.0)
(s1217 1.0)
(s1218 0.0)
(s1219 1.0)
(s1220 1.0)
(s1221 0.0)
(s1222 1.0)
(s1223 1.0)
(s1224 0.0)
(s1225 1.0)
(s1226 1.0)
(s1227 0.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 23.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 16.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 0.0)
(s1362 0.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 10.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 0.0)
(s1398 1.0)
(s1399 1.0)
(s1400 0.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 2.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2480/5488 variables, and 154 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/64 constraints, Generalized P Invariants (flows): 154/202 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2480/5488 variables, and 154 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/64 constraints, Generalized P Invariants (flows): 154/202 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints]
After SMT, in 61555ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 61591ms
Starting structural reductions in LTL mode, iteration 1 : 2481/2505 places, 3007/3082 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79919 ms. Remains : 2481/2505 places, 3007/3082 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-11
Stuttering criterion allowed to conclude after 367 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-11 finished in 80134 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)&&F(G(p1))))'
Support contains 4 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 461 transitions
Trivial Post-agglo rules discarded 461 transitions
Performed 461 trivial Post agglomeration. Transition count delta: 461
Iterating post reduction 0 with 461 rules applied. Total rules applied 461 place count 2504 transition count 2620
Reduce places removed 461 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 468 rules applied. Total rules applied 929 place count 2043 transition count 2613
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 934 place count 2039 transition count 2612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 935 place count 2038 transition count 2612
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 671 Pre rules applied. Total rules applied 935 place count 2038 transition count 1941
Deduced a syphon composed of 671 places in 8 ms
Ensure Unique test removed 63 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 4 with 1405 rules applied. Total rules applied 2340 place count 1304 transition count 1941
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2386 place count 1298 transition count 1901
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2426 place count 1258 transition count 1901
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2426 place count 1258 transition count 1877
Deduced a syphon composed of 24 places in 8 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2498 place count 1210 transition count 1877
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2498 place count 1210 transition count 1854
Deduced a syphon composed of 23 places in 8 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2544 place count 1187 transition count 1854
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2547 place count 1184 transition count 1844
Iterating global reduction 6 with 3 rules applied. Total rules applied 2550 place count 1184 transition count 1844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2550 place count 1184 transition count 1843
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2552 place count 1183 transition count 1843
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2554 place count 1181 transition count 1834
Iterating global reduction 6 with 2 rules applied. Total rules applied 2556 place count 1181 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2557 place count 1180 transition count 1826
Iterating global reduction 6 with 1 rules applied. Total rules applied 2558 place count 1180 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2559 place count 1179 transition count 1818
Iterating global reduction 6 with 1 rules applied. Total rules applied 2560 place count 1179 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2561 place count 1178 transition count 1810
Iterating global reduction 6 with 1 rules applied. Total rules applied 2562 place count 1178 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2563 place count 1177 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 2564 place count 1177 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2565 place count 1176 transition count 1794
Iterating global reduction 6 with 1 rules applied. Total rules applied 2566 place count 1176 transition count 1794
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 6 with 407 rules applied. Total rules applied 2973 place count 971 transition count 1592
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2977 place count 967 transition count 1588
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2982 place count 966 transition count 1588
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 6 with 1 rules applied. Total rules applied 2983 place count 966 transition count 1587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2984 place count 965 transition count 1587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2984 place count 965 transition count 1586
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2986 place count 964 transition count 1586
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2988 place count 962 transition count 1584
Iterating global reduction 8 with 2 rules applied. Total rules applied 2990 place count 962 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2992 place count 962 transition count 1582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2993 place count 961 transition count 1582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2995 place count 960 transition count 1587
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2997 place count 958 transition count 1585
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3015 place count 946 transition count 1579
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3021 place count 940 transition count 1579
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3021 place count 940 transition count 1561
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3058 place count 921 transition count 1561
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3071 place count 908 transition count 1561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3071 place count 908 transition count 1560
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3073 place count 907 transition count 1560
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3111 place count 888 transition count 1541
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3123 place count 876 transition count 1529
Iterating global reduction 13 with 12 rules applied. Total rules applied 3135 place count 876 transition count 1529
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3141 place count 870 transition count 1523
Iterating global reduction 13 with 6 rules applied. Total rules applied 3147 place count 870 transition count 1523
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3153 place count 870 transition count 1517
Applied a total of 3153 rules in 1148 ms. Remains 870 /2505 variables (removed 1635) and now considering 1517/3082 (removed 1565) transitions.
// Phase 1: matrix 1517 rows 870 cols
[2024-06-01 02:44:40] [INFO ] Computed 143 invariants in 18 ms
[2024-06-01 02:44:41] [INFO ] Implicit Places using invariants in 1246 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 238, 259, 260, 272, 273, 275, 292, 310, 330, 381, 382, 394, 395, 397, 414, 432, 454, 505, 506, 518, 519, 521, 538, 556, 576, 627, 628, 640, 641, 643, 660, 678, 698, 749, 750, 753, 765, 766, 767, 785, 806, 807, 808, 809]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 1248 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 812/2505 places, 1517/3082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 812 transition count 1415
Reduce places removed 102 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 104 rules applied. Total rules applied 206 place count 710 transition count 1413
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 708 transition count 1413
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 208 place count 708 transition count 1382
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 271 place count 676 transition count 1382
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 283 place count 672 transition count 1374
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 291 place count 664 transition count 1374
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 294 place count 661 transition count 1371
Iterating global reduction 5 with 3 rules applied. Total rules applied 297 place count 661 transition count 1371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 300 place count 661 transition count 1368
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 394 place count 614 transition count 1321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 398 place count 612 transition count 1322
Applied a total of 398 rules in 108 ms. Remains 612 /812 variables (removed 200) and now considering 1322/1517 (removed 195) transitions.
// Phase 1: matrix 1322 rows 612 cols
[2024-06-01 02:44:41] [INFO ] Computed 80 invariants in 12 ms
[2024-06-01 02:44:42] [INFO ] Implicit Places using invariants in 1170 ms returned [88, 94, 99, 182, 187, 264, 270, 275, 354, 360, 365, 442, 448, 453, 530, 536, 541, 609]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1176 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 594/2505 places, 1322/3082 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 594 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 593 transition count 1321
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 582 transition count 1310
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 582 transition count 1310
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 571 transition count 1299
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 571 transition count 1299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 566 transition count 1294
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 566 transition count 1294
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 560 transition count 1288
Applied a total of 68 rules in 155 ms. Remains 560 /594 variables (removed 34) and now considering 1288/1322 (removed 34) transitions.
// Phase 1: matrix 1288 rows 560 cols
[2024-06-01 02:44:42] [INFO ] Computed 62 invariants in 19 ms
[2024-06-01 02:44:43] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2024-06-01 02:44:43] [INFO ] Invariant cache hit.
[2024-06-01 02:44:46] [INFO ] Implicit Places using invariants and state equation in 2517 ms returned []
Implicit Place search using SMT with State Equation took 3655 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 560/2505 places, 1288/3082 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7498 ms. Remains : 560/2505 places, 1288/3082 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-12
Product exploration explored 100000 steps with 1195 reset in 429 ms.
Product exploration explored 100000 steps with 1191 reset in 448 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
RANDOM walk for 33311 steps (398 resets) in 248 ms. (133 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1)]
Support contains 2 out of 560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Applied a total of 0 rules in 38 ms. Remains 560 /560 variables (removed 0) and now considering 1288/1288 (removed 0) transitions.
[2024-06-01 02:44:48] [INFO ] Invariant cache hit.
[2024-06-01 02:44:49] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2024-06-01 02:44:49] [INFO ] Invariant cache hit.
[2024-06-01 02:44:51] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 3605 ms to find 0 implicit places.
[2024-06-01 02:44:51] [INFO ] Redundant transitions in 31 ms returned []
Running 1243 sub problems to find dead transitions.
[2024-06-01 02:44:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1848 variables, and 37 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, Generalized P Invariants (flows): 31/49 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 1243/1243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 3 (OVERLAPS) 3/556 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s73 4)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 6)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/1848 variables, and 48 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/49 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 0/1243 constraints, Known Traps: 0/0 constraints]
After SMT, in 61108ms problems are : Problem set: 0 solved, 1243 unsolved
Search for dead transitions found 0 dead transitions in 61132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64818 ms. Remains : 560/560 places, 1288/1288 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 40000 steps (500 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (105 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197559 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197559 steps, saw 83968 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-06-01 02:45:56] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/190 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/440 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/469 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/554 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/558 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/560 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1288/1848 variables, 560/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1848 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1848 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1848/1848 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/190 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/440 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/469 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/554 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/558 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/560 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1288/1848 variables, 560/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1848 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:45:58] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1848 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1848 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1848 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1848/1848 variables, and 624 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 560 transition count 1285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 557 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 557 transition count 1284
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1284
Free-agglomeration rule applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 37 place count 556 transition count 1255
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 71 place count 527 transition count 1250
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 88 place count 527 transition count 1233
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 105 place count 510 transition count 1233
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 510 transition count 1233
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 510 transition count 1232
Applied a total of 108 rules in 190 ms. Remains 510 /560 variables (removed 50) and now considering 1232/1288 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 510/560 places, 1232/1288 transitions.
RANDOM walk for 40000 steps (697 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (151 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8285 steps, run visited all 1 properties in 163 ms. (steps per millisecond=50 )
Probabilistic random walk after 8285 steps, saw 4108 distinct states, run finished after 171 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1204 reset in 255 ms.
Product exploration explored 100000 steps with 1203 reset in 297 ms.
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 560 transition count 1285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 557 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 557 transition count 1284
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1284
Applied a total of 8 rules in 32 ms. Remains 556 /560 variables (removed 4) and now considering 1284/1288 (removed 4) transitions.
// Phase 1: matrix 1284 rows 556 cols
[2024-06-01 02:45:59] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 02:46:00] [INFO ] Implicit Places using invariants in 676 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 679 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 555/560 places, 1284/1288 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 554 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 553 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 553 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 552 transition count 1281
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 552 transition count 1281
Applied a total of 6 rules in 75 ms. Remains 552 /555 variables (removed 3) and now considering 1281/1284 (removed 3) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-06-01 02:46:00] [INFO ] Computed 61 invariants in 13 ms
[2024-06-01 02:46:01] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-06-01 02:46:01] [INFO ] Invariant cache hit.
[2024-06-01 02:46:02] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/560 places, 1281/1288 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3233 ms. Remains : 552/560 places, 1281/1288 transitions.
Treatment of property ASLink-PT-06b-LTLCardinality-12 finished in 84198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2504 transition count 2616
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 472 rules applied. Total rules applied 937 place count 2039 transition count 2609
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 942 place count 2035 transition count 2608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 943 place count 2034 transition count 2608
Performed 673 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 673 Pre rules applied. Total rules applied 943 place count 2034 transition count 1935
Deduced a syphon composed of 673 places in 4 ms
Ensure Unique test removed 64 places
Reduce places removed 737 places and 0 transitions.
Iterating global reduction 4 with 1410 rules applied. Total rules applied 2353 place count 1297 transition count 1935
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2399 place count 1291 transition count 1895
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2439 place count 1251 transition count 1895
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2439 place count 1251 transition count 1870
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2514 place count 1201 transition count 1870
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2514 place count 1201 transition count 1846
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2562 place count 1177 transition count 1846
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2564 place count 1175 transition count 1837
Iterating global reduction 6 with 2 rules applied. Total rules applied 2566 place count 1175 transition count 1837
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2566 place count 1175 transition count 1836
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2568 place count 1174 transition count 1836
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2570 place count 1172 transition count 1827
Iterating global reduction 6 with 2 rules applied. Total rules applied 2572 place count 1172 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2573 place count 1171 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 2574 place count 1171 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2575 place count 1170 transition count 1811
Iterating global reduction 6 with 1 rules applied. Total rules applied 2576 place count 1170 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2577 place count 1169 transition count 1803
Iterating global reduction 6 with 1 rules applied. Total rules applied 2578 place count 1169 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2579 place count 1168 transition count 1795
Iterating global reduction 6 with 1 rules applied. Total rules applied 2580 place count 1168 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2581 place count 1167 transition count 1787
Iterating global reduction 6 with 1 rules applied. Total rules applied 2582 place count 1167 transition count 1787
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 9 ms
Ensure Unique test removed 2 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 6 with 400 rules applied. Total rules applied 2982 place count 966 transition count 1588
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2986 place count 962 transition count 1584
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2991 place count 961 transition count 1584
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 6 with 1 rules applied. Total rules applied 2992 place count 961 transition count 1583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2993 place count 960 transition count 1583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2993 place count 960 transition count 1582
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2995 place count 959 transition count 1582
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2997 place count 957 transition count 1580
Iterating global reduction 8 with 2 rules applied. Total rules applied 2999 place count 957 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3001 place count 957 transition count 1578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3002 place count 956 transition count 1578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3004 place count 955 transition count 1584
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3006 place count 953 transition count 1582
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3024 place count 941 transition count 1576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3030 place count 935 transition count 1576
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3030 place count 935 transition count 1558
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3067 place count 916 transition count 1558
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3080 place count 903 transition count 1558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3080 place count 903 transition count 1557
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3082 place count 902 transition count 1557
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3120 place count 883 transition count 1538
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3132 place count 871 transition count 1526
Iterating global reduction 13 with 12 rules applied. Total rules applied 3144 place count 871 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3150 place count 865 transition count 1520
Iterating global reduction 13 with 6 rules applied. Total rules applied 3156 place count 865 transition count 1520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3162 place count 865 transition count 1514
Applied a total of 3162 rules in 879 ms. Remains 865 /2505 variables (removed 1640) and now considering 1514/3082 (removed 1568) transitions.
// Phase 1: matrix 1514 rows 865 cols
[2024-06-01 02:46:04] [INFO ] Computed 142 invariants in 18 ms
[2024-06-01 02:46:05] [INFO ] Implicit Places using invariants in 1496 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 745, 746, 749, 760, 761, 762, 780, 801, 802, 803, 804]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1498 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 808/2505 places, 1514/3082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 808 transition count 1411
Reduce places removed 103 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 104 rules applied. Total rules applied 207 place count 705 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 704 transition count 1410
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 208 place count 704 transition count 1379
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 271 place count 672 transition count 1379
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 283 place count 668 transition count 1371
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 291 place count 660 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 294 place count 657 transition count 1368
Iterating global reduction 5 with 3 rules applied. Total rules applied 297 place count 657 transition count 1368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 300 place count 657 transition count 1365
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 396 place count 609 transition count 1317
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 6 with 2 rules applied. Total rules applied 398 place count 608 transition count 1318
Applied a total of 398 rules in 108 ms. Remains 608 /808 variables (removed 200) and now considering 1318/1514 (removed 196) transitions.
// Phase 1: matrix 1318 rows 608 cols
[2024-06-01 02:46:05] [INFO ] Computed 80 invariants in 18 ms
[2024-06-01 02:46:06] [INFO ] Implicit Places using invariants in 969 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 533, 538, 605]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 970 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/2505 places, 1318/3082 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 589 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 564 transition count 1293
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 564 transition count 1293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 558 transition count 1287
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 558 transition count 1287
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 552 transition count 1281
Applied a total of 74 rules in 128 ms. Remains 552 /589 variables (removed 37) and now considering 1281/1318 (removed 37) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2024-06-01 02:46:06] [INFO ] Computed 61 invariants in 21 ms
[2024-06-01 02:46:07] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-06-01 02:46:07] [INFO ] Invariant cache hit.
[2024-06-01 02:46:09] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 552/2505 places, 1281/3082 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6233 ms. Remains : 552/2505 places, 1281/3082 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-15
Product exploration explored 100000 steps with 1264 reset in 259 ms.
Product exploration explored 100000 steps with 1275 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 5699 steps (71 resets) in 18 ms. (299 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 21 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-06-01 02:46:10] [INFO ] Invariant cache hit.
[2024-06-01 02:46:11] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-06-01 02:46:11] [INFO ] Invariant cache hit.
[2024-06-01 02:46:13] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2024-06-01 02:46:13] [INFO ] Redundant transitions in 18 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-06-01 02:46:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1833 variables, and 39 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 32/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (OVERLAPS) 2/547 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s73 4)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 6)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s149 1)
(s150 1)
(s151 4)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 6)
(s161 1)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s228 1)
(s229 4)
(s230 1)
(s231 0)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1833 variables, and 45 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 0/0 constraints]
After SMT, in 61044ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63946 ms. Remains : 552/552 places, 1281/1281 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 2400 steps (28 resets) in 13 ms. (171 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1278 reset in 389 ms.
Product exploration explored 100000 steps with 1254 reset in 434 ms.
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 35 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-06-01 02:47:15] [INFO ] Invariant cache hit.
[2024-06-01 02:47:16] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-06-01 02:47:16] [INFO ] Invariant cache hit.
[2024-06-01 02:47:18] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 3339 ms to find 0 implicit places.
[2024-06-01 02:47:18] [INFO ] Redundant transitions in 28 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-06-01 02:47:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1833 variables, and 39 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 32/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (OVERLAPS) 2/547 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1833 variables, and 45 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 0/0 constraints]
After SMT, in 61092ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 61114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64529 ms. Remains : 552/552 places, 1281/1281 transitions.
Treatment of property ASLink-PT-06b-LTLCardinality-15 finished in 137097 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((F(p0)&&(X(p1)||G(p0))))))'
Found a Shortening insensitive property : ASLink-PT-06b-LTLCardinality-00
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2505/2505 places, 3082/3082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 464 rules applied. Total rules applied 464 place count 2504 transition count 2617
Reduce places removed 464 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 469 rules applied. Total rules applied 933 place count 2040 transition count 2612
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 937 place count 2037 transition count 2611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 938 place count 2036 transition count 2611
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 671 Pre rules applied. Total rules applied 938 place count 2036 transition count 1940
Deduced a syphon composed of 671 places in 7 ms
Ensure Unique test removed 62 places
Reduce places removed 733 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 2342 place count 1303 transition count 1940
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2387 place count 1297 transition count 1901
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2426 place count 1258 transition count 1901
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2426 place count 1258 transition count 1877
Deduced a syphon composed of 24 places in 8 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2498 place count 1210 transition count 1877
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2498 place count 1210 transition count 1854
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2544 place count 1187 transition count 1854
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2547 place count 1184 transition count 1844
Iterating global reduction 6 with 3 rules applied. Total rules applied 2550 place count 1184 transition count 1844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2550 place count 1184 transition count 1843
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2552 place count 1183 transition count 1843
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2554 place count 1181 transition count 1834
Iterating global reduction 6 with 2 rules applied. Total rules applied 2556 place count 1181 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2557 place count 1180 transition count 1826
Iterating global reduction 6 with 1 rules applied. Total rules applied 2558 place count 1180 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2559 place count 1179 transition count 1818
Iterating global reduction 6 with 1 rules applied. Total rules applied 2560 place count 1179 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2561 place count 1178 transition count 1810
Iterating global reduction 6 with 1 rules applied. Total rules applied 2562 place count 1178 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2563 place count 1177 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 2564 place count 1177 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2565 place count 1176 transition count 1794
Iterating global reduction 6 with 1 rules applied. Total rules applied 2566 place count 1176 transition count 1794
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 6 with 406 rules applied. Total rules applied 2972 place count 972 transition count 1592
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2975 place count 969 transition count 1589
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 2979 place count 968 transition count 1589
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 6 with 1 rules applied. Total rules applied 2980 place count 968 transition count 1588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2981 place count 967 transition count 1588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2981 place count 967 transition count 1587
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2983 place count 966 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2984 place count 965 transition count 1586
Iterating global reduction 8 with 1 rules applied. Total rules applied 2985 place count 965 transition count 1586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2987 place count 965 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2988 place count 964 transition count 1584
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2990 place count 963 transition count 1590
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2992 place count 961 transition count 1588
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 16 rules applied. Total rules applied 3008 place count 950 transition count 1583
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3013 place count 945 transition count 1583
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 17 Pre rules applied. Total rules applied 3013 place count 945 transition count 1566
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 35 rules applied. Total rules applied 3048 place count 927 transition count 1566
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 12 with 12 rules applied. Total rules applied 3060 place count 915 transition count 1566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3060 place count 915 transition count 1565
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3062 place count 914 transition count 1565
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 13 with 36 rules applied. Total rules applied 3098 place count 896 transition count 1547
Discarding 11 places :
Symmetric choice reduction at 13 with 11 rule applications. Total rules 3109 place count 885 transition count 1536
Iterating global reduction 13 with 11 rules applied. Total rules applied 3120 place count 885 transition count 1536
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3126 place count 879 transition count 1530
Iterating global reduction 13 with 6 rules applied. Total rules applied 3132 place count 879 transition count 1530
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3138 place count 879 transition count 1524
Applied a total of 3138 rules in 1232 ms. Remains 879 /2505 variables (removed 1626) and now considering 1524/3082 (removed 1558) transitions.
// Phase 1: matrix 1524 rows 879 cols
[2024-06-01 02:48:21] [INFO ] Computed 147 invariants in 20 ms
[2024-06-01 02:48:23] [INFO ] Implicit Places using invariants in 1836 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 206, 264, 265, 277, 278, 279, 280, 282, 299, 317, 337, 368, 371, 392, 393, 405, 406, 408, 425, 443, 463, 514, 515, 527, 528, 530, 547, 565, 585, 636, 637, 649, 650, 652, 669, 687, 707, 758, 759, 762, 773, 774, 775, 793, 814, 815, 816, 817]
[2024-06-01 02:48:23] [INFO ] Actually due to overlaps returned [793, 775, 48, 167, 299, 425, 547, 669, 150, 31, 147, 279, 282, 405, 408, 527, 530, 649, 652, 773, 814, 148, 280, 406, 528, 650, 774, 815, 1, 18, 264, 265, 277, 392, 393, 514, 515, 636, 637, 758, 759, 816, 19, 66, 85, 137, 185, 206, 278, 317, 337, 443, 463, 565, 585, 687, 707, 762, 817]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1839 ms to find 59 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 820/2505 places, 1524/3082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 820 transition count 1420
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 716 transition count 1420
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 208 place count 716 transition count 1388
Deduced a syphon composed of 32 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 65 rules applied. Total rules applied 273 place count 683 transition count 1388
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 285 place count 679 transition count 1380
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 293 place count 671 transition count 1380
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 296 place count 668 transition count 1377
Iterating global reduction 4 with 3 rules applied. Total rules applied 299 place count 668 transition count 1377
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 302 place count 668 transition count 1374
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 404 place count 617 transition count 1323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 408 place count 615 transition count 1323
Applied a total of 408 rules in 146 ms. Remains 615 /820 variables (removed 205) and now considering 1323/1524 (removed 201) transitions.
// Phase 1: matrix 1323 rows 615 cols
[2024-06-01 02:48:23] [INFO ] Computed 83 invariants in 17 ms
[2024-06-01 02:48:24] [INFO ] Implicit Places using invariants in 947 ms returned [88, 94, 99, 174, 180, 185, 267, 270, 276, 281, 358, 364, 369, 446, 452, 457, 534, 540, 545, 612]
[2024-06-01 02:48:24] [INFO ] Actually due to overlaps returned [88, 94, 99, 174, 180, 185, 267, 276, 281, 358, 364, 369, 446, 452, 457, 534, 540, 545, 612]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 951 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 596/2505 places, 1323/3082 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 596 transition count 1322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 595 transition count 1322
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 584 transition count 1311
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 584 transition count 1311
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 573 transition count 1300
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 573 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 568 transition count 1295
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 568 transition count 1295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 562 transition count 1289
Applied a total of 68 rules in 97 ms. Remains 562 /596 variables (removed 34) and now considering 1289/1323 (removed 34) transitions.
// Phase 1: matrix 1289 rows 562 cols
[2024-06-01 02:48:24] [INFO ] Computed 64 invariants in 12 ms
[2024-06-01 02:48:25] [INFO ] Implicit Places using invariants in 705 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 707 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 561/2505 places, 1289/3082 transitions.
Applied a total of 0 rules in 18 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 4993 ms. Remains : 561/2505 places, 1289/3082 transitions.
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-00
Product exploration explored 100000 steps with 1479 reset in 276 ms.
Product exploration explored 100000 steps with 1461 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7722 steps (96 resets) in 35 ms. (214 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1289/1289 transitions.
Applied a total of 0 rules in 23 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
// Phase 1: matrix 1289 rows 561 cols
[2024-06-01 02:48:27] [INFO ] Computed 63 invariants in 18 ms
[2024-06-01 02:48:28] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-06-01 02:48:28] [INFO ] Invariant cache hit.
[2024-06-01 02:48:30] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
Running 1243 sub problems to find dead transitions.
[2024-06-01 02:48:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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 0.0)
(s18 0.0)
(s19 0.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 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.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)
(s73 4.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 6.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/1850 variables, and 41 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, Generalized P Invariants (flows): 35/50 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1243/1243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 3 (OVERLAPS) 3/557 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1243 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 557/1850 variables, and 49 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 36/50 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1243 constraints, Known Traps: 0/0 constraints]
After SMT, in 61099ms problems are : Problem set: 0 solved, 1243 unsolved
Search for dead transitions found 0 dead transitions in 61122ms
Finished structural reductions in LTL mode , in 1 iterations and 64494 ms. Remains : 561/561 places, 1289/1289 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 310 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3529 steps (45 resets) in 25 ms. (135 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 437 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1564 reset in 451 ms.
Product exploration explored 100000 steps with 1563 reset in 469 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1289/1289 transitions.
Applied a total of 0 rules in 21 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-06-01 02:49:34] [INFO ] Redundant transitions in 18 ms returned []
Running 1243 sub problems to find dead transitions.
[2024-06-01 02:49:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.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 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.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)
(s73 4.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 6.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.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 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.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)
(s149 1.0)
(s150 1.0)
(s151 4.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/1850 variables, and 41 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, Generalized P Invariants (flows): 35/50 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1243/1243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 3 (OVERLAPS) 3/557 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/1850 variables, and 49 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 36/50 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1243 constraints, Known Traps: 0/0 constraints]
After SMT, in 61020ms problems are : Problem set: 0 solved, 1243 unsolved
Search for dead transitions found 0 dead transitions in 61034ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61090 ms. Remains : 561/561 places, 1289/1289 transitions.
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1289/1289 transitions.
Applied a total of 0 rules in 23 ms. Remains 561 /561 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-06-01 02:50:35] [INFO ] Invariant cache hit.
[2024-06-01 02:50:37] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2024-06-01 02:50:37] [INFO ] Invariant cache hit.
[2024-06-01 02:50:39] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 3694 ms to find 0 implicit places.
Running 1243 sub problems to find dead transitions.
[2024-06-01 02:50:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/1850 variables, and 41 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, Generalized P Invariants (flows): 35/50 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1243/1243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 3 (OVERLAPS) 3/557 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/1850 variables, and 49 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 36/50 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1243 constraints, Known Traps: 0/0 constraints]
After SMT, in 61186ms problems are : Problem set: 0 solved, 1243 unsolved
Search for dead transitions found 0 dead transitions in 61209ms
Finished structural reductions in LTL mode , in 1 iterations and 64931 ms. Remains : 561/561 places, 1289/1289 transitions.
Treatment of property ASLink-PT-06b-LTLCardinality-00 finished in 200816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 02:51:42] [INFO ] Flatten gal took : 244 ms
[2024-06-01 02:51:42] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 02:51:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2505 places, 3082 transitions and 9556 arcs took 50 ms.
Total runtime 1671212 ms.
There are residual formulas that ITS could not solve within timeout

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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024