Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446300083.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717248236126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:23:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:23:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:23:57] [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 13:23:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:23:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 871 ms
[2024-06-01 13:23:58] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:23:59] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 12 ms.
[2024-06-01 13:23:59] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (18 resets) in 1676 ms. (23 steps per ms) remains 7/31 properties
BEST_FIRST walk for 40000 steps (11 resets) in 555 ms. (71 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (28 resets) in 291 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 237 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 283 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (69 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (24 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
[2024-06-01 13:24:00] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:24:00] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 13:24:00] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/50 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/55 variables, 4/11 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Real declared 79/145 variables, and 25 constraints, problems are : Problem set: 7 solved, 0 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:24:00] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 13:24:00] [INFO ] Flatten gal took : 29 ms
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:24:00] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:24:00] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 35 ms.
[2024-06-01 13:24:00] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 339 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Applied a total of 0 rules in 43 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:24:00] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-06-01 13:24:00] [INFO ] Computed 50 invariants in 84 ms
[2024-06-01 13:24:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 65 places in 285 ms of which 28 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 5 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 97 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 10 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:24:19] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:24:20] [INFO ] Deduced a trap composed of 323 places in 313 ms of which 5 ms to minimize.
[2024-06-01 13:24:21] [INFO ] Deduced a trap composed of 354 places in 299 ms of which 8 ms to minimize.
[2024-06-01 13:24:21] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 348 places in 297 ms of which 4 ms to minimize.
SMT process timed out in 21745ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 21775ms
[2024-06-01 13:24:22] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 13:24:22] [INFO ] Invariant cache hit.
[2024-06-01 13:24:22] [INFO ] Implicit Places using invariants in 292 ms returned [472, 473, 474, 475, 476, 477, 478, 479]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 301 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 606/614 places, 1114/1114 transitions.
Applied a total of 0 rules in 24 ms. Remains 606 /606 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22172 ms. Remains : 606/614 places, 1114/1114 transitions.
Support contains 339 out of 606 places after structural reductions.
[2024-06-01 13:24:22] [INFO ] Flatten gal took : 125 ms
[2024-06-01 13:24:23] [INFO ] Flatten gal took : 101 ms
[2024-06-01 13:24:23] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 298 out of 606 places (down from 339) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 600 ms. (66 steps per ms) remains 5/25 properties
BEST_FIRST walk for 40002 steps (9 resets) in 233 ms. (170 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (35 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
[2024-06-01 13:24:23] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 606 cols
[2024-06-01 13:24:23] [INFO ] Computed 42 invariants in 28 ms
[2024-06-01 13:24:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 222/247 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 27/274 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 596/1704 variables, and 33 constraints, problems are : Problem set: 3 solved, 0 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/606 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 11 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)||(F(p1)&&F(G(p2)))))'
Support contains 19 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 71 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:24:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 13:24:24] [INFO ] Computed 40 invariants in 29 ms
[2024-06-01 13:24:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 325 places in 286 ms of which 5 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 346 places in 342 ms of which 5 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 5 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 307 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 313 places in 306 ms of which 6 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 299 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 353 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:24:54] [INFO ] Deduced a trap composed of 324 places in 290 ms of which 6 ms to minimize.
[2024-06-01 13:24:54] [INFO ] Deduced a trap composed of 311 places in 263 ms of which 6 ms to minimize.
[2024-06-01 13:24:59] [INFO ] Deduced a trap composed of 313 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:25:00] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41489ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41503ms
[2024-06-01 13:25:05] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:25:05] [INFO ] Invariant cache hit.
[2024-06-01 13:25:06] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-06-01 13:25:06] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:25:06] [INFO ] Invariant cache hit.
[2024-06-01 13:25:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:25:13] [INFO ] Implicit Places using invariants and state equation in 7599 ms returned []
Implicit Place search using SMT with State Equation took 8083 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:25:13] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:25:13] [INFO ] Invariant cache hit.
[2024-06-01 13:25:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 3 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 334 places in 321 ms of which 5 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 339 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 183 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:25:27] [INFO ] Deduced a trap composed of 314 places in 341 ms of which 5 ms to minimize.
[2024-06-01 13:25:27] [INFO ] Deduced a trap composed of 334 places in 310 ms of which 5 ms to minimize.
[2024-06-01 13:25:27] [INFO ] Deduced a trap composed of 351 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:25:28] [INFO ] Deduced a trap composed of 338 places in 309 ms of which 5 ms to minimize.
[2024-06-01 13:25:28] [INFO ] Deduced a trap composed of 307 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:25:28] [INFO ] Deduced a trap composed of 324 places in 341 ms of which 4 ms to minimize.
[2024-06-01 13:25:29] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 6 ms to minimize.
[2024-06-01 13:25:29] [INFO ] Deduced a trap composed of 307 places in 331 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:25:31] [INFO ] Deduced a trap composed of 283 places in 305 ms of which 5 ms to minimize.
[2024-06-01 13:25:31] [INFO ] Deduced a trap composed of 353 places in 311 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 (/ 1.0 2.0))
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 (/ 1.0 2.0))
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 (/ 1.0 2.0))
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 299 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 397 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 408 places in 209 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61445ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61459ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111124 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Product exploration explored 100000 steps with 50000 reset in 383 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 p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-00 finished in 112563 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 24 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 57 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:26:16] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:26:16] [INFO ] Invariant cache hit.
[2024-06-01 13:26:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 334 places in 228 ms of which 22 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 339 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 183 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 334 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 351 places in 264 ms of which 5 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 338 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 307 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 324 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 307 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 283 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 353 places in 240 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41344ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41358ms
[2024-06-01 13:26:58] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:26:58] [INFO ] Invariant cache hit.
[2024-06-01 13:26:58] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-06-01 13:26:58] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:26:58] [INFO ] Invariant cache hit.
[2024-06-01 13:26:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:27:06] [INFO ] Implicit Places using invariants and state equation in 7513 ms returned []
Implicit Place search using SMT with State Equation took 7909 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:27:06] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:27:06] [INFO ] Invariant cache hit.
[2024-06-01 13:27:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 334 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 339 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 183 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 314 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 334 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 351 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 338 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 307 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 324 places in 333 ms of which 3 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 307 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 283 places in 270 ms of which 8 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 353 places in 246 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:49] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:27:59] [INFO ] Deduced a trap composed of 299 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:27:59] [INFO ] Deduced a trap composed of 397 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:27:59] [INFO ] Deduced a trap composed of 408 places in 193 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61241ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61251ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110582 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 6877 reset in 336 ms.
Product exploration explored 100000 steps with 6871 reset in 378 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:28:08] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:28:08] [INFO ] Invariant cache hit.
[2024-06-01 13:28:09] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:28:09] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 74 ms returned sat
[2024-06-01 13:28:10] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2024-06-01 13:28:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:28:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:28:11] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 232 ms returned sat
[2024-06-01 13:28:14] [INFO ] [Nat]Absence check using state equation in 3645 ms returned unknown
Could not prove EG (NOT p0)
Support contains 24 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 540 transition count 1002
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 492 transition count 1002
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 320 place count 428 transition count 938
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 212 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:28:15] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-06-01 13:28:15] [INFO ] Computed 40 invariants in 12 ms
[2024-06-01 13:28:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 43 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 200 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:28:23] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:28:28] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:28:29] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:28:30] [INFO ] Deduced a trap composed of 191 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:28:30] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:28:33] [INFO ] Deduced a trap composed of 254 places in 168 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 54 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:28:38] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:28:40] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:28:44] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 5 (OVERLAPS) 1/419 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1334 variables, and 59 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 20/20 constraints]
After SMT, in 41416ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41424ms
[2024-06-01 13:28:56] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:28:56] [INFO ] Invariant cache hit.
[2024-06-01 13:28:56] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 13:28:56] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:28:56] [INFO ] Invariant cache hit.
[2024-06-01 13:28:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:29:00] [INFO ] Implicit Places using invariants and state equation in 3961 ms returned []
Implicit Place search using SMT with State Equation took 4340 ms to find 0 implicit places.
[2024-06-01 13:29:00] [INFO ] Redundant transitions in 51 ms returned []
Running 928 sub problems to find dead transitions.
[2024-06-01 13:29:00] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:29:00] [INFO ] Invariant cache hit.
[2024-06-01 13:29:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:29:08] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:29:08] [INFO ] Deduced a trap composed of 207 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:29:08] [INFO ] Deduced a trap composed of 184 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:29:08] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 4 ms to minimize.
[2024-06-01 13:29:08] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:29:09] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 254 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:29:24] [INFO ] Deduced a trap composed of 172 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 7.0)
(s1 3.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 3.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 55 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:29:42] [INFO ] Deduced a trap composed of 248 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:29:42] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 184 places in 225 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 60 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 22/22 constraints]
After SMT, in 61195ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 930/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107253 ms. Remains : 420/588 places, 930/1098 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 50 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:30:02] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:30:02] [INFO ] Invariant cache hit.
[2024-06-01 13:30:03] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-06-01 13:30:03] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 107 ms returned sat
[2024-06-01 13:30:04] [INFO ] [Real]Absence check using state equation in 1426 ms returned sat
[2024-06-01 13:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:30:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-01 13:30:05] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 33 ms returned sat
[2024-06-01 13:30:06] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2024-06-01 13:30:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:30:07] [INFO ] [Nat]Added 96 Read/Feed constraints in 864 ms returned sat
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 2 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 190 places in 381 ms of which 6 ms to minimize.
[2024-06-01 13:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2303 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7591 reset in 334 ms.
Product exploration explored 100000 steps with 7576 reset in 370 ms.
Support contains 24 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 930/930 transitions.
Applied a total of 0 rules in 15 ms. Remains 420 /420 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:30:10] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:30:10] [INFO ] Invariant cache hit.
[2024-06-01 13:30:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:30:18] [INFO ] Deduced a trap composed of 177 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:30:18] [INFO ] Deduced a trap composed of 207 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:30:18] [INFO ] Deduced a trap composed of 184 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:30:18] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:30:19] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:30:19] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:30:20] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:30:21] [INFO ] Deduced a trap composed of 254 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 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 418/1334 variables, and 54 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:30:33] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:30:35] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:30:40] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41356ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41365ms
[2024-06-01 13:30:51] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:30:51] [INFO ] Invariant cache hit.
[2024-06-01 13:30:51] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-01 13:30:51] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:30:51] [INFO ] Invariant cache hit.
[2024-06-01 13:30:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:30:55] [INFO ] Implicit Places using invariants and state equation in 3467 ms returned []
Implicit Place search using SMT with State Equation took 3843 ms to find 0 implicit places.
[2024-06-01 13:30:55] [INFO ] Redundant transitions in 57 ms returned []
Running 928 sub problems to find dead transitions.
[2024-06-01 13:30:55] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:30:55] [INFO ] Invariant cache hit.
[2024-06-01 13:30:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 6 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 177 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 207 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 184 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 171 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 254 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 172 places in 143 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 55 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 248 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:31:36] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:31:36] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:31:53] [INFO ] Deduced a trap composed of 184 places in 250 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 60 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 22/22 constraints]
After SMT, in 61401ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 61414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106710 ms. Remains : 420/420 places, 930/930 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-02 finished in 340252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 19 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:31:57] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 13:31:57] [INFO ] Computed 40 invariants in 20 ms
[2024-06-01 13:31:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 325 places in 289 ms of which 5 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 165 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 346 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 308 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 307 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 313 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 299 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 353 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 324 places in 282 ms of which 5 ms to minimize.
[2024-06-01 13:32:26] [INFO ] Deduced a trap composed of 311 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:32:31] [INFO ] Deduced a trap composed of 313 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:32:32] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41399ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41413ms
[2024-06-01 13:32:38] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:32:38] [INFO ] Invariant cache hit.
[2024-06-01 13:32:38] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-06-01 13:32:38] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:32:38] [INFO ] Invariant cache hit.
[2024-06-01 13:32:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:32:46] [INFO ] Implicit Places using invariants and state equation in 7259 ms returned []
Implicit Place search using SMT with State Equation took 7591 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:32:46] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:32:46] [INFO ] Invariant cache hit.
[2024-06-01 13:32:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 334 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 339 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 183 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 5 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 334 places in 288 ms of which 5 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 351 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 338 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 307 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 324 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 307 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:00] [INFO ] Deduced a trap composed of 283 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:33:01] [INFO ] Deduced a trap composed of 353 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 299 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 397 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 408 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61332ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61341ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110370 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-05 finished in 110475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 23 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:33:47] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:33:47] [INFO ] Invariant cache hit.
[2024-06-01 13:33:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 2 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:33:57] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 334 places in 316 ms of which 5 ms to minimize.
[2024-06-01 13:33:58] [INFO ] Deduced a trap composed of 339 places in 311 ms of which 5 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 183 places in 286 ms of which 5 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 5 ms to minimize.
[2024-06-01 13:33:59] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:34:00] [INFO ] Deduced a trap composed of 314 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:34:00] [INFO ] Deduced a trap composed of 334 places in 305 ms of which 5 ms to minimize.
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 351 places in 315 ms of which 5 ms to minimize.
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 338 places in 291 ms of which 5 ms to minimize.
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 307 places in 270 ms of which 5 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 324 places in 318 ms of which 5 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 307 places in 282 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 283 places in 285 ms of which 5 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 353 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41131ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41140ms
[2024-06-01 13:34:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:34:28] [INFO ] Invariant cache hit.
[2024-06-01 13:34:29] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 13:34:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:34:29] [INFO ] Invariant cache hit.
[2024-06-01 13:34:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:34:36] [INFO ] Implicit Places using invariants and state equation in 7129 ms returned []
Implicit Place search using SMT with State Equation took 7443 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:34:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:34:36] [INFO ] Invariant cache hit.
[2024-06-01 13:34:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:34:46] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:34:47] [INFO ] Deduced a trap composed of 334 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:34:47] [INFO ] Deduced a trap composed of 339 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:34:47] [INFO ] Deduced a trap composed of 183 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:34:47] [INFO ] Deduced a trap composed of 64 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:34:48] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:34:48] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 334 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 351 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 338 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 307 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 324 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 307 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 283 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 353 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:35:29] [INFO ] Deduced a trap composed of 299 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:35:29] [INFO ] Deduced a trap composed of 397 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:35:29] [INFO ] Deduced a trap composed of 408 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61068ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61076ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109689 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-06 finished in 110526 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||G(p1))) U X(X((p2 U X(p3))))))'
Support contains 56 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 32 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:35:38] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 13:35:38] [INFO ] Computed 40 invariants in 11 ms
[2024-06-01 13:35:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:35:48] [INFO ] Deduced a trap composed of 183 places in 371 ms of which 3 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 349 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:35:49] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:35:50] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:35:50] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:35:51] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:35:56] [INFO ] Deduced a trap composed of 330 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 307 places in 267 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 51 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 408 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 398 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 315 places in 284 ms of which 5 ms to minimize.
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 364 places in 265 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1096 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 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 19/19 constraints]
After SMT, in 41501ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41519ms
[2024-06-01 13:36:19] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:36:19] [INFO ] Invariant cache hit.
[2024-06-01 13:36:20] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 13:36:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:36:20] [INFO ] Invariant cache hit.
[2024-06-01 13:36:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:36:28] [INFO ] Implicit Places using invariants and state equation in 8493 ms returned []
Implicit Place search using SMT with State Equation took 8873 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:36:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:36:28] [INFO ] Invariant cache hit.
[2024-06-01 13:36:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:36:40] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:36:42] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:36:45] [INFO ] Deduced a trap composed of 331 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 328 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:36:46] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:36:49] [INFO ] Deduced a trap composed of 322 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:36:49] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:36:50] [INFO ] Deduced a trap composed of 301 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:36:50] [INFO ] Deduced a trap composed of 293 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 71 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 178 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 312 places in 289 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 353 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 59 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 395 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 313 places in 288 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 5 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 370 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 313 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:37:23] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 403 places in 232 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 67 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 29/29 constraints]
After SMT, in 61429ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61444ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111879 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 501 ms :[(NOT p3), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-07
Product exploration explored 100000 steps with 4635 reset in 473 ms.
Product exploration explored 100000 steps with 4505 reset in 479 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) p2 (NOT p3) (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 11 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
RANDOM walk for 337 steps (0 resets) in 8 ms. (37 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F p3), (F (NOT (OR (NOT p1) (NOT p2) p0 p3))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 414 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 445 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1))]
[2024-06-01 13:37:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:37:33] [INFO ] Invariant cache hit.
[2024-06-01 13:37:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:37:34] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 53 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p3) (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F p3), (F (NOT (OR (NOT p1) (NOT p2) p0 p3))), (F p0), (F p1), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 5 factoid took 357 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-07 finished in 116407 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 32 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 604 transition count 1058
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 548 transition count 1058
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 548 transition count 994
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 484 transition count 994
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 476 transition count 986
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 476 transition count 986
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 336 place count 436 transition count 946
Applied a total of 336 rules in 93 ms. Remains 436 /606 variables (removed 170) and now considering 946/1114 (removed 168) transitions.
Running 944 sub problems to find dead transitions.
[2024-06-01 13:37:34] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
// Phase 1: matrix 930 rows 436 cols
[2024-06-01 13:37:34] [INFO ] Computed 40 invariants in 15 ms
[2024-06-01 13:37:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 191 places in 218 ms of which 2 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 9.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 6.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 4.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 50 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 266 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:38:01] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:38:06] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:38:07] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:38:07] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(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 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 9)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 10)
(s332 0)
(s333 0)
(s334 0)
(s335 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 55 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 17/17 constraints]
After SMT, in 41491ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 41501ms
[2024-06-01 13:38:16] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 13:38:16] [INFO ] Invariant cache hit.
[2024-06-01 13:38:16] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 13:38:16] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 13:38:16] [INFO ] Invariant cache hit.
[2024-06-01 13:38:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:38:19] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
[2024-06-01 13:38:19] [INFO ] Redundant transitions in 7 ms returned []
Running 944 sub problems to find dead transitions.
[2024-06-01 13:38:19] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 13:38:19] [INFO ] Invariant cache hit.
[2024-06-01 13:38:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 179 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 237 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 266 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:38:41] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 52 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 159 places in 226 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:39:03] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/436 variables, 2/56 constraints. Problems are: Problem set: 88 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/1366 variables, and 56 constraints, problems are : Problem set: 88 solved, 856 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 16/16 constraints]
After SMT, in 61430ms problems are : Problem set: 88 solved, 856 unsolved
Search for dead transitions found 88 dead transitions in 61443ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 436/606 places, 858/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 418 transition count 826
Applied a total of 16 rules in 54 ms. Remains 418 /436 variables (removed 18) and now considering 826/858 (removed 32) transitions.
[2024-06-01 13:39:21] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
// Phase 1: matrix 810 rows 418 cols
[2024-06-01 13:39:21] [INFO ] Computed 40 invariants in 18 ms
[2024-06-01 13:39:21] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-06-01 13:39:21] [INFO ] Flow matrix only has 810 transitions (discarded 16 similar events)
[2024-06-01 13:39:21] [INFO ] Invariant cache hit.
[2024-06-01 13:39:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:39:24] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 3074 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 418/606 places, 826/1114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109747 ms. Remains : 418/606 places, 826/1114 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-08
Stuttering criterion allowed to conclude after 3207 steps with 0 reset in 9 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-08 finished in 109813 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(G((p0||F(p1))))&&F(p2))))'
Support contains 82 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 21 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:39:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 13:39:24] [INFO ] Computed 40 invariants in 12 ms
[2024-06-01 13:39:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 325 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 165 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:39:35] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 346 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 308 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:39:36] [INFO ] Deduced a trap composed of 307 places in 337 ms of which 4 ms to minimize.
[2024-06-01 13:39:37] [INFO ] Deduced a trap composed of 313 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:39:37] [INFO ] Deduced a trap composed of 299 places in 259 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 353 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:39:48] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 324 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 311 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 313 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41534ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41544ms
[2024-06-01 13:40:05] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:40:05] [INFO ] Invariant cache hit.
[2024-06-01 13:40:06] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-01 13:40:06] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:40:06] [INFO ] Invariant cache hit.
[2024-06-01 13:40:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:40:14] [INFO ] Implicit Places using invariants and state equation in 7948 ms returned []
Implicit Place search using SMT with State Equation took 8260 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:40:14] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:40:14] [INFO ] Invariant cache hit.
[2024-06-01 13:40:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:40:22] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:40:22] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:40:22] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:40:22] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:40:23] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:40:23] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:40:23] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:40:23] [INFO ] Deduced a trap composed of 334 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:40:24] [INFO ] Deduced a trap composed of 339 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:40:24] [INFO ] Deduced a trap composed of 183 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:40:24] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:40:25] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 334 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 351 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 338 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 307 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 324 places in 217 ms of which 2 ms to minimize.
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 2 ms to minimize.
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 307 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:40:28] [INFO ] Deduced a trap composed of 283 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:40:29] [INFO ] Deduced a trap composed of 353 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:40:56] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:41:07] [INFO ] Deduced a trap composed of 299 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:41:08] [INFO ] Deduced a trap composed of 397 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:41:08] [INFO ] Deduced a trap composed of 408 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61230ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61241ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111074 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-09
Stuttering criterion allowed to conclude after 34460 steps with 184 reset in 209 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-09 finished in 111521 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(p0))'
Support contains 57 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 16 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:41:15] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:41:15] [INFO ] Invariant cache hit.
[2024-06-01 13:41:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 1 ms to minimize.
[2024-06-01 13:41:25] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:41:26] [INFO ] Deduced a trap composed of 334 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:41:26] [INFO ] Deduced a trap composed of 339 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:41:26] [INFO ] Deduced a trap composed of 183 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:41:26] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:41:27] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:41:27] [INFO ] Deduced a trap composed of 314 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 334 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 351 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:41:28] [INFO ] Deduced a trap composed of 338 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:41:29] [INFO ] Deduced a trap composed of 307 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:41:29] [INFO ] Deduced a trap composed of 324 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:41:29] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-06-01 13:41:29] [INFO ] Deduced a trap composed of 307 places in 220 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:41:30] [INFO ] Deduced a trap composed of 283 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:41:31] [INFO ] Deduced a trap composed of 353 places in 286 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:41:47] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 40977ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 40986ms
[2024-06-01 13:41:56] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:41:56] [INFO ] Invariant cache hit.
[2024-06-01 13:41:57] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 13:41:57] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:41:57] [INFO ] Invariant cache hit.
[2024-06-01 13:41:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:42:04] [INFO ] Implicit Places using invariants and state equation in 7574 ms returned []
Implicit Place search using SMT with State Equation took 8077 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:42:04] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:42:04] [INFO ] Invariant cache hit.
[2024-06-01 13:42:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:42:13] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:42:14] [INFO ] Deduced a trap composed of 334 places in 328 ms of which 5 ms to minimize.
[2024-06-01 13:42:14] [INFO ] Deduced a trap composed of 339 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:42:15] [INFO ] Deduced a trap composed of 183 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:42:15] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:42:15] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 314 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 334 places in 307 ms of which 3 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 351 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 338 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:42:17] [INFO ] Deduced a trap composed of 307 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 324 places in 244 ms of which 5 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:42:18] [INFO ] Deduced a trap composed of 307 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:42:19] [INFO ] Deduced a trap composed of 283 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:42:20] [INFO ] Deduced a trap composed of 353 places in 252 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 299 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 397 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 408 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61116ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61132ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110217 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-10 finished in 110332 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 16 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 604 transition count 1066
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 556 transition count 1066
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 96 place count 556 transition count 1002
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 224 place count 492 transition count 1002
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 352 place count 428 transition count 938
Applied a total of 352 rules in 42 ms. Remains 428 /606 variables (removed 178) and now considering 938/1114 (removed 176) transitions.
Running 936 sub problems to find dead transitions.
[2024-06-01 13:43:06] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 428 cols
[2024-06-01 13:43:06] [INFO ] Computed 40 invariants in 11 ms
[2024-06-01 13:43:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 237 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:43:13] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 201 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 207 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 177 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 258 places in 223 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 9.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 1.0 2.0))
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 (/ 1.0 2.0))
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 55 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 13:43:30] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1350 variables, and 56 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 18/18 constraints]
After SMT, in 41050ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 41059ms
[2024-06-01 13:43:47] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:47] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 13:43:47] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:43:51] [INFO ] Implicit Places using invariants and state equation in 3780 ms returned []
Implicit Place search using SMT with State Equation took 4063 ms to find 0 implicit places.
[2024-06-01 13:43:51] [INFO ] Redundant transitions in 7 ms returned []
Running 936 sub problems to find dead transitions.
[2024-06-01 13:43:51] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-06-01 13:43:51] [INFO ] Invariant cache hit.
[2024-06-01 13:43:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 2 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:43:59] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:44:05] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:44:06] [INFO ] Deduced a trap composed of 214 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 13:44:08] [INFO ] Deduced a trap composed of 270 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 9.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 51 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:44:24] [INFO ] Deduced a trap composed of 173 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:44:35] [INFO ] Deduced a trap composed of 91 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 60992ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 61002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 428/606 places, 938/1114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106181 ms. Remains : 428/606 places, 938/1114 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-11
Stuttering criterion allowed to conclude after 15364 steps with 0 reset in 53 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-11 finished in 106298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(F(p1))))))))'
Support contains 64 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 40 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:44:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 13:44:52] [INFO ] Computed 40 invariants in 19 ms
[2024-06-01 13:44:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:45:01] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 13 ms to minimize.
[2024-06-01 13:45:02] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:45:02] [INFO ] Deduced a trap composed of 325 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:45:02] [INFO ] Deduced a trap composed of 165 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:45:03] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:45:03] [INFO ] Deduced a trap composed of 346 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:45:04] [INFO ] Deduced a trap composed of 308 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:45:04] [INFO ] Deduced a trap composed of 307 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:45:04] [INFO ] Deduced a trap composed of 313 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:45:04] [INFO ] Deduced a trap composed of 299 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:45:13] [INFO ] Deduced a trap composed of 312 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 54 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:45:15] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:45:16] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:45:21] [INFO ] Deduced a trap composed of 376 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:45:26] [INFO ] Deduced a trap composed of 313 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:45:31] [INFO ] Deduced a trap composed of 355 places in 295 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:45:32] [INFO ] Deduced a trap composed of 404 places in 295 ms of which 5 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 345 places in 270 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41517ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41536ms
[2024-06-01 13:45:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:45:34] [INFO ] Invariant cache hit.
[2024-06-01 13:45:34] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 13:45:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:45:34] [INFO ] Invariant cache hit.
[2024-06-01 13:45:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:45:42] [INFO ] Implicit Places using invariants and state equation in 8505 ms returned []
Implicit Place search using SMT with State Equation took 8789 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:45:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:45:42] [INFO ] Invariant cache hit.
[2024-06-01 13:45:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:45:54] [INFO ] Deduced a trap composed of 334 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:45:54] [INFO ] Deduced a trap composed of 339 places in 307 ms of which 5 ms to minimize.
[2024-06-01 13:45:54] [INFO ] Deduced a trap composed of 183 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 314 places in 350 ms of which 5 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 334 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 351 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 338 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 307 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 324 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 307 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 283 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 353 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:46:26] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:46:37] [INFO ] Deduced a trap composed of 299 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:46:37] [INFO ] Deduced a trap composed of 397 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:46:37] [INFO ] Deduced a trap composed of 408 places in 300 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61087ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111472 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-12
Product exploration explored 100000 steps with 1406 reset in 484 ms.
Product exploration explored 100000 steps with 1411 reset in 476 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 p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 266 steps (0 resets) in 12 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-06-01 13:46:46] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:46:46] [INFO ] Invariant cache hit.
[2024-06-01 13:46:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:46:46] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 59 ms returned sat
[2024-06-01 13:46:48] [INFO ] [Real]Absence check using state equation in 1416 ms returned sat
[2024-06-01 13:46:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:46:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:46:48] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 92 ms returned sat
[2024-06-01 13:46:51] [INFO ] [Nat]Absence check using state equation in 2799 ms returned sat
[2024-06-01 13:46:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:46:52] [INFO ] [Nat]Added 96 Read/Feed constraints in 663 ms returned sat
[2024-06-01 13:46:52] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:46:53] [INFO ] Deduced a trap composed of 64 places in 399 ms of which 2 ms to minimize.
[2024-06-01 13:46:54] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:46:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1913 ms
[2024-06-01 13:46:54] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 103 ms.
[2024-06-01 13:47:03] [INFO ] Added : 360 causal constraints over 72 iterations in 8988 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 64 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 11 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:47:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:47:03] [INFO ] Invariant cache hit.
[2024-06-01 13:47:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:47:14] [INFO ] Deduced a trap composed of 334 places in 339 ms of which 3 ms to minimize.
[2024-06-01 13:47:14] [INFO ] Deduced a trap composed of 339 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:47:14] [INFO ] Deduced a trap composed of 183 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:47:15] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:47:15] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:47:16] [INFO ] Deduced a trap composed of 314 places in 517 ms of which 5 ms to minimize.
[2024-06-01 13:47:16] [INFO ] Deduced a trap composed of 334 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:47:17] [INFO ] Deduced a trap composed of 351 places in 298 ms of which 3 ms to minimize.
[2024-06-01 13:47:17] [INFO ] Deduced a trap composed of 338 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:47:17] [INFO ] Deduced a trap composed of 307 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 324 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:47:18] [INFO ] Deduced a trap composed of 307 places in 294 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 283 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 353 places in 253 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41420ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41435ms
[2024-06-01 13:47:44] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:47:44] [INFO ] Invariant cache hit.
[2024-06-01 13:47:45] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 13:47:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:47:45] [INFO ] Invariant cache hit.
[2024-06-01 13:47:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:47:53] [INFO ] Implicit Places using invariants and state equation in 8895 ms returned []
Implicit Place search using SMT with State Equation took 9172 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:47:53] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:47:53] [INFO ] Invariant cache hit.
[2024-06-01 13:47:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 334 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 339 places in 316 ms of which 5 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 183 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:48:06] [INFO ] Deduced a trap composed of 314 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:48:06] [INFO ] Deduced a trap composed of 334 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:48:06] [INFO ] Deduced a trap composed of 351 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 338 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 307 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 324 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:48:08] [INFO ] Deduced a trap composed of 307 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 283 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:48:09] [INFO ] Deduced a trap composed of 353 places in 243 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:48:36] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:48:47] [INFO ] Deduced a trap composed of 299 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:48:47] [INFO ] Deduced a trap composed of 397 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:48:47] [INFO ] Deduced a trap composed of 408 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61396ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61409ms
Finished structural reductions in LTL mode , in 1 iterations and 112033 ms. Remains : 588/588 places, 1098/1098 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 p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 301 steps (0 resets) in 7 ms. (37 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-06-01 13:48:56] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:48:56] [INFO ] Invariant cache hit.
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 79 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2024-06-01 13:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:59] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 65 ms returned sat
[2024-06-01 13:49:02] [INFO ] [Nat]Absence check using state equation in 3261 ms returned sat
[2024-06-01 13:49:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:49:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 590 ms returned sat
[2024-06-01 13:49:03] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 5 ms to minimize.
[2024-06-01 13:49:04] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:49:04] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:49:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1883 ms
[2024-06-01 13:49:05] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 86 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 13:49:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1404 reset in 424 ms.
Product exploration explored 100000 steps with 1414 reset in 474 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 64 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 588 transition count 1098
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 48 place count 588 transition count 1130
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 80 place count 588 transition count 1130
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 96 place count 572 transition count 1114
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 112 place count 572 transition count 1114
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 176 place count 572 transition count 1114
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 208 place count 540 transition count 1082
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 240 place count 540 transition count 1082
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 240 rules in 109 ms. Remains 540 /588 variables (removed 48) and now considering 1082/1098 (removed 16) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:49:15] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 540 cols
[2024-06-01 13:49:15] [INFO ] Computed 40 invariants in 26 ms
[2024-06-01 13:49:15] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 1 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:49:25] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 13:49:26] [INFO ] Deduced a trap composed of 181 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:49:26] [INFO ] Deduced a trap composed of 201 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:49:26] [INFO ] Deduced a trap composed of 195 places in 268 ms of which 4 ms to minimize.
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 200 places in 224 ms of which 4 ms to minimize.
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 13/51 constraints. Problems are: Problem set: 120 solved, 960 unsolved
[2024-06-01 13:49:36] [INFO ] Deduced a trap composed of 187 places in 289 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1606 variables, and 52 constraints, problems are : Problem set: 120 solved, 960 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/540 constraints, ReadFeed: 0/128 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 120 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 9/9 constraints. Problems are: Problem set: 120 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 22/31 constraints. Problems are: Problem set: 120 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 14/45 constraints. Problems are: Problem set: 120 solved, 960 unsolved
[2024-06-01 13:49:39] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:49:41] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 188 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:49:45] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 8/53 constraints. Problems are: Problem set: 120 solved, 960 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/53 constraints. Problems are: Problem set: 120 solved, 960 unsolved
At refinement iteration 5 (OVERLAPS) 24/474 variables, 3/56 constraints. Problems are: Problem set: 120 solved, 960 unsolved
[2024-06-01 13:49:54] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/1606 variables, and 57 constraints, problems are : Problem set: 120 solved, 960 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 22/28 constraints, State Equation: 0/540 constraints, ReadFeed: 0/128 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 23/23 constraints]
After SMT, in 41478ms problems are : Problem set: 120 solved, 960 unsolved
Search for dead transitions found 120 dead transitions in 41492ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 120 transitions.
[2024-06-01 13:49:57] [INFO ] Redundant transitions in 6 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 540/588 places, 962/1098 transitions.
Graph (complete) has 2600 edges and 540 vertex of which 452 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.4 ms
Discarding 88 places :
Also discarding 0 output transitions
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 452 /540 variables (removed 88) and now considering 962/962 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 452/588 places, 962/1098 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41646 ms. Remains : 452/588 places, 962/1098 transitions.
Support contains 64 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 13 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:49:57] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 13:49:57] [INFO ] Computed 40 invariants in 22 ms
[2024-06-01 13:49:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:50:08] [INFO ] Deduced a trap composed of 325 places in 298 ms of which 5 ms to minimize.
[2024-06-01 13:50:08] [INFO ] Deduced a trap composed of 165 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:50:08] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:50:10] [INFO ] Deduced a trap composed of 346 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:50:10] [INFO ] Deduced a trap composed of 308 places in 307 ms of which 5 ms to minimize.
[2024-06-01 13:50:10] [INFO ] Deduced a trap composed of 307 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:50:11] [INFO ] Deduced a trap composed of 313 places in 288 ms of which 5 ms to minimize.
[2024-06-01 13:50:11] [INFO ] Deduced a trap composed of 299 places in 302 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:50:20] [INFO ] Deduced a trap composed of 353 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-06-01 13:50:26] [INFO ] Deduced a trap composed of 324 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:50:27] [INFO ] Deduced a trap composed of 311 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 313 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:50:33] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41599ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41613ms
[2024-06-01 13:50:38] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:50:38] [INFO ] Invariant cache hit.
[2024-06-01 13:50:39] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-01 13:50:39] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:50:39] [INFO ] Invariant cache hit.
[2024-06-01 13:50:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:50:47] [INFO ] Implicit Places using invariants and state equation in 8854 ms returned []
Implicit Place search using SMT with State Equation took 9130 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:50:48] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:50:48] [INFO ] Invariant cache hit.
[2024-06-01 13:50:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:50:57] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 334 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 339 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 183 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:50:58] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 314 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 334 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 351 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 338 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:51:00] [INFO ] Deduced a trap composed of 307 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 324 places in 296 ms of which 5 ms to minimize.
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 5 ms to minimize.
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 307 places in 279 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:51:02] [INFO ] Deduced a trap composed of 283 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:51:03] [INFO ] Deduced a trap composed of 353 places in 257 ms of which 5 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 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 299 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 397 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 408 places in 300 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61386ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61401ms
Finished structural reductions in LTL mode , in 1 iterations and 112163 ms. Remains : 588/588 places, 1098/1098 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-12 finished in 417052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 35 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 604 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 596 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 588 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 588 transition count 1098
Applied a total of 34 rules in 39 ms. Remains 588 /606 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:51:49] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:51:49] [INFO ] Invariant cache hit.
[2024-06-01 13:51:49] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:51:59] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:51:59] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:51:59] [INFO ] Deduced a trap composed of 334 places in 306 ms of which 5 ms to minimize.
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 339 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 183 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:52:01] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:52:01] [INFO ] Deduced a trap composed of 314 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 334 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 351 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:52:02] [INFO ] Deduced a trap composed of 338 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 307 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 324 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 307 places in 286 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:52:05] [INFO ] Deduced a trap composed of 283 places in 280 ms of which 5 ms to minimize.
[2024-06-01 13:52:05] [INFO ] Deduced a trap composed of 353 places in 244 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:52:23] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 41356ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41370ms
[2024-06-01 13:52:30] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:52:30] [INFO ] Invariant cache hit.
[2024-06-01 13:52:31] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 13:52:31] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:52:31] [INFO ] Invariant cache hit.
[2024-06-01 13:52:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:52:41] [INFO ] Implicit Places using invariants and state equation in 10514 ms returned []
Implicit Place search using SMT with State Equation took 10841 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:52:41] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:52:41] [INFO ] Invariant cache hit.
[2024-06-01 13:52:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:52:51] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:52:52] [INFO ] Deduced a trap composed of 334 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:52:53] [INFO ] Deduced a trap composed of 339 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:52:53] [INFO ] Deduced a trap composed of 183 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:52:53] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:52:54] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:52:54] [INFO ] Deduced a trap composed of 314 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:52:55] [INFO ] Deduced a trap composed of 334 places in 292 ms of which 9 ms to minimize.
[2024-06-01 13:52:55] [INFO ] Deduced a trap composed of 351 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:52:55] [INFO ] Deduced a trap composed of 338 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:52:55] [INFO ] Deduced a trap composed of 307 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 324 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:52:56] [INFO ] Deduced a trap composed of 307 places in 308 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:52:57] [INFO ] Deduced a trap composed of 283 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 353 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:53:24] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 299 places in 289 ms of which 14 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 397 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:53:36] [INFO ] Deduced a trap composed of 408 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61528ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61537ms
Starting structural reductions in LTL mode, iteration 1 : 588/606 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113795 ms. Remains : 588/606 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 437 ms.
Product exploration explored 100000 steps with 33333 reset in 408 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-13 finished in 114827 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)))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T08-LTLCardinality-02
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 24 out of 606 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 604 transition count 1058
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 540 transition count 1050
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 128 place count 540 transition count 1002
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 224 place count 492 transition count 1002
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 232 place count 484 transition count 994
Iterating global reduction 3 with 8 rules applied. Total rules applied 240 place count 484 transition count 994
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 368 place count 420 transition count 930
Applied a total of 368 rules in 48 ms. Remains 420 /606 variables (removed 186) and now considering 930/1114 (removed 184) transitions.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:53:44] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-06-01 13:53:44] [INFO ] Computed 40 invariants in 11 ms
[2024-06-01 13:53:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 200 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:53:52] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:53:53] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:53:59] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 191 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 254 places in 207 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 54 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 1 ms to minimize.
[2024-06-01 13:54:10] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:54:12] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:54:14] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 928 unsolved
SMT process timed out in 41425ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41436ms
[2024-06-01 13:54:26] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:54:26] [INFO ] Invariant cache hit.
[2024-06-01 13:54:26] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-06-01 13:54:26] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:54:26] [INFO ] Invariant cache hit.
[2024-06-01 13:54:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:54:30] [INFO ] Implicit Places using invariants and state equation in 3666 ms returned []
Implicit Place search using SMT with State Equation took 4121 ms to find 0 implicit places.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:54:30] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:54:30] [INFO ] Invariant cache hit.
[2024-06-01 13:54:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 184 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:54:38] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:54:39] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:54:40] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 254 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:54:45] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:54:55] [INFO ] Deduced a trap composed of 172 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 55 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:55:03] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 158 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:55:31] [INFO ] Deduced a trap composed of 184 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 61616ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 61632ms
Starting structural reductions in LI_LTL mode, iteration 1 : 420/606 places, 930/1114 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 107244 ms. Remains : 420/606 places, 930/1114 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 7559 reset in 310 ms.
Product exploration explored 100000 steps with 7532 reset in 263 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:55:32] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:55:32] [INFO ] Invariant cache hit.
[2024-06-01 13:55:33] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-06-01 13:55:33] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 90 ms returned sat
[2024-06-01 13:55:35] [INFO ] [Real]Absence check using state equation in 1679 ms returned sat
[2024-06-01 13:55:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 13:55:35] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 40 ms returned sat
[2024-06-01 13:55:36] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2024-06-01 13:55:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:55:38] [INFO ] [Nat]Added 96 Read/Feed constraints in 1089 ms returned sat
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2046 ms
Could not prove EG (NOT p0)
Support contains 24 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 930/930 transitions.
Applied a total of 0 rules in 31 ms. Remains 420 /420 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:55:40] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:55:40] [INFO ] Invariant cache hit.
[2024-06-01 13:55:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 177 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 207 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 184 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:55:49] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:55:49] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 254 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:55:55] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 54 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:56:03] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 172 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:56:10] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 928 unsolved
SMT process timed out in 41681ms, After SMT, problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41700ms
[2024-06-01 13:56:21] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:56:21] [INFO ] Invariant cache hit.
[2024-06-01 13:56:22] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-01 13:56:22] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:56:22] [INFO ] Invariant cache hit.
[2024-06-01 13:56:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:56:26] [INFO ] Implicit Places using invariants and state equation in 3885 ms returned []
Implicit Place search using SMT with State Equation took 4296 ms to find 0 implicit places.
[2024-06-01 13:56:26] [INFO ] Redundant transitions in 11 ms returned []
Running 928 sub problems to find dead transitions.
[2024-06-01 13:56:26] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:56:26] [INFO ] Invariant cache hit.
[2024-06-01 13:56:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 207 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:56:34] [INFO ] Deduced a trap composed of 184 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:56:34] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:56:34] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:56:34] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:56:36] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:56:36] [INFO ] Deduced a trap composed of 254 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:56:41] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 172 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 928 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 418/1334 variables, and 55 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:56:59] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 248 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:57:08] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:57:26] [INFO ] Deduced a trap composed of 184 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 60 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 22/22 constraints]
After SMT, in 61266ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 61280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107334 ms. Remains : 420/420 places, 930/930 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:57:27] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:57:27] [INFO ] Invariant cache hit.
[2024-06-01 13:57:28] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 13:57:28] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 84 ms returned sat
[2024-06-01 13:57:30] [INFO ] [Real]Absence check using state equation in 1632 ms returned sat
[2024-06-01 13:57:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:57:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 13:57:30] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 28 ms returned sat
[2024-06-01 13:57:31] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2024-06-01 13:57:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:57:32] [INFO ] [Nat]Added 96 Read/Feed constraints in 1079 ms returned sat
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 190 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2035 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7556 reset in 351 ms.
Product exploration explored 100000 steps with 7569 reset in 314 ms.
Support contains 24 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 930/930 transitions.
Applied a total of 0 rules in 13 ms. Remains 420 /420 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Running 928 sub problems to find dead transitions.
[2024-06-01 13:57:35] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:57:35] [INFO ] Invariant cache hit.
[2024-06-01 13:57:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 177 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:57:43] [INFO ] Deduced a trap composed of 207 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:57:44] [INFO ] Deduced a trap composed of 184 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:57:44] [INFO ] Deduced a trap composed of 171 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:57:44] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:57:45] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:57:46] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:57:47] [INFO ] Deduced a trap composed of 254 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:57:51] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 54 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:57:58] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:58:00] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:58:06] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41287ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41298ms
[2024-06-01 13:58:16] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:58:16] [INFO ] Invariant cache hit.
[2024-06-01 13:58:17] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 13:58:17] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:58:17] [INFO ] Invariant cache hit.
[2024-06-01 13:58:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:58:21] [INFO ] Implicit Places using invariants and state equation in 4039 ms returned []
Implicit Place search using SMT with State Equation took 4329 ms to find 0 implicit places.
[2024-06-01 13:58:21] [INFO ] Redundant transitions in 13 ms returned []
Running 928 sub problems to find dead transitions.
[2024-06-01 13:58:21] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-06-01 13:58:21] [INFO ] Invariant cache hit.
[2024-06-01 13:58:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:58:28] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:58:29] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:58:29] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:58:29] [INFO ] Deduced a trap composed of 207 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:58:29] [INFO ] Deduced a trap composed of 184 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:58:30] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:58:30] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:58:30] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2024-06-01 13:58:31] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:58:32] [INFO ] Deduced a trap composed of 254 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:58:37] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:58:49] [INFO ] Deduced a trap composed of 172 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 55 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:58:54] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 248 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:59:03] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:59:04] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-06-01 13:59:20] [INFO ] Deduced a trap composed of 184 places in 233 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 60 constraints, problems are : Problem set: 0 solved, 928 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 22/22 constraints]
After SMT, in 61527ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 61544ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107213 ms. Remains : 420/420 places, 930/930 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-02 finished in 338377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(F(p1))))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T08-LTLCardinality-12
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 64 out of 606 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 606/606 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 604 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 532 transition count 1042
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 144 place count 532 transition count 1018
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 192 place count 508 transition count 1018
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 200 place count 500 transition count 1010
Iterating global reduction 2 with 8 rules applied. Total rules applied 208 place count 500 transition count 1010
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 336 place count 436 transition count 946
Applied a total of 336 rules in 54 ms. Remains 436 /606 variables (removed 170) and now considering 946/1114 (removed 168) transitions.
Running 944 sub problems to find dead transitions.
[2024-06-01 13:59:23] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
// Phase 1: matrix 930 rows 436 cols
[2024-06-01 13:59:23] [INFO ] Computed 40 invariants in 12 ms
[2024-06-01 13:59:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:59:30] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 215 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:59:31] [INFO ] Deduced a trap composed of 213 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 287 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 230 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 195 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 180 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 164 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:59:34] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:59:40] [INFO ] Deduced a trap composed of 182 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:59:41] [INFO ] Deduced a trap composed of 181 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:59:41] [INFO ] Deduced a trap composed of 205 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 944 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 434/1366 variables, and 58 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 275 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 279 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 186 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:59:57] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 62 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 24/24 constraints]
After SMT, in 41401ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 41411ms
[2024-06-01 14:00:04] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:00:04] [INFO ] Invariant cache hit.
[2024-06-01 14:00:04] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 14:00:04] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:00:04] [INFO ] Invariant cache hit.
[2024-06-01 14:00:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:00:08] [INFO ] Implicit Places using invariants and state equation in 3957 ms returned []
Implicit Place search using SMT with State Equation took 4276 ms to find 0 implicit places.
Running 944 sub problems to find dead transitions.
[2024-06-01 14:00:08] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:00:08] [INFO ] Invariant cache hit.
[2024-06-01 14:00:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 3 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:00:16] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 235 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 217 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 207 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 216 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:00:17] [INFO ] Deduced a trap composed of 227 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 203 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 288 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:00:18] [INFO ] Deduced a trap composed of 265 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 171 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 56 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:00:53] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 195 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 182 places in 213 ms of which 4 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 168 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:00:58] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:00:58] [INFO ] Deduced a trap composed of 87 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 64 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 26/26 constraints]
After SMT, in 61412ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 61429ms
Starting structural reductions in LI_LTL mode, iteration 1 : 436/606 places, 946/1114 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 107178 ms. Remains : 436/606 places, 946/1114 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-12
Product exploration explored 100000 steps with 2071 reset in 319 ms.
Product exploration explored 100000 steps with 2099 reset in 497 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 p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 183 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-06-01 14:01:12] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:01:12] [INFO ] Invariant cache hit.
[2024-06-01 14:01:12] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2024-06-01 14:01:13] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 117 ms returned sat
[2024-06-01 14:01:14] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2024-06-01 14:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:01:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 43 ms returned sat
[2024-06-01 14:01:14] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 78 ms returned sat
[2024-06-01 14:01:16] [INFO ] [Nat]Absence check using state equation in 1825 ms returned sat
[2024-06-01 14:01:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:01:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 898 ms returned sat
[2024-06-01 14:01:17] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:01:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1619 ms
[2024-06-01 14:01:19] [INFO ] Computed and/alt/rep : 480/2069/472 causal constraints (skipped 456 transitions) in 81 ms.
[2024-06-01 14:01:21] [INFO ] Added : 125 causal constraints over 25 iterations in 2092 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 64 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 946/946 transitions.
Applied a total of 0 rules in 4 ms. Remains 436 /436 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running 944 sub problems to find dead transitions.
[2024-06-01 14:01:21] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:01:21] [INFO ] Invariant cache hit.
[2024-06-01 14:01:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 235 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 217 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 207 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 216 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 227 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 203 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 288 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 265 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:01:36] [INFO ] Deduced a trap composed of 171 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 timeout
0.0)
(s128 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 55 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:01:46] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:01:48] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:01:50] [INFO ] Deduced a trap composed of 278 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 195 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:01:59] [INFO ] Deduced a trap composed of 197 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:01:59] [INFO ] Deduced a trap composed of 182 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:02:00] [INFO ] Deduced a trap composed of 205 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 65 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 27/27 constraints]
After SMT, in 41385ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 41395ms
[2024-06-01 14:02:02] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:02:02] [INFO ] Invariant cache hit.
[2024-06-01 14:02:02] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 14:02:02] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:02:02] [INFO ] Invariant cache hit.
[2024-06-01 14:02:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:02:06] [INFO ] Implicit Places using invariants and state equation in 3490 ms returned []
Implicit Place search using SMT with State Equation took 3821 ms to find 0 implicit places.
Running 944 sub problems to find dead transitions.
[2024-06-01 14:02:06] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:02:06] [INFO ] Invariant cache hit.
[2024-06-01 14:02:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:02:14] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:02:14] [INFO ] Deduced a trap composed of 235 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:02:14] [INFO ] Deduced a trap composed of 217 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:02:14] [INFO ] Deduced a trap composed of 207 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:02:15] [INFO ] Deduced a trap composed of 216 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:02:15] [INFO ] Deduced a trap composed of 227 places in 250 ms of which 5 ms to minimize.
[2024-06-01 14:02:15] [INFO ] Deduced a trap composed of 203 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:02:15] [INFO ] Deduced a trap composed of 288 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 265 places in 209 ms of which 4 ms to minimize.
[2024-06-01 14:02:22] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:02:29] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 56 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:02:49] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:02:50] [INFO ] Deduced a trap composed of 195 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:02:50] [INFO ] Deduced a trap composed of 182 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:02:50] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:02:51] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:03:00] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:03:00] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(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 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 9)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 4)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 7)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 1)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 timeout
0)
(s423 0)
(s424 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 64 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 26/26 constraints]
After SMT, in 61308ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 61316ms
Finished structural reductions in LTL mode , in 1 iterations and 106541 ms. Remains : 436/436 places, 946/946 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 p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 180 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-06-01 14:03:08] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:03:08] [INFO ] Invariant cache hit.
[2024-06-01 14:03:09] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2024-06-01 14:03:09] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 115 ms returned sat
[2024-06-01 14:03:10] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2024-06-01 14:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:03:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 31 ms returned sat
[2024-06-01 14:03:10] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 59 ms returned sat
[2024-06-01 14:03:12] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2024-06-01 14:03:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:03:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 1046 ms returned sat
[2024-06-01 14:03:13] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:03:14] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:03:14] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:03:15] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:03:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1503 ms
[2024-06-01 14:03:15] [INFO ] Computed and/alt/rep : 480/2069/472 causal constraints (skipped 456 transitions) in 62 ms.
[2024-06-01 14:03:17] [INFO ] Added : 125 causal constraints over 25 iterations in 2381 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 2098 reset in 457 ms.
Product exploration explored 100000 steps with 2101 reset in 493 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 64 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 946/946 transitions.
Applied a total of 0 rules in 12 ms. Remains 436 /436 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running 944 sub problems to find dead transitions.
[2024-06-01 14:03:19] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:03:19] [INFO ] Invariant cache hit.
[2024-06-01 14:03:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:03:26] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:03:26] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:03:26] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 235 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 217 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:03:27] [INFO ] Deduced a trap composed of 207 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 216 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 227 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 203 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 288 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:03:28] [INFO ] Deduced a trap composed of 265 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:03:36] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 55 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:03:44] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:03:46] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:03:48] [INFO ] Deduced a trap composed of 278 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:03:55] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:03:55] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:03:56] [INFO ] Deduced a trap composed of 195 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:03:56] [INFO ] Deduced a trap composed of 197 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:03:56] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 205 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 65 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 27/27 constraints]
After SMT, in 41284ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 41296ms
[2024-06-01 14:04:00] [INFO ] Redundant transitions in 5 ms returned []
Running 944 sub problems to find dead transitions.
[2024-06-01 14:04:00] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:04:00] [INFO ] Invariant cache hit.
[2024-06-01 14:04:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:04:07] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:04:08] [INFO ] Deduced a trap composed of 235 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:04:08] [INFO ] Deduced a trap composed of 217 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:04:08] [INFO ] Deduced a trap composed of 207 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:04:08] [INFO ] Deduced a trap composed of 216 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 203 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 288 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:04:09] [INFO ] Deduced a trap composed of 265 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:04:16] [INFO ] Deduced a trap composed of 171 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:04:24] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 56 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:04:44] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 3 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 195 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:04:46] [INFO ] Deduced a trap composed of 182 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:04:46] [INFO ] Deduced a trap composed of 168 places in 239 ms of which 4 ms to minimize.
[2024-06-01 14:04:48] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:04:48] [INFO ] Deduced a trap composed of 87 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:04:56] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:04:57] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 64 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 26/26 constraints]
After SMT, in 61171ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102514 ms. Remains : 436/436 places, 946/946 transitions.
Support contains 64 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 946/946 transitions.
Applied a total of 0 rules in 5 ms. Remains 436 /436 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running 944 sub problems to find dead transitions.
[2024-06-01 14:05:01] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:05:01] [INFO ] Invariant cache hit.
[2024-06-01 14:05:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 235 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 217 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 207 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:05:10] [INFO ] Deduced a trap composed of 216 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 227 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 203 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 288 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:05:11] [INFO ] Deduced a trap composed of 265 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:05:18] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 55 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:05:27] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:05:30] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:05:31] [INFO ] Deduced a trap composed of 278 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:05:38] [INFO ] Deduced a trap composed of 228 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:05:38] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 195 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:05:39] [INFO ] Deduced a trap composed of 182 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:05:41] [INFO ] Deduced a trap composed of 205 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 65 constraints, problems are : Problem set: 0 solved, 944 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 27/27 constraints]
After SMT, in 41289ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 41301ms
[2024-06-01 14:05:42] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:05:42] [INFO ] Invariant cache hit.
[2024-06-01 14:05:43] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 14:05:43] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:05:43] [INFO ] Invariant cache hit.
[2024-06-01 14:05:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:05:47] [INFO ] Implicit Places using invariants and state equation in 4188 ms returned []
Implicit Place search using SMT with State Equation took 4496 ms to find 0 implicit places.
Running 944 sub problems to find dead transitions.
[2024-06-01 14:05:47] [INFO ] Flow matrix only has 930 transitions (discarded 16 similar events)
[2024-06-01 14:05:47] [INFO ] Invariant cache hit.
[2024-06-01 14:05:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:05:54] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 235 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 217 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 207 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 216 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:05:56] [INFO ] Deduced a trap composed of 227 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:05:56] [INFO ] Deduced a trap composed of 203 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:05:56] [INFO ] Deduced a trap composed of 288 places in 221 ms of which 2 ms to minimize.
[2024-06-01 14:05:56] [INFO ] Deduced a trap composed of 265 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:06:03] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:06:11] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1366 variables, and 56 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:06:32] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:06:33] [INFO ] Deduced a trap composed of 195 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:06:33] [INFO ] Deduced a trap composed of 182 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:06:34] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:06:35] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:06:35] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-06-01 14:06:43] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:06:43] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1366 variables, and 64 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 26/26 constraints]
After SMT, in 61363ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 61380ms
Finished structural reductions in LTL mode , in 1 iterations and 107187 ms. Remains : 436/436 places, 946/946 transitions.
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-12 finished in 446211 ms.
[2024-06-01 14:06:49] [INFO ] Flatten gal took : 80 ms
[2024-06-01 14:06:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 14:06:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 606 places, 1114 transitions and 4820 arcs took 14 ms.
Total runtime 2571314 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-COL-S02J04T08-LTLCardinality-12

BK_STOP 1717250952792

--------------------
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
ltl formula name PolyORBLF-COL-S02J04T08-LTLCardinality-02
ltl formula formula --ltl=/tmp/5596/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 1114 transitions and 4820 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.060 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5596/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5596/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5596/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5596/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 621 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 607, there are 1116 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~19 levels ~10000 states ~15200 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9833
pnml2lts-mc( 0/ 4): unique states count: 9833
pnml2lts-mc( 0/ 4): unique transitions count: 15154
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5503
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10103
pnml2lts-mc( 0/ 4): - cum. max stack depth: 76
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10103 states 16005 transitions, fanout: 1.584
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 31572, Transitions per second: 50016
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.8 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1144 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J04T08-LTLCardinality-12
ltl formula formula --ltl=/tmp/5596/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 1114 transitions and 4820 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5596/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5596/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5596/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5596/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 621 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 607, there are 1124 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2378 levels ~10000 states ~17372 transitions
pnml2lts-mc( 0/ 4): ~4793 levels ~20000 states ~35348 transitions
pnml2lts-mc( 0/ 4): ~9023 levels ~40000 states ~69028 transitions
pnml2lts-mc( 3/ 4): ~15876 levels ~80000 states ~134268 transitions
pnml2lts-mc( 3/ 4): ~31148 levels ~160000 states ~274824 transitions
pnml2lts-mc( 0/ 4): ~66213 levels ~320000 states ~594728 transitions
pnml2lts-mc( 3/ 4): ~100656 levels ~640000 states ~1059336 transitions
pnml2lts-mc( 3/ 4): ~191615 levels ~1280000 states ~2157684 transitions
pnml2lts-mc( 3/ 4): ~357188 levels ~2560000 states ~4335076 transitions
pnml2lts-mc( 3/ 4): ~661062 levels ~5120000 states ~8785580 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 120927
pnml2lts-mc( 0/ 4): unique states count: 7400401
pnml2lts-mc( 0/ 4): unique transitions count: 14244003
pnml2lts-mc( 0/ 4): - self-loop count: 936
pnml2lts-mc( 0/ 4): - claim dead count: 86692
pnml2lts-mc( 0/ 4): - claim found count: 2820524
pnml2lts-mc( 0/ 4): - claim success count: 7400425
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4600939
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7400427 states 14244072 transitions, fanout: 1.925
pnml2lts-mc( 0/ 4): Total exploration time 141.830 sec (141.820 sec minimum, 141.828 sec on average)
pnml2lts-mc( 0/ 4): States per second: 52178, Transitions per second: 100431
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 145.7MB, 14.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 31.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1144 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 145.7MB (~256.0MB paged-in)

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="PolyORBLF-COL-S02J04T08"
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 PolyORBLF-COL-S02J04T08, 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 r516-tajo-171654446300083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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