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.r512-smll-171654407100211.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 Peterson-COL-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-3-LTLCardinality-00
FORMULA_NAME Peterson-COL-3-LTLCardinality-01
FORMULA_NAME Peterson-COL-3-LTLCardinality-02
FORMULA_NAME Peterson-COL-3-LTLCardinality-03
FORMULA_NAME Peterson-COL-3-LTLCardinality-04
FORMULA_NAME Peterson-COL-3-LTLCardinality-05
FORMULA_NAME Peterson-COL-3-LTLCardinality-06
FORMULA_NAME Peterson-COL-3-LTLCardinality-07
FORMULA_NAME Peterson-COL-3-LTLCardinality-08
FORMULA_NAME Peterson-COL-3-LTLCardinality-09
FORMULA_NAME Peterson-COL-3-LTLCardinality-10
FORMULA_NAME Peterson-COL-3-LTLCardinality-11
FORMULA_NAME Peterson-COL-3-LTLCardinality-12
FORMULA_NAME Peterson-COL-3-LTLCardinality-13
FORMULA_NAME Peterson-COL-3-LTLCardinality-14
FORMULA_NAME Peterson-COL-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717257604147

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:00:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:00:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:00:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:00:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:00:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1357 ms
[2024-06-01 16:00:08] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:00:08] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-06-01 16:00:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-COL-3-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-3-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 591 steps (0 resets) in 90 ms. (6 steps per ms) remains 0/20 properties
[2024-06-01 16:00:09] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:00:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Peterson-COL-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:00:09] [INFO ] Flatten gal took : 5 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:00:09] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 72 ms.
[2024-06-01 16:00:09] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Support contains 224 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 25 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 16:00:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 16:00:09] [INFO ] Computed 15 invariants in 39 ms
[2024-06-01 16:00:09] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-01 16:00:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:00:09] [INFO ] Invariant cache hit.
[2024-06-01 16:00:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:00:10] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 16:00:10] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:00:10] [INFO ] Invariant cache hit.
[2024-06-01 16:00:10] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 44 ms to minimize.
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 5 ms to minimize.
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 5 ms to minimize.
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 4 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 5 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:00:15] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 5 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:00:16] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 3 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 3 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:00:17] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
[2024-06-01 16:00:18] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 8 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 3 ms to minimize.
[2024-06-01 16:00:19] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 10 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 3 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 3 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:23] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:00:23] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:00:23] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 3 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:00:24] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:00:25] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:00:25] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:00:25] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 4 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 4 ms to minimize.
[2024-06-01 16:00:26] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 6 ms to minimize.
[2024-06-01 16:00:27] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:29] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 4 ms to minimize.
[2024-06-01 16:00:30] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 4 ms to minimize.
[2024-06-01 16:00:30] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:00:31] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 4 ms to minimize.
[2024-06-01 16:00:31] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:00:31] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:00:31] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:00:32] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:00:32] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:00:32] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:00:33] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 4 ms to minimize.
[2024-06-01 16:00:33] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:00:33] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 3 ms to minimize.
[2024-06-01 16:00:34] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 4 ms to minimize.
[2024-06-01 16:00:34] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:00:34] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:00:34] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:00:34] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 3 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:00:40] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:44] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:00:45] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:00:45] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:48] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:00:49] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:00:50] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:00:50] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:00:52] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 5 ms to minimize.
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in LTL mode , in 1 iterations and 61488 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 224 out of 244 places after structural reductions.
[2024-06-01 16:01:10] [INFO ] Flatten gal took : 67 ms
[2024-06-01 16:01:10] [INFO ] Flatten gal took : 60 ms
[2024-06-01 16:01:11] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (8 resets) in 1716 ms. (23 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 2/2 properties
[2024-06-01 16:01:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:01:11] [INFO ] Invariant cache hit.
[2024-06-01 16:01:11] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/552 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 4 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 4 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 4 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:01:14] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
Problem AtomicPropp8 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 20/338 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 4 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 3 ms to minimize.
[2024-06-01 16:01:15] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 3 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 3 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 552/552 variables, and 350 constraints, problems are : Problem set: 2 solved, 0 unsolved in 4671 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 32/32 constraints]
After SMT, in 5144ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 16:01:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:01:17] [INFO ] Invariant cache hit.
[2024-06-01 16:01:17] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 16:01:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:01:17] [INFO ] Invariant cache hit.
[2024-06-01 16:01:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:01:18] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 16:01:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:01:18] [INFO ] Invariant cache hit.
[2024-06-01 16:01:18] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:21] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 4 ms to minimize.
[2024-06-01 16:01:21] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 4 ms to minimize.
[2024-06-01 16:01:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:01:21] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:01:21] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 4 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 4 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 4 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:01:22] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 62 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:01:23] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 4 ms to minimize.
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:24] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 3 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 3 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:01:25] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:01:26] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 3 ms to minimize.
[2024-06-01 16:01:26] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:01:26] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:01:26] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:01:26] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:01:27] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:01:27] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 3 ms to minimize.
[2024-06-01 16:01:27] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-06-01 16:01:27] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:01:27] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:01:27] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:30] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:01:31] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:01:31] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 4 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 3 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:01:34] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 3 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:01:35] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:37] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:01:37] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:01:37] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:01:40] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:01:41] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:44] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:01:46] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:52] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:01:52] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:01:53] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:01:53] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:01:57] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:01:58] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:01:59] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 4 ms to minimize.
[2024-06-01 16:01:59] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:02:15] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:02:15] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in LTL mode , in 1 iterations and 60868 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 492 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Peterson-COL-3-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLCardinality-02 finished in 61476 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)))&&G((p1||X(p1)))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 18 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 16:02:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:02:18] [INFO ] Invariant cache hit.
[2024-06-01 16:02:19] [INFO ] Implicit Places using invariants in 284 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 302 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 17 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLCardinality-03 finished in 663 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 12 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 67 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-06-01 16:02:19] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-06-01 16:02:19] [INFO ] Computed 15 invariants in 9 ms
[2024-06-01 16:02:19] [INFO ] Implicit Places using invariants in 188 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 198 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 84/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 561 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 25 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-07 finished in 917 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(F(p0))||G(p1))))'
Support contains 84 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 208 transition count 296
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 208 transition count 272
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 184 transition count 272
Applied a total of 120 rules in 37 ms. Remains 184 /244 variables (removed 60) and now considering 272/332 (removed 60) transitions.
[2024-06-01 16:02:20] [INFO ] Flow matrix only has 248 transitions (discarded 24 similar events)
// Phase 1: matrix 248 rows 184 cols
[2024-06-01 16:02:20] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 16:02:20] [INFO ] Implicit Places using invariants in 100 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 101 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/244 places, 272/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 180/244 places, 272/332 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-09
Product exploration explored 100000 steps with 125 reset in 288 ms.
Stack based approach found an accepted trace after 61193 steps with 66 reset with depth 47 and stack size 45 in 243 ms.
FORMULA Peterson-COL-3-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-09 finished in 764 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((F(p0)&&X(p1))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 16:02:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 16:02:21] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 16:02:21] [INFO ] Implicit Places using invariants in 179 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 182 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-10
Product exploration explored 100000 steps with 12182 reset in 610 ms.
Product exploration explored 100000 steps with 12122 reset in 332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 85 steps (0 resets) in 8 ms. (9 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 391 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 16:02:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2024-06-01 16:02:23] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 16:02:24] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:02:24] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-06-01 16:02:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:02:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 16:02:25] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2024-06-01 16:02:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:02:25] [INFO ] [Nat]Added 57 Read/Feed constraints in 50 ms returned sat
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 3 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 4 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 536 ms
[2024-06-01 16:02:25] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 41 ms.
[2024-06-01 16:02:27] [INFO ] Added : 180 causal constraints over 36 iterations in 1359 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 16:02:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:02:27] [INFO ] Invariant cache hit.
[2024-06-01 16:02:27] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 16:02:27] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-06-01 16:02:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:02:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-01 16:02:28] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2024-06-01 16:02:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:02:28] [INFO ] [Nat]Added 57 Read/Feed constraints in 38 ms returned sat
[2024-06-01 16:02:28] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:02:29] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:02:29] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:02:29] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:02:29] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:02:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 959 ms
[2024-06-01 16:02:29] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 41 ms.
[2024-06-01 16:02:31] [INFO ] Added : 225 causal constraints over 45 iterations in 2227 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 88 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 240 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 15 rules applied. Total rules applied 18 place count 237 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 30 place count 225 transition count 317
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 225 transition count 309
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 217 transition count 309
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 64 place count 208 transition count 300
Applied a total of 64 rules in 39 ms. Remains 208 /240 variables (removed 32) and now considering 300/332 (removed 32) transitions.
[2024-06-01 16:02:31] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
// Phase 1: matrix 276 rows 208 cols
[2024-06-01 16:02:31] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 16:02:32] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 16:02:32] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:02:32] [INFO ] Invariant cache hit.
[2024-06-01 16:02:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:02:32] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-06-01 16:02:32] [INFO ] Redundant transitions in 30 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-01 16:02:32] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:02:32] [INFO ] Invariant cache hit.
[2024-06-01 16:02:32] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 4 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:02:35] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 5 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 4 ms to minimize.
[2024-06-01 16:02:36] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 4 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 8 ms to minimize.
[2024-06-01 16:02:37] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-06-01 16:02:38] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:02:38] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:02:38] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:02:38] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:02:38] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:02:39] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:02:40] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:02:41] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:02:42] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:02:49] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:02:50] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:02:50] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:02:50] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:02:53] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 276/484 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 57/337 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 337 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:04] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:03:07] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 276/484 variables, 208/283 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 57/340 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 296/636 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:23] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:03:26] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:03:27] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:03:27] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 641 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 69/69 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/240 places, 300/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60805 ms. Remains : 208/240 places, 300/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 224 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 90 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 556 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 16:03:34] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:03:34] [INFO ] Invariant cache hit.
[2024-06-01 16:03:34] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:03:35] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-06-01 16:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:03:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:03:35] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-06-01 16:03:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:03:35] [INFO ] [Nat]Added 57 Read/Feed constraints in 48 ms returned sat
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-06-01 16:03:35] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 42 ms.
[2024-06-01 16:03:37] [INFO ] Added : 165 causal constraints over 33 iterations in 1195 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 16:03:37] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:03:37] [INFO ] Invariant cache hit.
[2024-06-01 16:03:37] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:03:37] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-01 16:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:03:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 16:03:38] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-06-01 16:03:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:03:38] [INFO ] [Nat]Added 57 Read/Feed constraints in 26 ms returned sat
[2024-06-01 16:03:38] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-06-01 16:03:38] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 22 ms.
[2024-06-01 16:03:38] [INFO ] Added : 100 causal constraints over 20 iterations in 525 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 12369 reset in 262 ms.
Product exploration explored 100000 steps with 12432 reset in 275 ms.
Support contains 88 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 300/300 transitions.
Applied a total of 0 rules in 10 ms. Remains 208 /208 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-01 16:03:39] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:03:39] [INFO ] Invariant cache hit.
[2024-06-01 16:03:39] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 16:03:39] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:03:39] [INFO ] Invariant cache hit.
[2024-06-01 16:03:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:03:40] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-01 16:03:40] [INFO ] Redundant transitions in 5 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-01 16:03:40] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:03:40] [INFO ] Invariant cache hit.
[2024-06-01 16:03:40] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:41] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:03:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:03:43] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:03:44] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 2 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 2 ms to minimize.
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:45] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:03:46] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:03:47] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:03:48] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:03:49] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:53] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:03:54] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:03:54] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:03:54] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:03:56] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 276/484 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 57/337 constraints. Problems are: Problem set: 0 solved, 296 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 484/484 variables, and 337 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:04:12] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:04:15] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 276/484 variables, 208/283 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 57/340 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 296/636 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:04:31] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:04:33] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:04:34] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:04:34] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:04:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 641 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 69/69 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60603 ms. Remains : 208/208 places, 300/300 transitions.
Treatment of property Peterson-COL-3-LTLCardinality-10 finished in 139293 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 8 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 8 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 16:04:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 16:04:40] [INFO ] Computed 15 invariants in 4 ms
[2024-06-01 16:04:40] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 16:04:40] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:04:40] [INFO ] Invariant cache hit.
[2024-06-01 16:04:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:04:41] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 16:04:41] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 16:04:41] [INFO ] Invariant cache hit.
[2024-06-01 16:04:41] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 4 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 4 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:04:45] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:04:46] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:04:47] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:04:48] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:04:49] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:04:52] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:04:53] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 3 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:04:54] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:04:55] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:04:56] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:04:57] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:04:59] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:05:00] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:05:00] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:05:01] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 6 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:05:02] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 3 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 4 ms to minimize.
[2024-06-01 16:05:03] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:05:04] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:05:08] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-06-01 16:05:09] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:05:15] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:05:16] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:05:17] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:05:20] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:05:21] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:05:22] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:05:24] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:05:25] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Finished structural reductions in LTL mode , in 1 iterations and 60900 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-11
Product exploration explored 100000 steps with 1307 reset in 164 ms.
Stack based approach found an accepted trace after 589 steps with 8 reset with depth 26 and stack size 26 in 1 ms.
FORMULA Peterson-COL-3-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-11 finished in 61185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 22 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-06-01 16:05:41] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-06-01 16:05:41] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 16:05:41] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 16:05:41] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-06-01 16:05:41] [INFO ] Invariant cache hit.
[2024-06-01 16:05:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:05:41] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-01 16:05:41] [INFO ] Redundant transitions in 1 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-01 16:05:41] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-06-01 16:05:41] [INFO ] Invariant cache hit.
[2024-06-01 16:05:41] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:42] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:05:42] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:05:42] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:05:43] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:05:44] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:05:45] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:46] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:47] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:05:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:05:48] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:50] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 4/88 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:05:53] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 4 ms to minimize.
[2024-06-01 16:05:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 152/240 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 57/212 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 212 constraints, problems are : Problem set: 0 solved, 172 unsolved in 18879 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:06:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 4/88 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 152/240 variables, 88/159 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 57/216 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 172/388 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:08] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:06:08] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:06:09] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:12] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 16 (OVERLAPS) 0/240 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 392 constraints, problems are : Problem set: 0 solved, 172 unsolved in 21343 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 40260ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 40263ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 176/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40624 ms. Remains : 88/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 216 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 : [(NOT 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 20 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-3-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-3-LTLCardinality-12 finished in 41191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(!p0))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 192 place count 148 transition count 196
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 96 transition count 184
Applied a total of 296 rules in 21 ms. Remains 96 /244 variables (removed 148) and now considering 184/332 (removed 148) transitions.
[2024-06-01 16:06:22] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
// Phase 1: matrix 160 rows 96 cols
[2024-06-01 16:06:22] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 16:06:22] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 16:06:22] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
[2024-06-01 16:06:22] [INFO ] Invariant cache hit.
[2024-06-01 16:06:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:06:23] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-01 16:06:23] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2024-06-01 16:06:23] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
[2024-06-01 16:06:23] [INFO ] Invariant cache hit.
[2024-06-01 16:06:23] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:06:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-01 16:06:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-01 16:06:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:28] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:06:28] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:06:29] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-06-01 16:06:29] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2024-06-01 16:06:29] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:06:29] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:06:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 4/96 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 160/256 variables, 96/166 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 57/223 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 223 constraints, problems are : Problem set: 0 solved, 180 unsolved in 18201 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 4/96 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-01 16:06:44] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 160/256 variables, 96/168 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 57/225 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 180/405 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 405 constraints, problems are : Problem set: 0 solved, 180 unsolved in 13110 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 96/96 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 57/57 constraints]
After SMT, in 31369ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 31377ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/244 places, 184/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31898 ms. Remains : 96/244 places, 184/332 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, p0]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-13
Product exploration explored 100000 steps with 8712 reset in 321 ms.
Stack based approach found an accepted trace after 29 steps with 2 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-13 finished in 32311 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)))&&(G(!p1)||F(G(p2)))))'
Support contains 132 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 16:06:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 16:06:55] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 16:06:55] [INFO ] Implicit Places using invariants in 346 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 347 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 354 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) p1), (NOT p0), true]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 340 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 1 ms.
FORMULA Peterson-COL-3-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-14 finished in 1038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 16 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-06-01 16:06:56] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-06-01 16:06:56] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 16:06:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 16:06:56] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-06-01 16:06:56] [INFO ] Invariant cache hit.
[2024-06-01 16:06:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:06:56] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-01 16:06:56] [INFO ] Redundant transitions in 0 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-01 16:06:56] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-06-01 16:06:56] [INFO ] Invariant cache hit.
[2024-06-01 16:06:56] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:06:58] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:07:01] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:07:02] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 16:07:03] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:05] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 4/88 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:07:08] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 152/240 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 57/212 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 212 constraints, problems are : Problem set: 0 solved, 172 unsolved in 21577 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:20] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:07:20] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 4/88 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 152/240 variables, 88/159 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 57/216 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 172/388 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:07:26] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:07:28] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 16:07:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 16 (OVERLAPS) 0/240 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 392 constraints, problems are : Problem set: 0 solved, 172 unsolved in 22041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 88/88 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 43658ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 43661ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 176/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44035 ms. Remains : 88/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 122 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-15 finished in 44256 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((F(p0)&&X(p1))))'
Found a Shortening insensitive property : Peterson-COL-3-LTLCardinality-10
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 15 rules applied. Total rules applied 18 place count 241 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 30 place count 229 transition count 317
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 229 transition count 309
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 221 transition count 309
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 64 place count 212 transition count 300
Applied a total of 64 rules in 28 ms. Remains 212 /244 variables (removed 32) and now considering 300/332 (removed 32) transitions.
[2024-06-01 16:07:40] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
// Phase 1: matrix 276 rows 212 cols
[2024-06-01 16:07:40] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 16:07:40] [INFO ] Implicit Places using invariants in 189 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 190 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 208/244 places, 300/332 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 228 ms. Remains : 208/244 places, 300/332 transitions.
Running random walk in product with property : Peterson-COL-3-LTLCardinality-10
Product exploration explored 100000 steps with 12479 reset in 392 ms.
Product exploration explored 100000 steps with 12392 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 96 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 16:07:43] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
// Phase 1: matrix 276 rows 208 cols
[2024-06-01 16:07:43] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 16:07:43] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 16:07:43] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-06-01 16:07:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:07:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:07:44] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-01 16:07:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:07:44] [INFO ] [Nat]Added 57 Read/Feed constraints in 42 ms returned sat
[2024-06-01 16:07:44] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:07:44] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:07:44] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:07:45] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:07:45] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:07:45] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:07:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 826 ms
[2024-06-01 16:07:45] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 23 ms.
[2024-06-01 16:07:46] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:07:46] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:07:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2024-06-01 16:07:46] [INFO ] Added : 126 causal constraints over 26 iterations in 894 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 16:07:46] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:07:46] [INFO ] Invariant cache hit.
[2024-06-01 16:07:46] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:07:46] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-06-01 16:07:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:07:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:07:47] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-06-01 16:07:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:07:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2024-06-01 16:07:47] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:07:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-01 16:07:47] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 22 ms.
[2024-06-01 16:07:47] [INFO ] Added : 100 causal constraints over 20 iterations in 521 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 88 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 208 /208 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-01 16:07:48] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:07:48] [INFO ] Invariant cache hit.
[2024-06-01 16:07:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 16:07:48] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:07:48] [INFO ] Invariant cache hit.
[2024-06-01 16:07:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:07:48] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-01 16:07:48] [INFO ] Redundant transitions in 2 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-01 16:07:48] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:07:48] [INFO ] Invariant cache hit.
[2024-06-01 16:07:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:07:50] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:07:50] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 3 ms to minimize.
[2024-06-01 16:07:50] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:07:51] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:07:52] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:07:53] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:07:54] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 3 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:07:55] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:07:56] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:07:57] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:07:58] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:07:58] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:07:58] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:07:58] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:07:58] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:04] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:08:05] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:08] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 276/484 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 57/337 constraints. Problems are: Problem set: 0 solved, 296 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 484/484 variables, and 337 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:20] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:23] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:08:23] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 276/484 variables, 208/283 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 57/340 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 296/636 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:38] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:08:41] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-06-01 16:08:42] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:08:42] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 641 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 69/69 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60440 ms. Remains : 208/208 places, 300/300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 209 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 57 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 393 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 16:08:49] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:08:49] [INFO ] Invariant cache hit.
[2024-06-01 16:08:50] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:08:50] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-06-01 16:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:08:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:08:51] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-06-01 16:08:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:08:51] [INFO ] [Nat]Added 57 Read/Feed constraints in 50 ms returned sat
[2024-06-01 16:08:51] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:08:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-06-01 16:08:51] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 36 ms.
[2024-06-01 16:08:52] [INFO ] Added : 165 causal constraints over 33 iterations in 1376 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 16:08:52] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:08:52] [INFO ] Invariant cache hit.
[2024-06-01 16:08:53] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 16:08:53] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-06-01 16:08:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:08:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 16:08:54] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-06-01 16:08:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:08:54] [INFO ] [Nat]Added 57 Read/Feed constraints in 31 ms returned sat
[2024-06-01 16:08:54] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 4 ms to minimize.
[2024-06-01 16:08:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-06-01 16:08:54] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 36 ms.
[2024-06-01 16:08:55] [INFO ] Added : 100 causal constraints over 20 iterations in 860 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 12387 reset in 453 ms.
Product exploration explored 100000 steps with 12431 reset in 422 ms.
Support contains 88 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 208 /208 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-01 16:08:56] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:08:56] [INFO ] Invariant cache hit.
[2024-06-01 16:08:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 16:08:56] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:08:56] [INFO ] Invariant cache hit.
[2024-06-01 16:08:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 16:08:56] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-01 16:08:56] [INFO ] Redundant transitions in 2 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-01 16:08:56] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-06-01 16:08:56] [INFO ] Invariant cache hit.
[2024-06-01 16:08:56] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:09:03] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:09:04] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:05] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:09:05] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:09:06] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 4 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
[2024-06-01 16:09:08] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:09:09] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:09:09] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:13] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 276/484 variables, 208/280 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 57/337 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 337 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:31] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:09:32] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 276/484 variables, 208/283 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 57/340 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 296/636 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:46] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-06-01 16:09:49] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:09:49] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:09:49] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-01 16:09:53] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 641 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 208/208 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 69/69 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60455 ms. Remains : 208/208 places, 300/300 transitions.
Treatment of property Peterson-COL-3-LTLCardinality-10 finished in 136494 ms.
[2024-06-01 16:09:56] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:09:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:09:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 10 ms.
Total runtime 590114 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="Peterson-COL-3"
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 Peterson-COL-3, 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 r512-smll-171654407100211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 ;