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.r289-tajo-171654445900412.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 greatspnxred
Input is PolyORBNT-COL-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716881319902

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:28:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 07:28:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:28:41] [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-05-28 07:28:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:28:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 915 ms
[2024-05-28 07:28:42] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 07:28:42] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 07:28:42] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40011 steps (2281 resets) in 1071 ms. (37 steps per ms) remains 8/17 properties
BEST_FIRST walk for 40005 steps (493 resets) in 311 ms. (128 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (851 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (593 resets) in 216 ms. (184 steps per ms) remains 1/3 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:28:43] [INFO ] Computed 13 invariants in 10 ms
[2024-05-28 07:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 40/86 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 07:28:43] [INFO ] Flatten gal took : 57 ms
[2024-05-28 07:28:43] [INFO ] Flatten gal took : 5 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:28:44] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 389 ms.
[2024-05-28 07:28:44] [INFO ] Unfolded 11 HLPN properties in 1 ms.
[2024-05-28 07:28:44] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 07:28:44] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:28:44] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:28:44] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:28:44] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 07:28:44] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 26 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 449 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 1939
Applied a total of 2 rules in 100 ms. Remains 663 /664 variables (removed 1) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 07:28:44] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 663 cols
[2024-05-28 07:28:44] [INFO ] Computed 92 invariants in 118 ms
[2024-05-28 07:28:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2593 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
[2024-05-28 07:29:28] [INFO ] Deduced a trap composed of 19 places in 517 ms of which 26 ms to minimize.
[2024-05-28 07:29:29] [INFO ] Deduced a trap composed of 12 places in 843 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2593 variables, and 73 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 2/2 constraints]
After SMT, in 58803ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 58867ms
[2024-05-28 07:29:43] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 07:29:43] [INFO ] Invariant cache hit.
[2024-05-28 07:29:43] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-28 07:29:43] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 07:29:43] [INFO ] Invariant cache hit.
[2024-05-28 07:29:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:29:46] [INFO ] Implicit Places using invariants and state equation in 2522 ms returned []
Implicit Place search using SMT with State Equation took 2822 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 07:29:46] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 07:29:46] [INFO ] Invariant cache hit.
[2024-05-28 07:29:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2593 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
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 TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 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
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD582 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 TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD601 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 TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD627 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 TDEAD643 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/661 variables, 19/90 constraints. Problems are: Problem set: 558 solved, 1370 unsolved
[2024-05-28 07:31:08] [INFO ] Deduced a trap composed of 113 places in 390 ms of which 5 ms to minimize.
SMT process timed out in 81806ms, After SMT, problems are : Problem set: 558 solved, 1370 unsolved
Search for dead transitions found 558 dead transitions in 81851ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in LTL mode, iteration 1 : 663/664 places, 1381/1940 transitions.
Applied a total of 0 rules in 11 ms. Remains 663 /663 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143705 ms. Remains : 663/664 places, 1381/1940 transitions.
Support contains 449 out of 663 places after structural reductions.
[2024-05-28 07:31:08] [INFO ] Flatten gal took : 378 ms
[2024-05-28 07:31:09] [INFO ] Flatten gal took : 299 ms
[2024-05-28 07:31:09] [INFO ] Input system was already deterministic with 1381 transitions.
RANDOM walk for 40000 steps (2241 resets) in 5507 ms. (7 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (68 resets) in 2296 ms. (17 steps per ms) remains 2/12 properties
BEST_FIRST walk for 769 steps (0 resets) in 11 ms. (64 steps per ms) remains 0/2 properties
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' '!((F(p0)&&X(G(p1))))'
Support contains 13 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1381/1381 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1381
Applied a total of 10 rules in 85 ms. Remains 653 /663 variables (removed 10) and now considering 1381/1381 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:31:12] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
// Phase 1: matrix 1372 rows 653 cols
[2024-05-28 07:31:12] [INFO ] Computed 82 invariants in 64 ms
[2024-05-28 07:31:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2025 variables, and 71 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:31:44] [INFO ] Deduced a trap composed of 19 places in 390 ms of which 7 ms to minimize.
[2024-05-28 07:31:44] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 73 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 2/2 constraints]
After SMT, in 47897ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 47937ms
[2024-05-28 07:32:00] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:32:00] [INFO ] Invariant cache hit.
[2024-05-28 07:32:00] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-28 07:32:00] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:32:00] [INFO ] Invariant cache hit.
[2024-05-28 07:32:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:32:05] [INFO ] Implicit Places using invariants and state equation in 4438 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:32:05] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:32:05] [INFO ] Invariant cache hit.
[2024-05-28 07:32:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 timeout
0.0)
(s14 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/652 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/2025 variables, and 81 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:32:45] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:33:06] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 1 ms to minimize.
[2024-05-28 07:33:06] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 5 ms to minimize.
[2024-05-28 07:33:06] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-05-28 07:33:06] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 76 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 5/5 constraints]
After SMT, in 67058ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 67087ms
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1381/1381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120008 ms. Remains : 653/663 places, 1381/1381 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-00 finished in 120314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 33 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1381/1381 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1346
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1346
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1311
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1311
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1308
Applied a total of 146 rules in 166 ms. Remains 580 /663 variables (removed 83) and now considering 1308/1381 (removed 73) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:33:12] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
// Phase 1: matrix 1299 rows 580 cols
[2024-05-28 07:33:12] [INFO ] Computed 82 invariants in 29 ms
[2024-05-28 07:33:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:33:29] [INFO ] Deduced a trap composed of 161 places in 268 ms of which 3 ms to minimize.
[2024-05-28 07:33:29] [INFO ] Deduced a trap composed of 151 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:33:29] [INFO ] Deduced a trap composed of 151 places in 197 ms of which 4 ms to minimize.
[2024-05-28 07:33:29] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 3 ms to minimize.
[2024-05-28 07:33:30] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-05-28 07:33:30] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 4 ms to minimize.
[2024-05-28 07:33:30] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 3 ms to minimize.
[2024-05-28 07:33:30] [INFO ] Deduced a trap composed of 156 places in 242 ms of which 4 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 161 places in 233 ms of which 4 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 146 places in 222 ms of which 3 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 3 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 3 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 151 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:33:33] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 3 ms to minimize.
[2024-05-28 07:33:33] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 3 ms to minimize.
[2024-05-28 07:33:33] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:33:34] [INFO ] Deduced a trap composed of 176 places in 218 ms of which 3 ms to minimize.
[2024-05-28 07:33:34] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:33:34] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 3 ms to minimize.
[2024-05-28 07:33:34] [INFO ] Deduced a trap composed of 171 places in 235 ms of which 4 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 151 places in 239 ms of which 6 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 171 places in 204 ms of which 3 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 3 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 151 places in 204 ms of which 5 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 3 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 3 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 3 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 3 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 4 ms to minimize.
[2024-05-28 07:33:38] [INFO ] Deduced a trap composed of 146 places in 216 ms of which 4 ms to minimize.
[2024-05-28 07:33:38] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:33:53] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 2 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 570/1879 variables, and 114 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 42/42 constraints]
After SMT, in 47296ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 47324ms
[2024-05-28 07:33:59] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:33:59] [INFO ] Invariant cache hit.
[2024-05-28 07:34:00] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-28 07:34:00] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:34:00] [INFO ] Invariant cache hit.
[2024-05-28 07:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:34:03] [INFO ] Implicit Places using invariants and state equation in 2764 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
[2024-05-28 07:34:03] [INFO ] Redundant transitions in 105 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:34:03] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:34:03] [INFO ] Invariant cache hit.
[2024-05-28 07:34:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:34:20] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 4 ms to minimize.
[2024-05-28 07:34:20] [INFO ] Deduced a trap composed of 151 places in 249 ms of which 4 ms to minimize.
[2024-05-28 07:34:20] [INFO ] Deduced a trap composed of 161 places in 247 ms of which 4 ms to minimize.
[2024-05-28 07:34:20] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 4 ms to minimize.
[2024-05-28 07:34:21] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 4 ms to minimize.
[2024-05-28 07:34:21] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 3 ms to minimize.
[2024-05-28 07:34:21] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 6 ms to minimize.
[2024-05-28 07:34:21] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 4 ms to minimize.
[2024-05-28 07:34:22] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 4 ms to minimize.
[2024-05-28 07:34:22] [INFO ] Deduced a trap composed of 161 places in 273 ms of which 5 ms to minimize.
[2024-05-28 07:34:22] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 4 ms to minimize.
[2024-05-28 07:34:22] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 3 ms to minimize.
[2024-05-28 07:34:23] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 4 ms to minimize.
[2024-05-28 07:34:23] [INFO ] Deduced a trap composed of 236 places in 197 ms of which 3 ms to minimize.
[2024-05-28 07:34:23] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:34:23] [INFO ] Deduced a trap composed of 151 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:34:24] [INFO ] Deduced a trap composed of 156 places in 262 ms of which 4 ms to minimize.
[2024-05-28 07:34:24] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 4 ms to minimize.
[2024-05-28 07:34:24] [INFO ] Deduced a trap composed of 146 places in 193 ms of which 3 ms to minimize.
[2024-05-28 07:34:24] [INFO ] Deduced a trap composed of 156 places in 270 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:34:25] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 4 ms to minimize.
[2024-05-28 07:34:25] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 4 ms to minimize.
[2024-05-28 07:34:26] [INFO ] Deduced a trap composed of 161 places in 253 ms of which 4 ms to minimize.
[2024-05-28 07:34:26] [INFO ] Deduced a trap composed of 146 places in 217 ms of which 3 ms to minimize.
[2024-05-28 07:34:26] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 4 ms to minimize.
[2024-05-28 07:34:26] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 3 ms to minimize.
[2024-05-28 07:34:27] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 4 ms to minimize.
[2024-05-28 07:34:27] [INFO ] Deduced a trap composed of 240 places in 270 ms of which 4 ms to minimize.
[2024-05-28 07:34:27] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 3 ms to minimize.
[2024-05-28 07:34:28] [INFO ] Deduced a trap composed of 146 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:34:28] [INFO ] Deduced a trap composed of 238 places in 215 ms of which 3 ms to minimize.
[2024-05-28 07:34:28] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 4 ms to minimize.
[2024-05-28 07:34:28] [INFO ] Deduced a trap composed of 236 places in 203 ms of which 3 ms to minimize.
[2024-05-28 07:34:29] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 3 ms to minimize.
[2024-05-28 07:34:29] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 3 ms to minimize.
[2024-05-28 07:34:29] [INFO ] Deduced a trap composed of 161 places in 250 ms of which 4 ms to minimize.
[2024-05-28 07:34:29] [INFO ] Deduced a trap composed of 176 places in 284 ms of which 4 ms to minimize.
[2024-05-28 07:34:30] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 4 ms to minimize.
[2024-05-28 07:34:30] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 4 ms to minimize.
[2024-05-28 07:34:39] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 5 ms to minimize.
SMT process timed out in 36399ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 36417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/663 places, 1308/1381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87209 ms. Remains : 580/663 places, 1308/1381 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-02
Product exploration explored 100000 steps with 8181 reset in 1434 ms.
Product exploration explored 100000 steps with 8236 reset in 1304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 224 steps (17 resets) in 13 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 49 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:34:42] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:34:42] [INFO ] Invariant cache hit.
[2024-05-28 07:34:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:01] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 4 ms to minimize.
[2024-05-28 07:35:01] [INFO ] Deduced a trap composed of 151 places in 250 ms of which 4 ms to minimize.
[2024-05-28 07:35:01] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 4 ms to minimize.
[2024-05-28 07:35:02] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 4 ms to minimize.
[2024-05-28 07:35:02] [INFO ] Deduced a trap composed of 171 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:35:02] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 3 ms to minimize.
[2024-05-28 07:35:02] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2024-05-28 07:35:03] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 4 ms to minimize.
[2024-05-28 07:35:03] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:35:03] [INFO ] Deduced a trap composed of 161 places in 242 ms of which 4 ms to minimize.
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 166 places in 292 ms of which 3 ms to minimize.
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 4 ms to minimize.
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 4 ms to minimize.
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 4 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 4 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 3 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 4 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:35:06] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 4 ms to minimize.
[2024-05-28 07:35:06] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:06] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 4 ms to minimize.
[2024-05-28 07:35:07] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 4 ms to minimize.
[2024-05-28 07:35:07] [INFO ] Deduced a trap composed of 161 places in 244 ms of which 4 ms to minimize.
[2024-05-28 07:35:07] [INFO ] Deduced a trap composed of 146 places in 230 ms of which 4 ms to minimize.
[2024-05-28 07:35:08] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:35:08] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 3 ms to minimize.
[2024-05-28 07:35:08] [INFO ] Deduced a trap composed of 238 places in 241 ms of which 3 ms to minimize.
[2024-05-28 07:35:08] [INFO ] Deduced a trap composed of 240 places in 242 ms of which 4 ms to minimize.
[2024-05-28 07:35:09] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 5 ms to minimize.
[2024-05-28 07:35:09] [INFO ] Deduced a trap composed of 146 places in 247 ms of which 5 ms to minimize.
[2024-05-28 07:35:09] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 4 ms to minimize.
[2024-05-28 07:35:09] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 3 ms to minimize.
[2024-05-28 07:35:10] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 4 ms to minimize.
[2024-05-28 07:35:10] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 3 ms to minimize.
[2024-05-28 07:35:10] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 4 ms to minimize.
[2024-05-28 07:35:10] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 3 ms to minimize.
[2024-05-28 07:35:11] [INFO ] Deduced a trap composed of 176 places in 218 ms of which 3 ms to minimize.
SMT process timed out in 28136ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 28154ms
[2024-05-28 07:35:11] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:35:11] [INFO ] Invariant cache hit.
[2024-05-28 07:35:11] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-28 07:35:11] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:35:11] [INFO ] Invariant cache hit.
[2024-05-28 07:35:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:35:14] [INFO ] Implicit Places using invariants and state equation in 2934 ms returned []
Implicit Place search using SMT with State Equation took 3452 ms to find 0 implicit places.
[2024-05-28 07:35:14] [INFO ] Redundant transitions in 54 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:35:14] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:35:14] [INFO ] Invariant cache hit.
[2024-05-28 07:35:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 4 ms to minimize.
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 151 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 161 places in 279 ms of which 4 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 161 places in 326 ms of which 4 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 6 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 161 places in 289 ms of which 4 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 166 places in 283 ms of which 4 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 161 places in 305 ms of which 4 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 4 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 161 places in 283 ms of which 4 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 4 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 4 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 151 places in 237 ms of which 3 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 5 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 4 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 151 places in 241 ms of which 3 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 4 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 3 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 146 places in 228 ms of which 3 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:38] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 4 ms to minimize.
[2024-05-28 07:35:38] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 4 ms to minimize.
[2024-05-28 07:35:38] [INFO ] Deduced a trap composed of 161 places in 271 ms of which 4 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 146 places in 265 ms of which 4 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 4 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 4 ms to minimize.
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 4 ms to minimize.
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 4 ms to minimize.
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 146 places in 271 ms of which 4 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 4 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 4 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 4 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 4 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 4 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 161 places in 278 ms of which 4 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 176 places in 268 ms of which 6 ms to minimize.
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 5 ms to minimize.
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 111 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 39/111 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 155 places in 396 ms of which 4 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 141 places in 365 ms of which 4 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 136 places in 387 ms of which 4 ms to minimize.
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 151 places in 371 ms of which 4 ms to minimize.
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 165 places in 361 ms of which 3 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 161 places in 370 ms of which 4 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 160 places in 349 ms of which 4 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 161 places in 365 ms of which 4 ms to minimize.
[2024-05-28 07:35:56] [INFO ] Deduced a trap composed of 156 places in 352 ms of which 4 ms to minimize.
[2024-05-28 07:35:56] [INFO ] Deduced a trap composed of 146 places in 370 ms of which 4 ms to minimize.
[2024-05-28 07:35:56] [INFO ] Deduced a trap composed of 146 places in 344 ms of which 4 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 247 places in 386 ms of which 4 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 238 places in 394 ms of which 4 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 150 places in 370 ms of which 4 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 145 places in 336 ms of which 3 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 156 places in 324 ms of which 3 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 151 places in 307 ms of which 3 ms to minimize.
[2024-05-28 07:36:01] [INFO ] Deduced a trap composed of 165 places in 320 ms of which 4 ms to minimize.
[2024-05-28 07:36:01] [INFO ] Deduced a trap composed of 160 places in 348 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:02] [INFO ] Deduced a trap composed of 165 places in 386 ms of which 4 ms to minimize.
[2024-05-28 07:36:02] [INFO ] Deduced a trap composed of 174 places in 363 ms of which 4 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 160 places in 330 ms of which 3 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 166 places in 325 ms of which 3 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 146 places in 317 ms of which 3 ms to minimize.
[2024-05-28 07:36:04] [INFO ] Deduced a trap composed of 146 places in 374 ms of which 4 ms to minimize.
[2024-05-28 07:36:04] [INFO ] Deduced a trap composed of 166 places in 365 ms of which 4 ms to minimize.
[2024-05-28 07:36:05] [INFO ] Deduced a trap composed of 165 places in 357 ms of which 4 ms to minimize.
[2024-05-28 07:36:05] [INFO ] Deduced a trap composed of 160 places in 365 ms of which 4 ms to minimize.
[2024-05-28 07:36:05] [INFO ] Deduced a trap composed of 156 places in 346 ms of which 4 ms to minimize.
[2024-05-28 07:36:06] [INFO ] Deduced a trap composed of 156 places in 314 ms of which 3 ms to minimize.
[2024-05-28 07:36:06] [INFO ] Deduced a trap composed of 156 places in 315 ms of which 4 ms to minimize.
[2024-05-28 07:36:06] [INFO ] Deduced a trap composed of 161 places in 313 ms of which 3 ms to minimize.
[2024-05-28 07:36:07] [INFO ] Deduced a trap composed of 166 places in 365 ms of which 5 ms to minimize.
[2024-05-28 07:36:07] [INFO ] Deduced a trap composed of 234 places in 388 ms of which 4 ms to minimize.
[2024-05-28 07:36:08] [INFO ] Deduced a trap composed of 170 places in 393 ms of which 7 ms to minimize.
[2024-05-28 07:36:08] [INFO ] Deduced a trap composed of 225 places in 385 ms of which 5 ms to minimize.
[2024-05-28 07:36:08] [INFO ] Deduced a trap composed of 216 places in 356 ms of which 4 ms to minimize.
[2024-05-28 07:36:09] [INFO ] Deduced a trap composed of 249 places in 286 ms of which 4 ms to minimize.
[2024-05-28 07:36:09] [INFO ] Deduced a trap composed of 241 places in 271 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:11] [INFO ] Deduced a trap composed of 136 places in 398 ms of which 4 ms to minimize.
[2024-05-28 07:36:12] [INFO ] Deduced a trap composed of 161 places in 414 ms of which 3 ms to minimize.
[2024-05-28 07:36:12] [INFO ] Deduced a trap composed of 150 places in 359 ms of which 4 ms to minimize.
[2024-05-28 07:36:13] [INFO ] Deduced a trap composed of 141 places in 417 ms of which 5 ms to minimize.
[2024-05-28 07:36:13] [INFO ] Deduced a trap composed of 141 places in 399 ms of which 4 ms to minimize.
[2024-05-28 07:36:13] [INFO ] Deduced a trap composed of 170 places in 332 ms of which 4 ms to minimize.
[2024-05-28 07:36:14] [INFO ] Deduced a trap composed of 151 places in 321 ms of which 3 ms to minimize.
[2024-05-28 07:36:14] [INFO ] Deduced a trap composed of 146 places in 335 ms of which 3 ms to minimize.
[2024-05-28 07:36:14] [INFO ] Deduced a trap composed of 136 places in 329 ms of which 4 ms to minimize.
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 141 places in 292 ms of which 4 ms to minimize.
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 165 places in 293 ms of which 4 ms to minimize.
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 166 places in 359 ms of which 4 ms to minimize.
[2024-05-28 07:36:16] [INFO ] Deduced a trap composed of 151 places in 408 ms of which 4 ms to minimize.
[2024-05-28 07:36:16] [INFO ] Deduced a trap composed of 165 places in 369 ms of which 4 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 161 places in 407 ms of which 4 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 170 places in 391 ms of which 4 ms to minimize.
[2024-05-28 07:36:18] [INFO ] Deduced a trap composed of 151 places in 342 ms of which 6 ms to minimize.
[2024-05-28 07:36:18] [INFO ] Deduced a trap composed of 136 places in 406 ms of which 5 ms to minimize.
[2024-05-28 07:36:18] [INFO ] Deduced a trap composed of 166 places in 380 ms of which 4 ms to minimize.
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 191 places in 389 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:21] [INFO ] Deduced a trap composed of 155 places in 386 ms of which 5 ms to minimize.
SMT process timed out in 67104ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 98851 ms. Remains : 580/580 places, 1308/1308 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 265 steps (20 resets) in 14 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8139 reset in 1297 ms.
Product exploration explored 100000 steps with 8135 reset in 1233 ms.
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:36:24] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:36:24] [INFO ] Invariant cache hit.
[2024-05-28 07:36:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 4 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 3 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 4 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 161 places in 239 ms of which 4 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 4 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 4 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 3 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 161 places in 220 ms of which 3 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 4 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 156 places in 245 ms of which 4 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 151 places in 258 ms of which 4 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 4 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 156 places in 294 ms of which 4 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 151 places in 262 ms of which 3 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 3 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 4 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 146 places in 221 ms of which 4 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 234 places in 315 ms of which 4 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 4 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 161 places in 231 ms of which 4 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 146 places in 217 ms of which 3 ms to minimize.
[2024-05-28 07:36:49] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 4 ms to minimize.
[2024-05-28 07:36:49] [INFO ] Deduced a trap composed of 234 places in 210 ms of which 4 ms to minimize.
[2024-05-28 07:36:49] [INFO ] Deduced a trap composed of 238 places in 271 ms of which 7 ms to minimize.
[2024-05-28 07:36:49] [INFO ] Deduced a trap composed of 240 places in 208 ms of which 3 ms to minimize.
[2024-05-28 07:36:49] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 3 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 238 places in 198 ms of which 3 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 230 places in 195 ms of which 3 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 236 places in 194 ms of which 3 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 228 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 4 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 161 places in 196 ms of which 3 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 176 places in 194 ms of which 3 ms to minimize.
SMT process timed out in 26787ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 26799ms
[2024-05-28 07:36:51] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:36:51] [INFO ] Invariant cache hit.
[2024-05-28 07:36:52] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-28 07:36:52] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:36:52] [INFO ] Invariant cache hit.
[2024-05-28 07:36:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:36:55] [INFO ] Implicit Places using invariants and state equation in 2816 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
[2024-05-28 07:36:55] [INFO ] Redundant transitions in 43 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-05-28 07:36:55] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-05-28 07:36:55] [INFO ] Invariant cache hit.
[2024-05-28 07:36:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 4 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 151 places in 237 ms of which 3 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 161 places in 272 ms of which 3 ms to minimize.
[2024-05-28 07:37:13] [INFO ] Deduced a trap composed of 161 places in 339 ms of which 3 ms to minimize.
[2024-05-28 07:37:13] [INFO ] Deduced a trap composed of 171 places in 236 ms of which 4 ms to minimize.
[2024-05-28 07:37:13] [INFO ] Deduced a trap composed of 161 places in 256 ms of which 4 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 161 places in 222 ms of which 3 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 4 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 3 ms to minimize.
[2024-05-28 07:37:14] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:37:15] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 4 ms to minimize.
[2024-05-28 07:37:15] [INFO ] Deduced a trap composed of 151 places in 188 ms of which 3 ms to minimize.
[2024-05-28 07:37:15] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 3 ms to minimize.
[2024-05-28 07:37:15] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 3 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 3 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 3 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 146 places in 201 ms of which 3 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 234 places in 184 ms of which 3 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 234 places in 205 ms of which 3 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 3 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 3 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 4 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 3 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 4 ms to minimize.
[2024-05-28 07:37:19] [INFO ] Deduced a trap composed of 240 places in 190 ms of which 3 ms to minimize.
[2024-05-28 07:37:19] [INFO ] Deduced a trap composed of 230 places in 202 ms of which 3 ms to minimize.
[2024-05-28 07:37:19] [INFO ] Deduced a trap composed of 146 places in 312 ms of which 3 ms to minimize.
[2024-05-28 07:37:19] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 4 ms to minimize.
[2024-05-28 07:37:20] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 4 ms to minimize.
[2024-05-28 07:37:20] [INFO ] Deduced a trap composed of 236 places in 288 ms of which 4 ms to minimize.
[2024-05-28 07:37:20] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 3 ms to minimize.
[2024-05-28 07:37:21] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 3 ms to minimize.
[2024-05-28 07:37:21] [INFO ] Deduced a trap composed of 161 places in 331 ms of which 4 ms to minimize.
[2024-05-28 07:37:21] [INFO ] Deduced a trap composed of 176 places in 302 ms of which 3 ms to minimize.
[2024-05-28 07:37:21] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 4 ms to minimize.
[2024-05-28 07:37:22] [INFO ] Deduced a trap composed of 238 places in 334 ms of which 4 ms to minimize.
[2024-05-28 07:37:31] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 2 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 161 places in 344 ms of which 4 ms to minimize.
[2024-05-28 07:37:35] [INFO ] Deduced a trap composed of 160 places in 344 ms of which 3 ms to minimize.
[2024-05-28 07:37:35] [INFO ] Deduced a trap composed of 156 places in 377 ms of which 4 ms to minimize.
[2024-05-28 07:37:36] [INFO ] Deduced a trap composed of 161 places in 381 ms of which 5 ms to minimize.
[2024-05-28 07:37:36] [INFO ] Deduced a trap composed of 166 places in 358 ms of which 4 ms to minimize.
[2024-05-28 07:37:36] [INFO ] Deduced a trap composed of 176 places in 325 ms of which 3 ms to minimize.
[2024-05-28 07:37:37] [INFO ] Deduced a trap composed of 170 places in 353 ms of which 3 ms to minimize.
[2024-05-28 07:37:37] [INFO ] Deduced a trap composed of 151 places in 373 ms of which 4 ms to minimize.
[2024-05-28 07:37:37] [INFO ] Deduced a trap composed of 160 places in 334 ms of which 4 ms to minimize.
[2024-05-28 07:37:38] [INFO ] Deduced a trap composed of 166 places in 357 ms of which 4 ms to minimize.
[2024-05-28 07:37:38] [INFO ] Deduced a trap composed of 165 places in 371 ms of which 4 ms to minimize.
[2024-05-28 07:37:39] [INFO ] Deduced a trap composed of 175 places in 392 ms of which 4 ms to minimize.
[2024-05-28 07:37:39] [INFO ] Deduced a trap composed of 160 places in 389 ms of which 5 ms to minimize.
[2024-05-28 07:37:39] [INFO ] Deduced a trap composed of 165 places in 312 ms of which 3 ms to minimize.
[2024-05-28 07:37:40] [INFO ] Deduced a trap composed of 151 places in 271 ms of which 3 ms to minimize.
[2024-05-28 07:37:40] [INFO ] Deduced a trap composed of 165 places in 283 ms of which 3 ms to minimize.
[2024-05-28 07:37:40] [INFO ] Deduced a trap composed of 161 places in 281 ms of which 4 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 175 places in 290 ms of which 4 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 180 places in 311 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 5 (OVERLAPS) 9/579 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/1879 variables, and 141 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 60/60 constraints]
After SMT, in 66172ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 66191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 96412 ms. Remains : 580/580 places, 1308/1308 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-02 finished in 289269 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 14 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1381/1381 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1381
Applied a total of 10 rules in 23 ms. Remains 653 /663 variables (removed 10) and now considering 1381/1381 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:38:01] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
// Phase 1: matrix 1372 rows 653 cols
[2024-05-28 07:38:01] [INFO ] Computed 82 invariants in 29 ms
[2024-05-28 07:38:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2025 variables, and 71 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 3 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1370 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 642/2025 variables, and 73 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 2/2 constraints]
After SMT, in 47502ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 47536ms
[2024-05-28 07:38:49] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:38:49] [INFO ] Invariant cache hit.
[2024-05-28 07:38:49] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-28 07:38:49] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:38:49] [INFO ] Invariant cache hit.
[2024-05-28 07:38:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:38:54] [INFO ] Implicit Places using invariants and state equation in 4631 ms returned []
Implicit Place search using SMT with State Equation took 5061 ms to find 0 implicit places.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:38:54] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:38:54] [INFO ] Invariant cache hit.
[2024-05-28 07:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/652 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/2025 variables, and 81 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:39:36] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 1 ms to minimize.
[2024-05-28 07:39:58] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 1 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 1 ms to minimize.
[2024-05-28 07:39:59] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(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 2)
(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 1)
(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 1)
(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 1)
(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 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(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 1)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 4)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 9)
(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 0)
(s244 0)
(s245 0)
(s246 0)
(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 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(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 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 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(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 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(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 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 1)
(s530 0)
(s531 0)
(s532 1)
(s533 1)
(s534 0)
(s535 4)
(s536 0)
(s537 0)
(s538 0)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 0)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 0)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s580 0)
(s581 0)
(s582 1)
(s583 1)
(s584 1)
(s585 timeout
1)
(s586 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 76 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 5/5 constraints]
After SMT, in 67641ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 67672ms
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1381/1381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120318 ms. Remains : 653/663 places, 1381/1381 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-05
Product exploration explored 100000 steps with 5600 reset in 1122 ms.
Entered a terminal (fully accepting) state of product in 30648 steps with 1717 reset in 341 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-05 finished in 122026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1381/1381 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1381
Applied a total of 10 rules in 13 ms. Remains 653 /663 variables (removed 10) and now considering 1381/1381 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:40:03] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:40:03] [INFO ] Invariant cache hit.
[2024-05-28 07:40:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2025 variables, and 71 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:40:35] [INFO ] Deduced a trap composed of 19 places in 349 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 72 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 1/1 constraints]
After SMT, in 47726ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 47743ms
[2024-05-28 07:40:51] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:40:51] [INFO ] Invariant cache hit.
[2024-05-28 07:40:51] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-28 07:40:51] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:40:51] [INFO ] Invariant cache hit.
[2024-05-28 07:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:40:54] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 3337 ms to find 0 implicit places.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:40:54] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:40:54] [INFO ] Invariant cache hit.
[2024-05-28 07:40:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 3 (OVERLAPS) 10/652 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/2025 variables, and 81 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:41:35] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:41:55] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 1 ms to minimize.
[2024-05-28 07:41:56] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-28 07:41:56] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 1 ms to minimize.
[2024-05-28 07:41:56] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 76 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 5/5 constraints]
After SMT, in 66571ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 66597ms
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1381/1381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117702 ms. Remains : 653/663 places, 1381/1381 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-06
Product exploration explored 100000 steps with 6965 reset in 690 ms.
Product exploration explored 100000 steps with 6955 reset in 627 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 55 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 07:42:03] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:42:03] [INFO ] Invariant cache hit.
[2024-05-28 07:42:04] [INFO ] [Real]Absence check using 76 positive place invariants in 93 ms returned sat
[2024-05-28 07:42:04] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 39 ms returned sat
[2024-05-28 07:42:05] [INFO ] [Real]Absence check using state equation in 1478 ms returned sat
[2024-05-28 07:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:42:06] [INFO ] [Nat]Absence check using 76 positive place invariants in 63 ms returned sat
[2024-05-28 07:42:06] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 20 ms returned sat
[2024-05-28 07:42:08] [INFO ] [Nat]Absence check using state equation in 1381 ms returned sat
[2024-05-28 07:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:42:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 75 ms returned sat
[2024-05-28 07:42:08] [INFO ] Computed and/alt/rep : 888/2741/888 causal constraints (skipped 473 transitions) in 158 ms.
[2024-05-28 07:42:08] [INFO ] Added : 21 causal constraints over 5 iterations in 750 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1381/1381 transitions.
Applied a total of 0 rules in 15 ms. Remains 653 /653 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:42:09] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:42:09] [INFO ] Invariant cache hit.
[2024-05-28 07:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 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 642/2025 variables, and 71 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:42:39] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 72 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 1/1 constraints]
After SMT, in 47175ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 47199ms
[2024-05-28 07:42:56] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:42:56] [INFO ] Invariant cache hit.
[2024-05-28 07:42:56] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-28 07:42:56] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:42:56] [INFO ] Invariant cache hit.
[2024-05-28 07:42:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:42:59] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3238 ms to find 0 implicit places.
Running 1370 sub problems to find dead transitions.
[2024-05-28 07:42:59] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:42:59] [INFO ] Invariant cache hit.
[2024-05-28 07:42:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 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 (/ 2.0 3.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 1.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 (/ 2.0 3.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 (/ 1.0 3.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 0.0)
(s159 0.0)
(s160 (/ 1.0 3.0))
(s161 0.0)
(s162 0.0)
(s163 1.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 1.0)
(s204 4.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/652 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/2025 variables, and 81 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:43:40] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 07:44:01] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 1 ms to minimize.
[2024-05-28 07:44:01] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 1 ms to minimize.
[2024-05-28 07:44:01] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-28 07:44:02] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 76 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 5/5 constraints]
After SMT, in 66719ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 66731ms
Finished structural reductions in LTL mode , in 1 iterations and 117193 ms. Remains : 653/653 places, 1381/1381 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 51 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 07:44:06] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
[2024-05-28 07:44:06] [INFO ] Invariant cache hit.
[2024-05-28 07:44:07] [INFO ] [Real]Absence check using 76 positive place invariants in 72 ms returned sat
[2024-05-28 07:44:07] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 38 ms returned sat
[2024-05-28 07:44:08] [INFO ] [Real]Absence check using state equation in 1481 ms returned sat
[2024-05-28 07:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:44:09] [INFO ] [Nat]Absence check using 76 positive place invariants in 55 ms returned sat
[2024-05-28 07:44:09] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 20 ms returned sat
[2024-05-28 07:44:11] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2024-05-28 07:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:44:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2024-05-28 07:44:11] [INFO ] Computed and/alt/rep : 888/2741/888 causal constraints (skipped 473 transitions) in 242 ms.
[2024-05-28 07:44:12] [INFO ] Added : 21 causal constraints over 5 iterations in 892 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6962 reset in 574 ms.
Product exploration explored 100000 steps with 6959 reset in 462 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1381/1381 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 653 transition count 1381
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 653 transition count 1382
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 653 transition count 1382
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 71 place count 653 transition count 1382
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 104 place count 620 transition count 1349
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 137 place count 620 transition count 1349
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 137 rules in 171 ms. Remains 620 /653 variables (removed 33) and now considering 1349/1381 (removed 32) transitions.
Running 1338 sub problems to find dead transitions.
[2024-05-28 07:44:13] [INFO ] Flow matrix only has 1340 transitions (discarded 9 similar events)
// Phase 1: matrix 1340 rows 620 cols
[2024-05-28 07:44:13] [INFO ] Computed 82 invariants in 17 ms
[2024-05-28 07:44:13] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J30

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.248

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 694
TRANSITIONS: 12080
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 112619
UNFOLDING TIME: 1.281

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.376
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 2.197
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2133
MODEL NAME: /home/mcc/execution/model
694 places, 12080 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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