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-171620117700035.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-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 417K 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-02b-LTLCardinality-00
FORMULA_NAME ASLink-PT-02b-LTLCardinality-01
FORMULA_NAME ASLink-PT-02b-LTLCardinality-02
FORMULA_NAME ASLink-PT-02b-LTLCardinality-03
FORMULA_NAME ASLink-PT-02b-LTLCardinality-04
FORMULA_NAME ASLink-PT-02b-LTLCardinality-05
FORMULA_NAME ASLink-PT-02b-LTLCardinality-06
FORMULA_NAME ASLink-PT-02b-LTLCardinality-07
FORMULA_NAME ASLink-PT-02b-LTLCardinality-08
FORMULA_NAME ASLink-PT-02b-LTLCardinality-09
FORMULA_NAME ASLink-PT-02b-LTLCardinality-10
FORMULA_NAME ASLink-PT-02b-LTLCardinality-11
FORMULA_NAME ASLink-PT-02b-LTLCardinality-12
FORMULA_NAME ASLink-PT-02b-LTLCardinality-13
FORMULA_NAME ASLink-PT-02b-LTLCardinality-14
FORMULA_NAME ASLink-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717183721499

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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:28:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:28:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:28:44] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2024-05-31 19:28:44] [INFO ] Transformed 1242 places.
[2024-05-31 19:28:44] [INFO ] Transformed 1621 transitions.
[2024-05-31 19:28:44] [INFO ] Found NUPN structural information;
[2024-05-31 19:28:44] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 708 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-02b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 1169 transition count 1548
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 1169 transition count 1548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 147 place count 1169 transition count 1547
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 173 place count 1143 transition count 1503
Iterating global reduction 1 with 26 rules applied. Total rules applied 199 place count 1143 transition count 1503
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 207 place count 1143 transition count 1495
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 213 place count 1137 transition count 1489
Iterating global reduction 2 with 6 rules applied. Total rules applied 219 place count 1137 transition count 1489
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 222 place count 1134 transition count 1479
Iterating global reduction 2 with 3 rules applied. Total rules applied 225 place count 1134 transition count 1479
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 1131 transition count 1476
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 1131 transition count 1476
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 234 place count 1128 transition count 1466
Iterating global reduction 2 with 3 rules applied. Total rules applied 237 place count 1128 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 1127 transition count 1458
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 1127 transition count 1458
Applied a total of 239 rules in 1278 ms. Remains 1127 /1242 variables (removed 115) and now considering 1458/1621 (removed 163) transitions.
// Phase 1: matrix 1458 rows 1127 cols
[2024-05-31 19:28:46] [INFO ] Computed 121 invariants in 196 ms
[2024-05-31 19:28:47] [INFO ] Implicit Places using invariants in 1745 ms returned [961, 972, 983, 991, 999, 1007, 1015, 1026, 1034, 1042, 1053]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1846 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1242 places, 1458/1621 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1103 transition count 1445
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1103 transition count 1445
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1093 transition count 1435
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1093 transition count 1435
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1085 transition count 1427
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1085 transition count 1427
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1081 transition count 1423
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1081 transition count 1423
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1079 transition count 1421
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1079 transition count 1421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1078 transition count 1420
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1078 transition count 1420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1077 transition count 1419
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1077 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1076 transition count 1418
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1076 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1075 transition count 1417
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1075 transition count 1417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1074 transition count 1416
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1074 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1073 transition count 1415
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1073 transition count 1415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1072 transition count 1414
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1072 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1071 transition count 1413
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1071 transition count 1413
Applied a total of 90 rules in 588 ms. Remains 1071 /1116 variables (removed 45) and now considering 1413/1458 (removed 45) transitions.
// Phase 1: matrix 1413 rows 1071 cols
[2024-05-31 19:28:48] [INFO ] Computed 110 invariants in 71 ms
[2024-05-31 19:28:49] [INFO ] Implicit Places using invariants in 840 ms returned []
[2024-05-31 19:28:49] [INFO ] Invariant cache hit.
[2024-05-31 19:28:53] [INFO ] Implicit Places using invariants and state equation in 3832 ms returned []
Implicit Place search using SMT with State Equation took 4676 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1071/1242 places, 1413/1621 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8429 ms. Remains : 1071/1242 places, 1413/1621 transitions.
Support contains 24 out of 1071 places after structural reductions.
[2024-05-31 19:28:53] [INFO ] Flatten gal took : 312 ms
[2024-05-31 19:28:54] [INFO ] Flatten gal took : 148 ms
[2024-05-31 19:28:54] [INFO ] Input system was already deterministic with 1413 transitions.
RANDOM walk for 40000 steps (151 resets) in 1540 ms. (25 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (32 resets) in 545 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (31 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
[2024-05-31 19:28:55] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 159/167 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 192/359 variables, 22/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 709/1068 variables, 82/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/1071 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1071 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1413/2484 variables, 1071/1181 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2484 variables, 0/1181 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2484 variables, 0/1181 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2484/2484 variables, and 1181 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 1071/1071 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 149/156 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 203/359 variables, 24/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 19:28:57] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 27 ms to minimize.
[2024-05-31 19:28:57] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:28:57] [INFO ] Deduced a trap composed of 112 places in 89 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 3/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 709/1068 variables, 82/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 19:28:58] [INFO ] Deduced a trap composed of 14 places in 717 ms of which 14 ms to minimize.
[2024-05-31 19:28:59] [INFO ] Deduced a trap composed of 116 places in 787 ms of which 9 ms to minimize.
[2024-05-31 19:29:00] [INFO ] Deduced a trap composed of 119 places in 646 ms of which 9 ms to minimize.
[2024-05-31 19:29:01] [INFO ] Deduced a trap composed of 115 places in 862 ms of which 10 ms to minimize.
[2024-05-31 19:29:01] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 5/117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/1071 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1071 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 6543ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1071 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1071 transition count 1230
Reduce places removed 183 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 188 rules applied. Total rules applied 371 place count 888 transition count 1225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 374 place count 885 transition count 1225
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 281 Pre rules applied. Total rules applied 374 place count 885 transition count 944
Deduced a syphon composed of 281 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 960 place count 580 transition count 944
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 978 place count 578 transition count 928
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 994 place count 562 transition count 928
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 994 place count 562 transition count 919
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1021 place count 544 transition count 919
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1021 place count 544 transition count 911
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1037 place count 536 transition count 911
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1042 place count 531 transition count 906
Iterating global reduction 5 with 5 rules applied. Total rules applied 1047 place count 531 transition count 906
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1047 place count 531 transition count 904
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1051 place count 529 transition count 904
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1052 place count 528 transition count 896
Iterating global reduction 5 with 1 rules applied. Total rules applied 1053 place count 528 transition count 896
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1054 place count 527 transition count 888
Iterating global reduction 5 with 1 rules applied. Total rules applied 1055 place count 527 transition count 888
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1056 place count 526 transition count 880
Iterating global reduction 5 with 1 rules applied. Total rules applied 1057 place count 526 transition count 880
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1058 place count 525 transition count 872
Iterating global reduction 5 with 1 rules applied. Total rules applied 1059 place count 525 transition count 872
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1060 place count 524 transition count 864
Iterating global reduction 5 with 1 rules applied. Total rules applied 1061 place count 524 transition count 864
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1062 place count 523 transition count 856
Iterating global reduction 5 with 1 rules applied. Total rules applied 1063 place count 523 transition count 856
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1064 place count 522 transition count 848
Iterating global reduction 5 with 1 rules applied. Total rules applied 1065 place count 522 transition count 848
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1066 place count 521 transition count 840
Iterating global reduction 5 with 1 rules applied. Total rules applied 1067 place count 521 transition count 840
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1068 place count 520 transition count 832
Iterating global reduction 5 with 1 rules applied. Total rules applied 1069 place count 520 transition count 832
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1070 place count 519 transition count 824
Iterating global reduction 5 with 1 rules applied. Total rules applied 1071 place count 519 transition count 824
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1072 place count 518 transition count 816
Iterating global reduction 5 with 1 rules applied. Total rules applied 1073 place count 518 transition count 816
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1074 place count 517 transition count 808
Iterating global reduction 5 with 1 rules applied. Total rules applied 1075 place count 517 transition count 808
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1076 place count 516 transition count 800
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 516 transition count 800
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 5 with 177 rules applied. Total rules applied 1254 place count 427 transition count 712
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1258 place count 423 transition count 708
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1263 place count 422 transition count 708
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 1264 place count 422 transition count 707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1265 place count 421 transition count 707
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1267 place count 419 transition count 705
Iterating global reduction 7 with 2 rules applied. Total rules applied 1269 place count 419 transition count 705
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 1271 place count 419 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1272 place count 418 transition count 703
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 1274 place count 417 transition count 708
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1278 place count 417 transition count 704
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1282 place count 413 transition count 704
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1283 place count 413 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1284 place count 412 transition count 703
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1286 place count 412 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1287 place count 411 transition count 702
Reduce places removed 4 places and 0 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 11 with 6 rules applied. Total rules applied 1293 place count 407 transition count 700
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1295 place count 405 transition count 700
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1295 place count 405 transition count 694
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1308 place count 398 transition count 694
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1311 place count 395 transition count 694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1311 place count 395 transition count 693
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1313 place count 394 transition count 693
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1323 place count 389 transition count 688
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1325 place count 387 transition count 686
Iterating global reduction 14 with 2 rules applied. Total rules applied 1327 place count 387 transition count 686
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1329 place count 387 transition count 684
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1331 place count 385 transition count 684
Applied a total of 1331 rules in 633 ms. Remains 385 /1071 variables (removed 686) and now considering 684/1413 (removed 729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 385/1071 places, 684/1413 transitions.
RANDOM walk for 40000 steps (607 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (221 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (206 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (211 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 394668 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 3
Probabilistic random walk after 394668 steps, saw 96094 distinct states, run finished after 3021 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 684 rows 385 cols
[2024-05-31 19:29:05] [INFO ] Computed 65 invariants in 25 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 183/250 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 40/290 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/292 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 92/384 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/385 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 684/1069 variables, 385/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1069 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1069 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1069/1069 variables, and 450 constraints, problems are : Problem set: 0 solved, 3 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 385/385 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:29:06] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 183/250 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 40/290 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/292 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 92/384 variables, 22/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/385 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 684/1069 variables, 385/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1069 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:29:17] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1069 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:29:23] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1069 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1069 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1069 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1069/1069 variables, and 456 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16960 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 17628ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 11937 ms.
Support contains 5 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 684/684 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 385 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 384 transition count 683
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 384 transition count 682
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 4 place count 383 transition count 682
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 383 transition count 682
Applied a total of 5 rules in 44 ms. Remains 383 /385 variables (removed 2) and now considering 682/684 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 383/385 places, 682/684 transitions.
RANDOM walk for 40000 steps (659 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (222 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (207 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 413648 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 413648 steps, saw 101046 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 682 rows 383 cols
[2024-05-31 19:29:38] [INFO ] Computed 65 invariants in 8 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/51 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 134/186 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 53/239 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/242 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 130/372 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/374 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/383 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 682/1065 variables, 383/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1065 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1065 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1065/1065 variables, and 448 constraints, problems are : Problem set: 0 solved, 2 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/51 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:29:39] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/52 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 134/186 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 53/239 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/242 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 130/372 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/374 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/374 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/383 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 682/1065 variables, 383/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1065 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1065 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1065 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1065/1065 variables, and 451 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3613ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 930 ms.
Support contains 5 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 682/682 transitions.
Applied a total of 0 rules in 22 ms. Remains 383 /383 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 383/383 places, 682/682 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 682/682 transitions.
Applied a total of 0 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-31 19:29:43] [INFO ] Invariant cache hit.
[2024-05-31 19:29:43] [INFO ] Implicit Places using invariants in 452 ms returned [1, 20, 21, 33, 50, 68, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 265, 276, 277, 278, 296, 297, 319, 320, 321, 322]
[2024-05-31 19:29:43] [INFO ] Actually due to overlaps returned [296, 278, 50, 170, 33, 153, 150, 276, 319, 151, 277, 320, 1, 261, 262, 297, 20, 21, 68, 188, 321, 265, 322]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 456 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/383 places, 682/682 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 358 transition count 638
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 314 transition count 636
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 92 place count 314 transition count 622
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 121 place count 299 transition count 622
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 133 place count 295 transition count 614
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 141 place count 287 transition count 614
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 284 transition count 611
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 284 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 150 place count 284 transition count 608
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 186 place count 266 transition count 590
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 188 place count 264 transition count 588
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 264 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 192 place count 264 transition count 586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 196 place count 262 transition count 587
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 201 place count 262 transition count 582
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 207 place count 256 transition count 582
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 214 place count 256 transition count 582
Applied a total of 214 rules in 78 ms. Remains 256 /360 variables (removed 104) and now considering 582/682 (removed 100) transitions.
// Phase 1: matrix 582 rows 256 cols
[2024-05-31 19:29:43] [INFO ] Computed 34 invariants in 6 ms
[2024-05-31 19:29:44] [INFO ] Implicit Places using invariants in 296 ms returned [76, 92, 98, 101, 103, 104, 107, 108, 161, 177, 183, 186, 188]
[2024-05-31 19:29:44] [INFO ] Actually due to overlaps returned [107, 108, 92, 98, 103, 104, 177, 183, 188, 76, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 301 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 245/383 places, 582/682 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 237 transition count 574
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 237 transition count 574
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 235 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 235 transition count 572
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 231 transition count 568
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 231 transition count 562
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 225 transition count 562
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 225 transition count 560
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 223 transition count 560
Applied a total of 44 rules in 48 ms. Remains 223 /245 variables (removed 22) and now considering 560/582 (removed 22) transitions.
// Phase 1: matrix 560 rows 223 cols
[2024-05-31 19:29:44] [INFO ] Computed 23 invariants in 5 ms
[2024-05-31 19:29:44] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 19:29:44] [INFO ] Invariant cache hit.
[2024-05-31 19:29:44] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 223/383 places, 560/682 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1718 ms. Remains : 223/383 places, 560/682 transitions.
RANDOM walk for 40000 steps (975 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (378 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (397 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 572624 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :1 out of 2
Probabilistic random walk after 572624 steps, saw 246866 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :1
[2024-05-31 19:29:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/102 variables, 8/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) 73/175 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 48/223 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 560/783 variables, 223/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/783 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 783/783 variables, and 246 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/102 variables, 8/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) 73/175 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:29:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/223 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 560/783 variables, 223/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/783 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/783 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 783/783 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1815ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 560/560 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 223 transition count 558
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 221 transition count 558
Applied a total of 4 rules in 12 ms. Remains 221 /223 variables (removed 2) and now considering 558/560 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 221/223 places, 558/560 transitions.
RANDOM walk for 40000 steps (965 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (391 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 684438 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 1
Probabilistic random walk after 684438 steps, saw 218969 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
// Phase 1: matrix 558 rows 221 cols
[2024-05-31 19:29:53] [INFO ] Computed 23 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/150 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/180 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/221 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 558/779 variables, 221/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/779 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/779 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 779/779 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/150 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:29:53] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/180 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/221 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 558/779 variables, 221/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/779 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 779/779 variables, and 246 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2615 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3020ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 558/558 transitions.
Applied a total of 0 rules in 9 ms. Remains 221 /221 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 221/221 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 558/558 transitions.
Applied a total of 0 rules in 8 ms. Remains 221 /221 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-31 19:29:56] [INFO ] Invariant cache hit.
[2024-05-31 19:29:56] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-31 19:29:56] [INFO ] Invariant cache hit.
[2024-05-31 19:29:57] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2024-05-31 19:29:57] [INFO ] Redundant transitions in 56 ms returned []
Running 541 sub problems to find dead transitions.
[2024-05-31 19:29:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-31 19:30:12] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 4 ms to minimize.
[2024-05-31 19:30:13] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 3 ms to minimize.
[2024-05-31 19:30:14] [INFO ] Deduced a trap composed of 71 places in 274 ms of which 4 ms to minimize.
[2024-05-31 19:30:17] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 4 ms to minimize.
[2024-05-31 19:30:18] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-31 19:30:25] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 221/779 variables, and 29 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/221 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 7 (OVERLAPS) 558/779 variables, 221/250 constraints. Problems are: Problem set: 110 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/779 variables, and 681 constraints, problems are : Problem set: 110 solved, 431 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 431/541 constraints, Known Traps: 6/6 constraints]
After SMT, in 60925ms problems are : Problem set: 110 solved, 431 unsolved
Search for dead transitions found 110 dead transitions in 60944ms
Found 110 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 110 transitions
Dead transitions reduction (with SMT) removed 110 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 221/221 places, 448/558 transitions.
Applied a total of 0 rules in 10 ms. Remains 221 /221 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2024-05-31 19:30:58] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62449 ms. Remains : 221/221 places, 448/558 transitions.
FORMULA ASLink-PT-02b-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 42 stabilizing places and 42 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 1070 transition count 1230
Reduce places removed 182 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 187 rules applied. Total rules applied 369 place count 888 transition count 1225
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 373 place count 885 transition count 1224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 884 transition count 1224
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 284 Pre rules applied. Total rules applied 374 place count 884 transition count 940
Deduced a syphon composed of 284 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 966 place count 576 transition count 940
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 984 place count 574 transition count 924
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1000 place count 558 transition count 924
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1000 place count 558 transition count 915
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1027 place count 540 transition count 915
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1027 place count 540 transition count 907
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1043 place count 532 transition count 907
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1049 place count 526 transition count 901
Iterating global reduction 6 with 6 rules applied. Total rules applied 1055 place count 526 transition count 901
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1055 place count 526 transition count 898
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1061 place count 523 transition count 898
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1063 place count 521 transition count 889
Iterating global reduction 6 with 2 rules applied. Total rules applied 1065 place count 521 transition count 889
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1066 place count 520 transition count 881
Iterating global reduction 6 with 1 rules applied. Total rules applied 1067 place count 520 transition count 881
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1068 place count 519 transition count 873
Iterating global reduction 6 with 1 rules applied. Total rules applied 1069 place count 519 transition count 873
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1070 place count 518 transition count 865
Iterating global reduction 6 with 1 rules applied. Total rules applied 1071 place count 518 transition count 865
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1072 place count 517 transition count 857
Iterating global reduction 6 with 1 rules applied. Total rules applied 1073 place count 517 transition count 857
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1074 place count 516 transition count 849
Iterating global reduction 6 with 1 rules applied. Total rules applied 1075 place count 516 transition count 849
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1076 place count 515 transition count 841
Iterating global reduction 6 with 1 rules applied. Total rules applied 1077 place count 515 transition count 841
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1078 place count 514 transition count 833
Iterating global reduction 6 with 1 rules applied. Total rules applied 1079 place count 514 transition count 833
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1080 place count 513 transition count 825
Iterating global reduction 6 with 1 rules applied. Total rules applied 1081 place count 513 transition count 825
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1082 place count 512 transition count 817
Iterating global reduction 6 with 1 rules applied. Total rules applied 1083 place count 512 transition count 817
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1084 place count 511 transition count 809
Iterating global reduction 6 with 1 rules applied. Total rules applied 1085 place count 511 transition count 809
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1086 place count 510 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 1087 place count 510 transition count 801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1088 place count 509 transition count 793
Iterating global reduction 6 with 1 rules applied. Total rules applied 1089 place count 509 transition count 793
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 1263 place count 421 transition count 707
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1267 place count 417 transition count 703
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1272 place count 416 transition count 703
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 1273 place count 416 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1274 place count 415 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1274 place count 415 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1276 place count 414 transition count 701
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1278 place count 412 transition count 699
Iterating global reduction 8 with 2 rules applied. Total rules applied 1280 place count 412 transition count 699
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 1282 place count 412 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1283 place count 411 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1285 place count 410 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1287 place count 408 transition count 700
Reduce places removed 4 places and 0 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 10 with 6 rules applied. Total rules applied 1293 place count 404 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1295 place count 402 transition count 698
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1295 place count 402 transition count 692
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1308 place count 395 transition count 692
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 1313 place count 390 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1313 place count 390 transition count 691
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1315 place count 389 transition count 691
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1329 place count 382 transition count 684
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1333 place count 378 transition count 680
Iterating global reduction 13 with 4 rules applied. Total rules applied 1337 place count 378 transition count 680
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1339 place count 376 transition count 678
Iterating global reduction 13 with 2 rules applied. Total rules applied 1341 place count 376 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1343 place count 376 transition count 676
Applied a total of 1343 rules in 601 ms. Remains 376 /1071 variables (removed 695) and now considering 676/1413 (removed 737) transitions.
// Phase 1: matrix 676 rows 376 cols
[2024-05-31 19:30:59] [INFO ] Computed 62 invariants in 7 ms
[2024-05-31 19:31:00] [INFO ] Implicit Places using invariants in 438 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 260, 271, 272, 273, 291, 312, 313, 314, 315]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 441 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/1071 places, 676/1413 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 351 transition count 633
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 308 transition count 633
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 86 place count 308 transition count 618
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 117 place count 292 transition count 618
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 129 place count 288 transition count 610
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 137 place count 280 transition count 610
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 277 transition count 607
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 277 transition count 607
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 277 transition count 604
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 186 place count 257 transition count 584
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 255 transition count 585
Applied a total of 190 rules in 45 ms. Remains 255 /351 variables (removed 96) and now considering 585/676 (removed 91) transitions.
// Phase 1: matrix 585 rows 255 cols
[2024-05-31 19:31:00] [INFO ] Computed 32 invariants in 5 ms
[2024-05-31 19:31:00] [INFO ] Implicit Places using invariants in 284 ms returned [88, 94, 99, 174, 180, 185, 252]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 287 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 248/1071 places, 585/1413 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 248 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 247 transition count 584
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 243 transition count 580
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 243 transition count 580
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 239 transition count 576
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 239 transition count 576
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 237 transition count 574
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 237 transition count 574
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 235 transition count 572
Applied a total of 26 rules in 42 ms. Remains 235 /248 variables (removed 13) and now considering 572/585 (removed 13) transitions.
// Phase 1: matrix 572 rows 235 cols
[2024-05-31 19:31:00] [INFO ] Computed 25 invariants in 5 ms
[2024-05-31 19:31:00] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-31 19:31:00] [INFO ] Invariant cache hit.
[2024-05-31 19:31:01] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 235/1071 places, 572/1413 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2430 ms. Remains : 235/1071 places, 572/1413 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-00
Product exploration explored 100000 steps with 2528 reset in 560 ms.
Product exploration explored 100000 steps with 2538 reset in 371 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 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1677 steps (46 resets) in 9 ms. (167 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 101 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 235 /235 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2024-05-31 19:31:03] [INFO ] Invariant cache hit.
[2024-05-31 19:31:03] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 19:31:03] [INFO ] Invariant cache hit.
[2024-05-31 19:31:04] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2024-05-31 19:31:04] [INFO ] Redundant transitions in 10 ms returned []
Running 551 sub problems to find dead transitions.
[2024-05-31 19:31:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-05-31 19:31:23] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 551 unsolved
SMT process timed out in 30578ms, After SMT, problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 30591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31974 ms. Remains : 235/235 places, 572/572 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 120 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 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3676 steps (96 resets) in 26 ms. (136 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 143 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2539 reset in 273 ms.
Product exploration explored 100000 steps with 2556 reset in 312 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 572/572 transitions.
Applied a total of 0 rules in 13 ms. Remains 235 /235 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2024-05-31 19:31:36] [INFO ] Invariant cache hit.
[2024-05-31 19:31:36] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 19:31:36] [INFO ] Invariant cache hit.
[2024-05-31 19:31:37] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2024-05-31 19:31:37] [INFO ] Redundant transitions in 4 ms returned []
Running 551 sub problems to find dead transitions.
[2024-05-31 19:31:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-05-31 19:31:57] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/807 variables, and 26 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 9 (OVERLAPS) 572/807 variables, 235/261 constraints. Problems are: Problem set: 75 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 737 constraints, problems are : Problem set: 75 solved, 476 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 476/551 constraints, Known Traps: 1/1 constraints]
After SMT, in 60603ms problems are : Problem set: 75 solved, 476 unsolved
Search for dead transitions found 75 dead transitions in 60611ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 235/235 places, 497/572 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-05-31 19:32:38] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61814 ms. Remains : 235/235 places, 497/572 transitions.
Treatment of property ASLink-PT-02b-LTLCardinality-00 finished in 99574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1070 transition count 1228
Reduce places removed 184 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 189 rules applied. Total rules applied 373 place count 886 transition count 1223
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 377 place count 883 transition count 1222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 378 place count 882 transition count 1222
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 378 place count 882 transition count 940
Deduced a syphon composed of 282 places in 3 ms
Ensure Unique test removed 24 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 588 rules applied. Total rules applied 966 place count 576 transition count 940
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 984 place count 574 transition count 924
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1000 place count 558 transition count 924
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1000 place count 558 transition count 915
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1027 place count 540 transition count 915
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1027 place count 540 transition count 907
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1043 place count 532 transition count 907
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1048 place count 527 transition count 902
Iterating global reduction 6 with 5 rules applied. Total rules applied 1053 place count 527 transition count 902
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1053 place count 527 transition count 899
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1059 place count 524 transition count 899
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1061 place count 522 transition count 890
Iterating global reduction 6 with 2 rules applied. Total rules applied 1063 place count 522 transition count 890
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1064 place count 521 transition count 882
Iterating global reduction 6 with 1 rules applied. Total rules applied 1065 place count 521 transition count 882
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1066 place count 520 transition count 874
Iterating global reduction 6 with 1 rules applied. Total rules applied 1067 place count 520 transition count 874
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1068 place count 519 transition count 866
Iterating global reduction 6 with 1 rules applied. Total rules applied 1069 place count 519 transition count 866
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1070 place count 518 transition count 858
Iterating global reduction 6 with 1 rules applied. Total rules applied 1071 place count 518 transition count 858
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1072 place count 517 transition count 850
Iterating global reduction 6 with 1 rules applied. Total rules applied 1073 place count 517 transition count 850
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1074 place count 516 transition count 842
Iterating global reduction 6 with 1 rules applied. Total rules applied 1075 place count 516 transition count 842
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1076 place count 515 transition count 834
Iterating global reduction 6 with 1 rules applied. Total rules applied 1077 place count 515 transition count 834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1078 place count 514 transition count 826
Iterating global reduction 6 with 1 rules applied. Total rules applied 1079 place count 514 transition count 826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1080 place count 513 transition count 818
Iterating global reduction 6 with 1 rules applied. Total rules applied 1081 place count 513 transition count 818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1082 place count 512 transition count 810
Iterating global reduction 6 with 1 rules applied. Total rules applied 1083 place count 512 transition count 810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1084 place count 511 transition count 802
Iterating global reduction 6 with 1 rules applied. Total rules applied 1085 place count 511 transition count 802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1086 place count 510 transition count 794
Iterating global reduction 6 with 1 rules applied. Total rules applied 1087 place count 510 transition count 794
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 176 rules applied. Total rules applied 1263 place count 421 transition count 707
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1267 place count 417 transition count 703
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1272 place count 416 transition count 703
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 1273 place count 416 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1274 place count 415 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1274 place count 415 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1276 place count 414 transition count 701
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1278 place count 412 transition count 699
Iterating global reduction 8 with 2 rules applied. Total rules applied 1280 place count 412 transition count 699
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 1282 place count 412 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1283 place count 411 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1285 place count 410 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1287 place count 408 transition count 700
Reduce places removed 4 places and 0 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 10 with 6 rules applied. Total rules applied 1293 place count 404 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1295 place count 402 transition count 698
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1295 place count 402 transition count 692
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1308 place count 395 transition count 692
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 1313 place count 390 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1313 place count 390 transition count 691
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1315 place count 389 transition count 691
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1329 place count 382 transition count 684
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1332 place count 379 transition count 681
Iterating global reduction 13 with 3 rules applied. Total rules applied 1335 place count 379 transition count 681
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1336 place count 378 transition count 680
Iterating global reduction 13 with 1 rules applied. Total rules applied 1337 place count 378 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1338 place count 378 transition count 679
Applied a total of 1338 rules in 507 ms. Remains 378 /1071 variables (removed 693) and now considering 679/1413 (removed 734) transitions.
// Phase 1: matrix 679 rows 378 cols
[2024-05-31 19:32:39] [INFO ] Computed 62 invariants in 6 ms
[2024-05-31 19:32:39] [INFO ] Implicit Places using invariants in 439 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 168, 186, 260, 261, 264, 275, 276, 277, 295, 316, 317, 318, 319]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 443 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 354/1071 places, 679/1413 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 354 transition count 635
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 310 transition count 635
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 88 place count 310 transition count 620
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 119 place count 294 transition count 620
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 131 place count 290 transition count 612
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 139 place count 282 transition count 612
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 142 place count 279 transition count 609
Iterating global reduction 4 with 3 rules applied. Total rules applied 145 place count 279 transition count 609
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 279 transition count 606
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 186 place count 260 transition count 587
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 258 transition count 588
Applied a total of 190 rules in 27 ms. Remains 258 /354 variables (removed 96) and now considering 588/679 (removed 91) transitions.
// Phase 1: matrix 588 rows 258 cols
[2024-05-31 19:32:39] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 19:32:39] [INFO ] Implicit Places using invariants in 531 ms returned [88, 94, 99, 178, 184, 189, 255]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 540 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 251/1071 places, 588/1413 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 251 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 250 transition count 587
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 246 transition count 583
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 246 transition count 583
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 242 transition count 579
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 242 transition count 579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 240 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 240 transition count 577
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 238 transition count 575
Applied a total of 26 rules in 38 ms. Remains 238 /251 variables (removed 13) and now considering 575/588 (removed 13) transitions.
// Phase 1: matrix 575 rows 238 cols
[2024-05-31 19:32:40] [INFO ] Computed 26 invariants in 7 ms
[2024-05-31 19:32:40] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-31 19:32:40] [INFO ] Invariant cache hit.
[2024-05-31 19:32:41] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 238/1071 places, 575/1413 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2918 ms. Remains : 238/1071 places, 575/1413 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 52 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-02b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-02 finished in 3025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1066 transition count 1408
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1066 transition count 1408
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 1062 transition count 1397
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 1062 transition count 1397
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 1062 transition count 1396
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1060 transition count 1387
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1060 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1059 transition count 1386
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1059 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1058 transition count 1378
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1058 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1057 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1057 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1056 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1056 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1055 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1055 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1054 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1054 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1053 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1053 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1052 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1052 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1051 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1051 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1050 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1050 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1049 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1049 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1048 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1048 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1047 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1047 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1046 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1046 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1045 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1045 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1044 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1044 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1043 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1043 transition count 1293
Applied a total of 57 rules in 1037 ms. Remains 1043 /1071 variables (removed 28) and now considering 1293/1413 (removed 120) transitions.
// Phase 1: matrix 1293 rows 1043 cols
[2024-05-31 19:32:42] [INFO ] Computed 110 invariants in 20 ms
[2024-05-31 19:32:43] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2024-05-31 19:32:43] [INFO ] Invariant cache hit.
[2024-05-31 19:32:46] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 4434 ms to find 0 implicit places.
Running 1292 sub problems to find dead transitions.
[2024-05-31 19:32:47] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/2336 variables, and 64 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 64/80 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 1292/1292 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/2336 variables, and 64 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 64/80 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 0/1292 constraints, Known Traps: 0/0 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1071 places, 1293/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66048 ms. Remains : 1043/1071 places, 1293/1413 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 27 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02b-LTLCardinality-05 finished in 67182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1064 transition count 1406
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1064 transition count 1406
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1060 transition count 1395
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1060 transition count 1395
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 1060 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1058 transition count 1385
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1041 transition count 1291
Applied a total of 61 rules in 868 ms. Remains 1041 /1071 variables (removed 30) and now considering 1291/1413 (removed 122) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-31 19:33:49] [INFO ] Computed 110 invariants in 19 ms
[2024-05-31 19:33:50] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-05-31 19:33:50] [INFO ] Invariant cache hit.
[2024-05-31 19:33:54] [INFO ] Implicit Places using invariants and state equation in 4386 ms returned []
Implicit Place search using SMT with State Equation took 5347 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-31 19:33:54] [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 13.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 3.0)
(s46 1.0)
(s47 6.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 10.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 5.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 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.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 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 0.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 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 0/0 constraints]
After SMT, in 60751ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60779ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1071 places, 1291/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67000 ms. Remains : 1041/1071 places, 1291/1413 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 6917 steps with 26 reset in 21 ms.
FORMULA ASLink-PT-02b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-06 finished in 67213 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(p1)&&p0)))||G(p2)))'
Support contains 4 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1066 transition count 1408
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1066 transition count 1408
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1064 transition count 1399
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1064 transition count 1399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1063 transition count 1391
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1063 transition count 1391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1062 transition count 1390
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1062 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1061 transition count 1382
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1061 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1060 transition count 1374
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1060 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1059 transition count 1373
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1059 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1058 transition count 1365
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1058 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1057 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1057 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1056 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1056 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1055 transition count 1348
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1055 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1054 transition count 1340
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1054 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1053 transition count 1339
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1053 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1052 transition count 1331
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1052 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1051 transition count 1323
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1051 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1050 transition count 1322
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1050 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1049 transition count 1314
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1049 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1048 transition count 1306
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1048 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1047 transition count 1305
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1047 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1046 transition count 1297
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1046 transition count 1297
Applied a total of 50 rules in 726 ms. Remains 1046 /1071 variables (removed 25) and now considering 1297/1413 (removed 116) transitions.
// Phase 1: matrix 1297 rows 1046 cols
[2024-05-31 19:34:56] [INFO ] Computed 110 invariants in 12 ms
[2024-05-31 19:34:57] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-05-31 19:34:57] [INFO ] Invariant cache hit.
[2024-05-31 19:35:01] [INFO ] Implicit Places using invariants and state equation in 4403 ms returned []
Implicit Place search using SMT with State Equation took 5195 ms to find 0 implicit places.
Running 1296 sub problems to find dead transitions.
[2024-05-31 19:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1045 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/2343 variables, and 61 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 61/82 constraints, State Equation: 0/1046 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1045 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1045 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (OVERLAPS) 1/1046 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1046 variables, 21/110 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-31 19:35:59] [INFO ] Deduced a trap composed of 207 places in 701 ms of which 10 ms to minimize.
[2024-05-31 19:36:00] [INFO ] Deduced a trap composed of 311 places in 704 ms of which 9 ms to minimize.
[2024-05-31 19:36:01] [INFO ] Deduced a trap composed of 41 places in 385 ms of which 5 ms to minimize.
[2024-05-31 19:36:02] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 5 ms to minimize.
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 1046/2343 variables, and 114 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 0/1046 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 4/4 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Starting structural reductions in LTL mode, iteration 1 : 1046/1071 places, 1297/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66423 ms. Remains : 1046/1071 places, 1297/1413 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2119 steps with 12 reset in 7 ms.
FORMULA ASLink-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-07 finished in 66800 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 1 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1064 transition count 1406
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1064 transition count 1406
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1060 transition count 1395
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1060 transition count 1395
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 1060 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1058 transition count 1385
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1041 transition count 1291
Applied a total of 61 rules in 711 ms. Remains 1041 /1071 variables (removed 30) and now considering 1291/1413 (removed 122) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-31 19:36:03] [INFO ] Computed 110 invariants in 11 ms
[2024-05-31 19:36:04] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-31 19:36:04] [INFO ] Invariant cache hit.
[2024-05-31 19:36:07] [INFO ] Implicit Places using invariants and state equation in 3417 ms returned []
Implicit Place search using SMT with State Equation took 4208 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-31 19:36:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 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 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-31 19:37:05] [INFO ] Deduced a trap composed of 89 places in 362 ms of which 6 ms to minimize.
[2024-05-31 19:37:06] [INFO ] Deduced a trap composed of 55 places in 580 ms of which 7 ms to minimize.
[2024-05-31 19:37:06] [INFO ] Deduced a trap composed of 115 places in 429 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/2332 variables, and 113 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 3/3 constraints]
After SMT, in 60468ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1071 places, 1291/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65408 ms. Remains : 1041/1071 places, 1291/1413 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-08
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-08 finished in 65538 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 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 1070 transition count 1227
Reduce places removed 185 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 190 rules applied. Total rules applied 375 place count 885 transition count 1222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 378 place count 882 transition count 1222
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 378 place count 882 transition count 940
Deduced a syphon composed of 282 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 966 place count 576 transition count 940
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 984 place count 574 transition count 924
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1000 place count 558 transition count 924
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1000 place count 558 transition count 915
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1027 place count 540 transition count 915
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1027 place count 540 transition count 907
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1043 place count 532 transition count 907
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1049 place count 526 transition count 901
Iterating global reduction 5 with 6 rules applied. Total rules applied 1055 place count 526 transition count 901
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1055 place count 526 transition count 898
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1061 place count 523 transition count 898
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1063 place count 521 transition count 889
Iterating global reduction 5 with 2 rules applied. Total rules applied 1065 place count 521 transition count 889
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1066 place count 520 transition count 881
Iterating global reduction 5 with 1 rules applied. Total rules applied 1067 place count 520 transition count 881
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1068 place count 519 transition count 873
Iterating global reduction 5 with 1 rules applied. Total rules applied 1069 place count 519 transition count 873
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1070 place count 518 transition count 865
Iterating global reduction 5 with 1 rules applied. Total rules applied 1071 place count 518 transition count 865
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1072 place count 517 transition count 857
Iterating global reduction 5 with 1 rules applied. Total rules applied 1073 place count 517 transition count 857
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1074 place count 516 transition count 849
Iterating global reduction 5 with 1 rules applied. Total rules applied 1075 place count 516 transition count 849
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1076 place count 515 transition count 841
Iterating global reduction 5 with 1 rules applied. Total rules applied 1077 place count 515 transition count 841
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1078 place count 514 transition count 833
Iterating global reduction 5 with 1 rules applied. Total rules applied 1079 place count 514 transition count 833
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1080 place count 513 transition count 825
Iterating global reduction 5 with 1 rules applied. Total rules applied 1081 place count 513 transition count 825
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1082 place count 512 transition count 817
Iterating global reduction 5 with 1 rules applied. Total rules applied 1083 place count 512 transition count 817
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1084 place count 511 transition count 809
Iterating global reduction 5 with 1 rules applied. Total rules applied 1085 place count 511 transition count 809
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1086 place count 510 transition count 801
Iterating global reduction 5 with 1 rules applied. Total rules applied 1087 place count 510 transition count 801
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1088 place count 509 transition count 793
Iterating global reduction 5 with 1 rules applied. Total rules applied 1089 place count 509 transition count 793
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 174 rules applied. Total rules applied 1263 place count 421 transition count 707
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1267 place count 417 transition count 703
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1272 place count 416 transition count 703
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 1273 place count 416 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1274 place count 415 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1274 place count 415 transition count 701
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1276 place count 414 transition count 701
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1278 place count 412 transition count 699
Iterating global reduction 7 with 2 rules applied. Total rules applied 1280 place count 412 transition count 699
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 1282 place count 412 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1283 place count 411 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1285 place count 410 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1287 place count 408 transition count 700
Reduce places removed 4 places and 0 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 9 with 6 rules applied. Total rules applied 1293 place count 404 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1295 place count 402 transition count 698
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1295 place count 402 transition count 692
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1308 place count 395 transition count 692
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1313 place count 390 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1313 place count 390 transition count 691
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1315 place count 389 transition count 691
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 14 rules applied. Total rules applied 1329 place count 382 transition count 684
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1333 place count 378 transition count 680
Iterating global reduction 12 with 4 rules applied. Total rules applied 1337 place count 378 transition count 680
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1339 place count 376 transition count 678
Iterating global reduction 12 with 2 rules applied. Total rules applied 1341 place count 376 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1343 place count 376 transition count 676
Applied a total of 1343 rules in 347 ms. Remains 376 /1071 variables (removed 695) and now considering 676/1413 (removed 737) transitions.
// Phase 1: matrix 676 rows 376 cols
[2024-05-31 19:37:08] [INFO ] Computed 62 invariants in 6 ms
[2024-05-31 19:37:09] [INFO ] Implicit Places using invariants in 535 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 151, 168, 186, 206, 257, 258, 261, 272, 273, 274, 292, 313, 314, 315, 316]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 548 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/1071 places, 676/1413 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 352 transition count 638
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 314 transition count 638
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 76 place count 314 transition count 627
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 302 transition count 627
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 111 place count 298 transition count 619
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 119 place count 290 transition count 619
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 287 transition count 616
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 287 transition count 616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 287 transition count 613
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 168 place count 267 transition count 593
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 5 with 4 rules applied. Total rules applied 172 place count 265 transition count 594
Applied a total of 172 rules in 28 ms. Remains 265 /352 variables (removed 87) and now considering 594/676 (removed 82) transitions.
// Phase 1: matrix 594 rows 265 cols
[2024-05-31 19:37:09] [INFO ] Computed 33 invariants in 5 ms
[2024-05-31 19:37:09] [INFO ] Implicit Places using invariants in 329 ms returned [184, 190, 195, 262]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 330 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 261/1071 places, 594/1413 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 261 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 260 transition count 593
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 258 transition count 591
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 258 transition count 591
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 256 transition count 589
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 256 transition count 589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 255 transition count 588
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 255 transition count 588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 254 transition count 587
Applied a total of 14 rules in 25 ms. Remains 254 /261 variables (removed 7) and now considering 587/594 (removed 7) transitions.
// Phase 1: matrix 587 rows 254 cols
[2024-05-31 19:37:09] [INFO ] Computed 29 invariants in 4 ms
[2024-05-31 19:37:09] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-31 19:37:09] [INFO ] Invariant cache hit.
[2024-05-31 19:37:10] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 254/1071 places, 587/1413 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2238 ms. Remains : 254/1071 places, 587/1413 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-09
Product exploration explored 100000 steps with 2327 reset in 235 ms.
Stack based approach found an accepted trace after 13859 steps with 316 reset with depth 27 and stack size 27 in 51 ms.
FORMULA ASLink-PT-02b-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-09 finished in 2598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U G(p1))))'
Support contains 4 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1065 transition count 1407
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1065 transition count 1407
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1062 transition count 1397
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1062 transition count 1397
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 1062 transition count 1396
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1060 transition count 1387
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1060 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1059 transition count 1386
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1059 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1058 transition count 1378
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1058 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1057 transition count 1370
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1057 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1056 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1056 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1055 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1055 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1054 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1054 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1053 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1053 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1052 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1052 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1051 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1051 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1050 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1050 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1049 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1049 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1048 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1048 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1047 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1047 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1046 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1046 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1045 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1045 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1044 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1044 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1043 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1043 transition count 1293
Applied a total of 57 rules in 759 ms. Remains 1043 /1071 variables (removed 28) and now considering 1293/1413 (removed 120) transitions.
// Phase 1: matrix 1293 rows 1043 cols
[2024-05-31 19:37:11] [INFO ] Computed 110 invariants in 11 ms
[2024-05-31 19:37:12] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-31 19:37:12] [INFO ] Invariant cache hit.
[2024-05-31 19:37:16] [INFO ] Implicit Places using invariants and state equation in 3793 ms returned []
Implicit Place search using SMT with State Equation took 4588 ms to find 0 implicit places.
Running 1292 sub problems to find dead transitions.
[2024-05-31 19:37:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1292 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 1042/2336 variables, and 65 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/29 constraints, Generalized P Invariants (flows): 65/81 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 1292/1292 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1042 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 2 (OVERLAPS) 1/1043 variables, 29/94 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1043 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
[2024-05-31 19:38:14] [INFO ] Deduced a trap composed of 96 places in 502 ms of which 6 ms to minimize.
[2024-05-31 19:38:14] [INFO ] Deduced a trap composed of 100 places in 264 ms of which 4 ms to minimize.
[2024-05-31 19:38:16] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 5 ms to minimize.
[2024-05-31 19:38:16] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 4 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 1043/2336 variables, and 114 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 0/1292 constraints, Known Traps: 4/4 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1071 places, 1293/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65825 ms. Remains : 1043/1071 places, 1293/1413 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-10 finished in 66065 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||X(p0)))))'
Support contains 1 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1065 transition count 1407
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1065 transition count 1407
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1062 transition count 1404
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1062 transition count 1404
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 1062 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1061 transition count 1402
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1061 transition count 1402
Applied a total of 21 rules in 145 ms. Remains 1061 /1071 variables (removed 10) and now considering 1402/1413 (removed 11) transitions.
// Phase 1: matrix 1402 rows 1061 cols
[2024-05-31 19:38:17] [INFO ] Computed 110 invariants in 13 ms
[2024-05-31 19:38:17] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-31 19:38:17] [INFO ] Invariant cache hit.
[2024-05-31 19:38:21] [INFO ] Implicit Places using invariants and state equation in 3315 ms returned []
Implicit Place search using SMT with State Equation took 4146 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-31 19:38:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
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 13.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.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 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.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 3.0)
(s46 1.0)
(s47 6.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 10.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 6.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 2.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 0.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 0.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 1.0)
(s358 1.0)
(s359 1.0)
(s360 0.0)
(s361 4.0)
(s362 1.0)
(s363 0.0)
(s364 0.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 23.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 5.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 5.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 2.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 4.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 94.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 20.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.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 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 0.0)
(s621 1.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 0.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 1.0)
(s647 1.0)
(s648 1.0)
(s649 0.0)
(s650 1.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 0.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 0.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 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 0.0)
(s720 4.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 23.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 62.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 4.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 93.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 0.0)
(s815 1.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 0.0)
(s826 1.0)
(s827 0.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 0.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 4.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2463 variables, and 65 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1060 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (OVERLAPS) 1/1061 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1061 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-31 19:39:21] [INFO ] Deduced a trap composed of 137 places in 297 ms of which 4 ms to minimize.
[2024-05-31 19:39:21] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/2463 variables, and 112 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 2/2 constraints]
After SMT, in 60624ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Starting structural reductions in LTL mode, iteration 1 : 1061/1071 places, 1402/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64936 ms. Remains : 1061/1071 places, 1402/1413 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-11
Product exploration explored 100000 steps with 404 reset in 247 ms.
Product exploration explored 100000 steps with 414 reset in 286 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1126 steps (4 resets) in 9 ms. (112 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 119 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1061 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1061/1061 places, 1402/1402 transitions.
Applied a total of 0 rules in 35 ms. Remains 1061 /1061 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-31 19:39:22] [INFO ] Invariant cache hit.
[2024-05-31 19:39:23] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-31 19:39:23] [INFO ] Invariant cache hit.
[2024-05-31 19:39:27] [INFO ] Implicit Places using invariants and state equation in 3397 ms returned []
Implicit Place search using SMT with State Equation took 4194 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-31 19:39:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2463 variables, and 65 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1060 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (OVERLAPS) 1/1061 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1061 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-31 19:40:27] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 4 ms to minimize.
SMT process timed out in 60752ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Finished structural reductions in LTL mode , in 1 iterations and 65014 ms. Remains : 1061/1061 places, 1402/1402 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3014 steps (14 resets) in 13 ms. (215 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 118 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 402 reset in 234 ms.
Stack based approach found an accepted trace after 76887 steps with 313 reset with depth 467 and stack size 467 in 200 ms.
FORMULA ASLink-PT-02b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-11 finished in 131998 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)&&X(X(F(p1))))))'
Support contains 4 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1413/1413 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1064 transition count 1406
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1064 transition count 1406
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1060 transition count 1395
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1060 transition count 1395
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 1060 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1058 transition count 1385
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1058 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1057 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1057 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1056 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1056 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1041 transition count 1291
Applied a total of 61 rules in 681 ms. Remains 1041 /1071 variables (removed 30) and now considering 1291/1413 (removed 122) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2024-05-31 19:40:29] [INFO ] Computed 110 invariants in 12 ms
[2024-05-31 19:40:30] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-31 19:40:30] [INFO ] Invariant cache hit.
[2024-05-31 19:40:33] [INFO ] Implicit Places using invariants and state equation in 3419 ms returned []
Implicit Place search using SMT with State Equation took 4342 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2024-05-31 19:40:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
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 13.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 3.0)
(s46 1.0)
(s47 6.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 10.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 5.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 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.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 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.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 0.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 0.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 0.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 9.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 5.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 5.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 2.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 4.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 4.0)
(s416 1.0)
(s417 76.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.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 13.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 4.0)
(s718 1.0)
(s719 0.0)
(s720 1.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 23.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 18.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 4.0)
(s769 1.0)
(s770 1.0)
(s771 93.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 4.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 7.0)
(s868 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1040 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (OVERLAPS) 1/1041 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-31 19:41:32] [INFO ] Deduced a trap composed of 89 places in 355 ms of which 6 ms to minimize.
[2024-05-31 19:41:33] [INFO ] Deduced a trap composed of 55 places in 561 ms of which 8 ms to minimize.
[2024-05-31 19:41:34] [INFO ] Deduced a trap composed of 115 places in 432 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/2332 variables, and 113 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 3/3 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1071 places, 1291/1413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65540 ms. Remains : 1041/1071 places, 1291/1413 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-15 finished in 65862 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)))'
[2024-05-31 19:41:35] [INFO ] Flatten gal took : 69 ms
[2024-05-31 19:41:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 19:41:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1071 places, 1413 transitions and 4478 arcs took 17 ms.
Total runtime 771542 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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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