Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631130200028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DatabaseWithMutex-COL-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130200028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.1K Apr 11 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 19:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716324528166

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 20:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:48:49] [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-21 20:48:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 20:48:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 570 ms
[2024-05-21 20:48:50] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 3260 PT places and 3200.0 transition bindings in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 20:48:50] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2024-05-21 20:48:50] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 13 to 10
RANDOM walk for 2474 steps (0 resets) in 35 ms. (68 steps per ms) remains 0/10 properties
[2024-05-21 20:48:50] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:48:50] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-21 20:48:50] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions 23200 arcs in 91 ms.
[2024-05-21 20:48:50] [INFO ] Unfolded 14 HLPN properties in 5 ms.
[2024-05-21 20:48:50] [INFO ] Reduced 380 identical enabling conditions.
[2024-05-21 20:48:50] [INFO ] Reduced 380 identical enabling conditions.
Support contains 3260 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 44 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 20:48:52] [INFO ] Computed 460 invariants in 168 ms
[2024-05-21 20:48:52] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-21 20:48:52] [INFO ] Invariant cache hit.
[2024-05-21 20:48:54] [INFO ] Implicit Places using invariants and state equation in 2088 ms returned []
Implicit Place search using SMT with State Equation took 3108 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 20:48:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32385ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32433ms
Finished structural reductions in LTL mode , in 1 iterations and 35622 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Support contains 3260 out of 3260 places after structural reductions.
[2024-05-21 20:49:28] [INFO ] Flatten gal took : 692 ms
[2024-05-21 20:49:33] [INFO ] Flatten gal took : 657 ms
[2024-05-21 20:49:37] [INFO ] Input system was already deterministic with 3200 transitions.
Reduction of identical properties reduced properties to check from 16 to 11
RANDOM walk for 3731 steps (0 resets) in 1093 ms. (3 steps per ms) remains 0/11 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' '!((((p0 U p1)||X(!p2)) U (G(((p0 U p1)||X(!p2)))||(((p0 U p1)||X(!p2))&&X(!p1)))))'
Support contains 1600 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 138 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 20:49:39] [INFO ] Invariant cache hit.
[2024-05-21 20:49:40] [INFO ] Implicit Places using invariants in 1333 ms returned []
[2024-05-21 20:49:40] [INFO ] Invariant cache hit.
[2024-05-21 20:49:45] [INFO ] Implicit Places using invariants and state equation in 5376 ms returned []
Implicit Place search using SMT with State Equation took 6713 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 20:49:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32039ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32067ms
Finished structural reductions in LTL mode , in 1 iterations and 38932 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 4497 ms.
Product exploration explored 100000 steps with 50000 reset in 4315 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0 p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-00 finished in 58941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((p1&&(F(G(p3))||p2)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 269 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 20:50:38] [INFO ] Invariant cache hit.
[2024-05-21 20:50:44] [INFO ] Implicit Places using invariants in 6348 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6389 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 137 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6800 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 2851 ms.
Product exploration explored 100000 steps with 0 reset in 3071 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 p2 p3))), (X (NOT p3)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2) (NOT p0))), (X (OR (NOT p1) (NOT p2))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 863 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND p1 (NOT p0)), (AND p1 (NOT p0) p2 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (8 resets) in 1703 ms. (23 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1104 ms. (36 steps per ms) remains 1/1 properties
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 20:51:05] [INFO ] Computed 60 invariants in 259 ms
Problem apf15 is UNSAT
After SMT solving in domain Real declared 420/6060 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 0/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 p2 p3))), (X (NOT p3)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p2))), (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2) (NOT p0))), (X (OR (NOT p1) (NOT p2))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p2) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p1) p3 (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (AND (OR p1 (NOT p0)) (OR p2 (NOT p0))))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT (AND (OR p1 (NOT p3) (NOT p0)) (OR (NOT p3) p2 (NOT p0))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (F p2), (F (NOT p1)), (F p3), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND (OR p1 p3 (NOT p0)) (OR p3 p2 (NOT p0))))), (F (NOT (OR p1 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 25 factoid took 1223 ms. Reduced automaton from 8 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-01 finished in 29707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 420 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 156 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 20:51:07] [INFO ] Computed 460 invariants in 52 ms
[2024-05-21 20:51:13] [INFO ] Implicit Places using invariants in 6271 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6288 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 120 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6565 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-02
Product exploration explored 100000 steps with 3416 reset in 3457 ms.
Product exploration explored 100000 steps with 3409 reset in 3493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 118 steps (0 resets) in 21 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 20:51:24] [INFO ] Computed 60 invariants in 228 ms
[2024-05-21 20:51:38] [INFO ] [Real]Absence check using 53 positive place invariants in 318 ms returned sat
[2024-05-21 20:51:38] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 110 ms returned sat
[2024-05-21 20:51:39] [INFO ] [Real]Absence check using state equation in 870 ms returned unknown
Could not prove EG (NOT p0)
Support contains 420 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 99 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 20:51:39] [INFO ] Invariant cache hit.
[2024-05-21 20:51:42] [INFO ] Implicit Places using invariants in 2595 ms returned []
[2024-05-21 20:51:42] [INFO ] Invariant cache hit.
[2024-05-21 20:52:15] [INFO ] Performed 1825/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 20:52:36] [INFO ] Implicit Places using invariants and state equation in 54503 ms returned []
Implicit Place search using SMT with State Equation took 57100 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 20:52:36] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 20:53:11] [INFO ] Deduced a trap composed of 31 places in 874 ms of which 81 ms to minimize.
[2024-05-21 20:53:12] [INFO ] Deduced a trap composed of 31 places in 688 ms of which 8 ms to minimize.
[2024-05-21 20:53:13] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 8 ms to minimize.
[2024-05-21 20:53:13] [INFO ] Deduced a trap composed of 31 places in 631 ms of which 6 ms to minimize.
[2024-05-21 20:53:14] [INFO ] Deduced a trap composed of 31 places in 512 ms of which 6 ms to minimize.
[2024-05-21 20:53:14] [INFO ] Deduced a trap composed of 31 places in 512 ms of which 6 ms to minimize.
[2024-05-21 20:53:15] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 5 ms to minimize.
[2024-05-21 20:53:15] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 5 ms to minimize.
[2024-05-21 20:53:16] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 5 ms to minimize.
[2024-05-21 20:53:16] [INFO ] Deduced a trap composed of 31 places in 385 ms of which 5 ms to minimize.
[2024-05-21 20:53:17] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 5 ms to minimize.
[2024-05-21 20:53:17] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 5 ms to minimize.
[2024-05-21 20:53:17] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 5 ms to minimize.
[2024-05-21 20:53:18] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 4 ms to minimize.
[2024-05-21 20:53:18] [INFO ] Deduced a trap composed of 31 places in 371 ms of which 5 ms to minimize.
[2024-05-21 20:53:19] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 5 ms to minimize.
[2024-05-21 20:53:19] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 4 ms to minimize.
[2024-05-21 20:53:19] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-05-21 20:53:20] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 4 ms to minimize.
[2024-05-21 20:53:20] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 20:53:22] [INFO ] Deduced a trap composed of 31 places in 761 ms of which 8 ms to minimize.
[2024-05-21 20:53:23] [INFO ] Deduced a trap composed of 31 places in 776 ms of which 8 ms to minimize.
[2024-05-21 20:53:23] [INFO ] Deduced a trap composed of 31 places in 773 ms of which 8 ms to minimize.
[2024-05-21 20:53:24] [INFO ] Deduced a trap composed of 31 places in 702 ms of which 8 ms to minimize.
[2024-05-21 20:53:25] [INFO ] Deduced a trap composed of 31 places in 709 ms of which 7 ms to minimize.
[2024-05-21 20:53:26] [INFO ] Deduced a trap composed of 31 places in 713 ms of which 10 ms to minimize.
[2024-05-21 20:53:26] [INFO ] Deduced a trap composed of 31 places in 644 ms of which 7 ms to minimize.
[2024-05-21 20:53:27] [INFO ] Deduced a trap composed of 31 places in 653 ms of which 7 ms to minimize.
[2024-05-21 20:53:28] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 7 ms to minimize.
[2024-05-21 20:53:28] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 7 ms to minimize.
[2024-05-21 20:53:29] [INFO ] Deduced a trap composed of 31 places in 643 ms of which 7 ms to minimize.
[2024-05-21 20:53:30] [INFO ] Deduced a trap composed of 31 places in 639 ms of which 7 ms to minimize.
[2024-05-21 20:53:30] [INFO ] Deduced a trap composed of 31 places in 629 ms of which 7 ms to minimize.
[2024-05-21 20:53:31] [INFO ] Deduced a trap composed of 62 places in 627 ms of which 7 ms to minimize.
[2024-05-21 20:53:32] [INFO ] Deduced a trap composed of 31 places in 654 ms of which 9 ms to minimize.
[2024-05-21 20:53:32] [INFO ] Deduced a trap composed of 31 places in 644 ms of which 7 ms to minimize.
[2024-05-21 20:53:33] [INFO ] Deduced a trap composed of 31 places in 639 ms of which 7 ms to minimize.
[2024-05-21 20:53:34] [INFO ] Deduced a trap composed of 31 places in 635 ms of which 7 ms to minimize.
[2024-05-21 20:53:35] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 7 ms to minimize.
[2024-05-21 20:53:35] [INFO ] Deduced a trap composed of 31 places in 637 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 20:53:37] [INFO ] Deduced a trap composed of 31 places in 760 ms of which 8 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 31 places in 778 ms of which 7 ms to minimize.
[2024-05-21 20:53:38] [INFO ] Deduced a trap composed of 31 places in 738 ms of which 8 ms to minimize.
SMT process timed out in 62284ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62311ms
Finished structural reductions in LTL mode , in 1 iterations and 119519 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 106 steps (0 resets) in 9 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 20:53:41] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] [Real]Absence check using 53 positive place invariants in 304 ms returned sat
[2024-05-21 20:53:56] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 332 ms returned sat
[2024-05-21 20:53:56] [INFO ] [Real]Absence check using state equation in 314 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3413 reset in 3487 ms.
Product exploration explored 100000 steps with 3414 reset in 3648 ms.
Support contains 420 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 89 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 20:54:04] [INFO ] Invariant cache hit.
[2024-05-21 20:54:07] [INFO ] Implicit Places using invariants in 2611 ms returned []
[2024-05-21 20:54:07] [INFO ] Invariant cache hit.
[2024-05-21 20:54:40] [INFO ] Performed 1818/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 20:55:02] [INFO ] Implicit Places using invariants and state equation in 55863 ms returned []
Implicit Place search using SMT with State Equation took 58477 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 20:55:02] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 20:55:38] [INFO ] Deduced a trap composed of 31 places in 697 ms of which 8 ms to minimize.
[2024-05-21 20:55:38] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 7 ms to minimize.
[2024-05-21 20:55:39] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 7 ms to minimize.
[2024-05-21 20:55:40] [INFO ] Deduced a trap composed of 31 places in 562 ms of which 6 ms to minimize.
[2024-05-21 20:55:40] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 6 ms to minimize.
[2024-05-21 20:55:41] [INFO ] Deduced a trap composed of 31 places in 474 ms of which 6 ms to minimize.
[2024-05-21 20:55:41] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 5 ms to minimize.
[2024-05-21 20:55:42] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 6 ms to minimize.
[2024-05-21 20:55:42] [INFO ] Deduced a trap composed of 31 places in 387 ms of which 5 ms to minimize.
[2024-05-21 20:55:42] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 5 ms to minimize.
[2024-05-21 20:55:43] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 5 ms to minimize.
[2024-05-21 20:55:43] [INFO ] Deduced a trap composed of 31 places in 385 ms of which 5 ms to minimize.
[2024-05-21 20:55:44] [INFO ] Deduced a trap composed of 31 places in 402 ms of which 5 ms to minimize.
[2024-05-21 20:55:44] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 8 ms to minimize.
[2024-05-21 20:55:45] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 5 ms to minimize.
[2024-05-21 20:55:45] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 5 ms to minimize.
[2024-05-21 20:55:45] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 4 ms to minimize.
[2024-05-21 20:55:46] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 4 ms to minimize.
[2024-05-21 20:55:46] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 4 ms to minimize.
[2024-05-21 20:55:46] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 20:55:48] [INFO ] Deduced a trap composed of 31 places in 739 ms of which 8 ms to minimize.
[2024-05-21 20:55:49] [INFO ] Deduced a trap composed of 31 places in 760 ms of which 8 ms to minimize.
[2024-05-21 20:55:50] [INFO ] Deduced a trap composed of 31 places in 760 ms of which 8 ms to minimize.
[2024-05-21 20:55:50] [INFO ] Deduced a trap composed of 31 places in 692 ms of which 7 ms to minimize.
[2024-05-21 20:55:51] [INFO ] Deduced a trap composed of 31 places in 689 ms of which 7 ms to minimize.
[2024-05-21 20:55:52] [INFO ] Deduced a trap composed of 31 places in 689 ms of which 7 ms to minimize.
[2024-05-21 20:55:53] [INFO ] Deduced a trap composed of 31 places in 640 ms of which 7 ms to minimize.
[2024-05-21 20:55:53] [INFO ] Deduced a trap composed of 31 places in 637 ms of which 6 ms to minimize.
[2024-05-21 20:55:54] [INFO ] Deduced a trap composed of 31 places in 635 ms of which 7 ms to minimize.
[2024-05-21 20:55:55] [INFO ] Deduced a trap composed of 31 places in 622 ms of which 7 ms to minimize.
[2024-05-21 20:55:55] [INFO ] Deduced a trap composed of 31 places in 610 ms of which 7 ms to minimize.
[2024-05-21 20:55:56] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 7 ms to minimize.
[2024-05-21 20:55:57] [INFO ] Deduced a trap composed of 31 places in 621 ms of which 7 ms to minimize.
[2024-05-21 20:55:57] [INFO ] Deduced a trap composed of 62 places in 605 ms of which 7 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 7 ms to minimize.
[2024-05-21 20:55:59] [INFO ] Deduced a trap composed of 31 places in 639 ms of which 7 ms to minimize.
[2024-05-21 20:55:59] [INFO ] Deduced a trap composed of 31 places in 627 ms of which 7 ms to minimize.
[2024-05-21 20:56:00] [INFO ] Deduced a trap composed of 31 places in 656 ms of which 7 ms to minimize.
[2024-05-21 20:56:01] [INFO ] Deduced a trap composed of 31 places in 638 ms of which 7 ms to minimize.
[2024-05-21 20:56:01] [INFO ] Deduced a trap composed of 31 places in 619 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 20:56:03] [INFO ] Deduced a trap composed of 31 places in 730 ms of which 8 ms to minimize.
[2024-05-21 20:56:04] [INFO ] Deduced a trap composed of 31 places in 736 ms of which 8 ms to minimize.
[2024-05-21 20:56:05] [INFO ] Deduced a trap composed of 31 places in 749 ms of which 8 ms to minimize.
[2024-05-21 20:56:05] [INFO ] Deduced a trap composed of 31 places in 769 ms of which 8 ms to minimize.
SMT process timed out in 62900ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62927ms
Finished structural reductions in LTL mode , in 1 iterations and 121500 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-02 finished in 299948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(!p1)&&p0))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 153 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 20:56:07] [INFO ] Computed 460 invariants in 53 ms
[2024-05-21 20:56:09] [INFO ] Implicit Places using invariants in 1357 ms returned []
[2024-05-21 20:56:09] [INFO ] Invariant cache hit.
[2024-05-21 20:56:14] [INFO ] Implicit Places using invariants and state equation in 5920 ms returned []
Implicit Place search using SMT with State Equation took 7279 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 20:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32230ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32259ms
Finished structural reductions in LTL mode , in 1 iterations and 39700 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 3473 ms.
Product exploration explored 100000 steps with 50000 reset in 3456 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-04 finished in 54459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 400 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 800 place count 2860 transition count 2000
Deduced a syphon composed of 800 places in 0 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 2400 place count 2060 transition count 2000
Applied a total of 2400 rules in 589 ms. Remains 2060 /3260 variables (removed 1200) and now considering 2000/3200 (removed 1200) transitions.
// Phase 1: matrix 2000 rows 2060 cols
[2024-05-21 20:57:02] [INFO ] Computed 460 invariants in 25 ms
[2024-05-21 20:57:06] [INFO ] Implicit Places using invariants in 4134 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 4158 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1660/3260 places, 2000/3200 transitions.
Applied a total of 0 rules in 69 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4816 ms. Remains : 1660/3260 places, 2000/3200 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1255 ms.
Product exploration explored 100000 steps with 0 reset in 1407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 81 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 2000 rows 1660 cols
[2024-05-21 20:57:11] [INFO ] Computed 60 invariants in 117 ms
[2024-05-21 20:57:14] [INFO ] [Real]Absence check using 54 positive place invariants in 106 ms returned sat
[2024-05-21 20:57:14] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 49 ms returned sat
[2024-05-21 20:57:19] [INFO ] [Real]Absence check using state equation in 4496 ms returned sat
[2024-05-21 20:57:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:57:23] [INFO ] [Nat]Absence check using 54 positive place invariants in 978 ms returned sat
[2024-05-21 20:57:23] [INFO ] [Nat]Absence check using 54 positive and 6 generalized place invariants in 125 ms returned sat
[2024-05-21 20:57:34] [INFO ] [Nat]Absence check using state equation in 11044 ms returned unknown
Could not prove EG (NOT p0)
Support contains 400 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 2000/2000 transitions.
Applied a total of 0 rules in 72 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2024-05-21 20:57:34] [INFO ] Invariant cache hit.
[2024-05-21 20:57:36] [INFO ] Implicit Places using invariants in 2180 ms returned []
[2024-05-21 20:57:36] [INFO ] Invariant cache hit.
[2024-05-21 20:57:50] [INFO ] Implicit Places using invariants and state equation in 14338 ms returned []
Implicit Place search using SMT with State Equation took 16522 ms to find 0 implicit places.
[2024-05-21 20:57:51] [INFO ] Redundant transitions in 146 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-21 20:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1640/3660 variables, and 39 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/1660 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-21 20:58:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-21 20:58:46] [INFO ] Deduced a trap composed of 7 places in 1163 ms of which 10 ms to minimize.
[2024-05-21 20:58:47] [INFO ] Deduced a trap composed of 7 places in 1085 ms of which 10 ms to minimize.
[2024-05-21 20:58:48] [INFO ] Deduced a trap composed of 7 places in 1037 ms of which 10 ms to minimize.
[2024-05-21 20:58:49] [INFO ] Deduced a trap composed of 7 places in 1062 ms of which 9 ms to minimize.
[2024-05-21 20:58:50] [INFO ] Deduced a trap composed of 7 places in 1044 ms of which 9 ms to minimize.
[2024-05-21 20:58:51] [INFO ] Deduced a trap composed of 7 places in 1111 ms of which 10 ms to minimize.
[2024-05-21 20:58:52] [INFO ] Deduced a trap composed of 7 places in 1057 ms of which 10 ms to minimize.
[2024-05-21 20:58:53] [INFO ] Deduced a trap composed of 7 places in 952 ms of which 8 ms to minimize.
SMT process timed out in 62479ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 62495ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79244 ms. Remains : 1660/1660 places, 2000/2000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 75 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-21 20:58:55] [INFO ] Invariant cache hit.
[2024-05-21 20:58:58] [INFO ] [Real]Absence check using 54 positive place invariants in 117 ms returned sat
[2024-05-21 20:58:58] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 53 ms returned sat
[2024-05-21 20:59:05] [INFO ] [Real]Absence check using state equation in 6302 ms returned sat
[2024-05-21 20:59:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:59:08] [INFO ] [Nat]Absence check using 54 positive place invariants in 750 ms returned sat
[2024-05-21 20:59:10] [INFO ] [Nat]Absence check using 54 positive and 6 generalized place invariants in 1518 ms returned sat
[2024-05-21 20:59:20] [INFO ] [Nat]Absence check using state equation in 9913 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1238 ms.
Product exploration explored 100000 steps with 0 reset in 1363 ms.
Support contains 400 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 2000/2000 transitions.
Applied a total of 0 rules in 64 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
[2024-05-21 20:59:22] [INFO ] Invariant cache hit.
[2024-05-21 20:59:25] [INFO ] Implicit Places using invariants in 2176 ms returned []
[2024-05-21 20:59:25] [INFO ] Invariant cache hit.
[2024-05-21 20:59:38] [INFO ] Implicit Places using invariants and state equation in 13905 ms returned []
Implicit Place search using SMT with State Equation took 16097 ms to find 0 implicit places.
[2024-05-21 20:59:39] [INFO ] Redundant transitions in 92 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-21 20:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1640/3660 variables, and 39 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/1660 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1640 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1640 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-21 21:00:32] [INFO ] Deduced a trap composed of 7 places in 947 ms of which 9 ms to minimize.
[2024-05-21 21:00:33] [INFO ] Deduced a trap composed of 7 places in 999 ms of which 10 ms to minimize.
[2024-05-21 21:00:34] [INFO ] Deduced a trap composed of 7 places in 1142 ms of which 10 ms to minimize.
[2024-05-21 21:00:35] [INFO ] Deduced a trap composed of 7 places in 1022 ms of which 11 ms to minimize.
[2024-05-21 21:00:36] [INFO ] Deduced a trap composed of 7 places in 949 ms of which 9 ms to minimize.
[2024-05-21 21:00:37] [INFO ] Deduced a trap composed of 7 places in 981 ms of which 9 ms to minimize.
[2024-05-21 21:00:38] [INFO ] Deduced a trap composed of 7 places in 957 ms of which 9 ms to minimize.
[2024-05-21 21:00:39] [INFO ] Deduced a trap composed of 7 places in 967 ms of which 9 ms to minimize.
[2024-05-21 21:00:40] [INFO ] Deduced a trap composed of 7 places in 963 ms of which 9 ms to minimize.
[2024-05-21 21:00:41] [INFO ] Deduced a trap composed of 7 places in 933 ms of which 9 ms to minimize.
SMT process timed out in 62112ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 62129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78389 ms. Remains : 1660/1660 places, 2000/2000 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-05 finished in 220015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1&&F(p0))))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 88 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 21:00:42] [INFO ] Computed 460 invariants in 45 ms
[2024-05-21 21:00:48] [INFO ] Implicit Places using invariants in 5980 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5996 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 62 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6147 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-06
Entered a terminal (fully accepting) state of product in 23983 steps with 24 reset in 960 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-06 finished in 7381 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((F(p0)&&(!p1||X((X(!p0)&&p2)))))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 76 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:00:49] [INFO ] Invariant cache hit.
[2024-05-21 21:00:50] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-05-21 21:00:50] [INFO ] Invariant cache hit.
[2024-05-21 21:00:55] [INFO ] Implicit Places using invariants and state equation in 5194 ms returned []
Implicit Place search using SMT with State Equation took 6434 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:00:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31869ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31897ms
Finished structural reductions in LTL mode , in 1 iterations and 38412 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-07
Product exploration explored 100000 steps with 2582 reset in 2007 ms.
Product exploration explored 100000 steps with 2578 reset in 2058 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 3475 steps (0 resets) in 180 ms. (19 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
[2024-05-21 21:01:39] [INFO ] Invariant cache hit.
[2024-05-21 21:01:43] [INFO ] [Real]Absence check using 59 positive place invariants in 111 ms returned sat
[2024-05-21 21:01:44] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 1357 ms returned sat
[2024-05-21 21:01:54] [INFO ] [Real]Absence check using state equation in 9388 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 78 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:01:54] [INFO ] Invariant cache hit.
[2024-05-21 21:01:55] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2024-05-21 21:01:55] [INFO ] Invariant cache hit.
[2024-05-21 21:02:00] [INFO ] Implicit Places using invariants and state equation in 5091 ms returned []
Implicit Place search using SMT with State Equation took 6347 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:02:00] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32038ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32066ms
Finished structural reductions in LTL mode , in 1 iterations and 38499 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 3565 steps (0 resets) in 194 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
[2024-05-21 21:02:39] [INFO ] Invariant cache hit.
[2024-05-21 21:02:43] [INFO ] [Real]Absence check using 59 positive place invariants in 95 ms returned sat
[2024-05-21 21:02:45] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 1294 ms returned sat
[2024-05-21 21:02:54] [INFO ] [Real]Absence check using state equation in 9620 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Product exploration explored 100000 steps with 2579 reset in 2044 ms.
Product exploration explored 100000 steps with 2580 reset in 2053 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (OR (NOT p2) p0), true, p0]
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 400 Pre rules applied. Total rules applied 0 place count 3260 transition count 3200
Deduced a syphon composed of 400 places in 1 ms
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 3200
Deduced a syphon composed of 400 places in 1 ms
Applied a total of 400 rules in 268 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:02:59] [INFO ] Redundant transitions in 95 ms returned []
Running 2800 sub problems to find dead transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 21:02:59] [INFO ] Computed 460 invariants in 47 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32485ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3260/3260 places, 3200/3200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32887 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 76 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 21:03:32] [INFO ] Computed 460 invariants in 42 ms
[2024-05-21 21:03:33] [INFO ] Implicit Places using invariants in 1290 ms returned []
[2024-05-21 21:03:33] [INFO ] Invariant cache hit.
[2024-05-21 21:03:39] [INFO ] Implicit Places using invariants and state equation in 5706 ms returned []
Implicit Place search using SMT with State Equation took 7005 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:03:39] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31819ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31846ms
Finished structural reductions in LTL mode , in 1 iterations and 38935 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-07 finished in 202889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(F((X(!p2)&&p1)))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 91 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:04:12] [INFO ] Invariant cache hit.
[2024-05-21 21:04:13] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-21 21:04:13] [INFO ] Invariant cache hit.
[2024-05-21 21:04:19] [INFO ] Implicit Places using invariants and state equation in 5261 ms returned []
Implicit Place search using SMT with State Equation took 6695 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:04:19] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32144ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32171ms
Finished structural reductions in LTL mode , in 1 iterations and 38967 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) p2), p2, (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 7307 ms.
Product exploration explored 100000 steps with 33333 reset in 7225 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 100 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-08 finished in 89481 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' '!(((p0 U X(p1))||X(X(G(!p0)))))'
Support contains 800 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 94 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:05:41] [INFO ] Invariant cache hit.
[2024-05-21 21:05:47] [INFO ] Implicit Places using invariants in 5754 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5768 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 73 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5935 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-09
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 5 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-09 finished in 6254 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((G(!p0)||(F(!p1)&&(!p0 U (G(!p0)||(!p0&&(G(!p2)||(!p2&&F(!p3)))))))))))'
Support contains 2040 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 63 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:05:48] [INFO ] Invariant cache hit.
[2024-05-21 21:05:48] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-21 21:05:48] [INFO ] Invariant cache hit.
[2024-05-21 21:05:50] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
[2024-05-21 21:05:50] [INFO ] Redundant transitions in 71 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:05:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31875ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34637 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 218 ms :[p0, (AND p1 p0), p0, (AND p2 p0 p3), (AND p0 p3)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-10
Product exploration explored 100000 steps with 112 reset in 9890 ms.
Product exploration timeout after 96810 steps with 110 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0)))))]
Knowledge based reduction with 18 factoid took 224 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
RANDOM walk for 4078 steps (0 resets) in 636 ms. (6 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p3)))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 18 factoid took 614 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 190 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Support contains 2040 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 59 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:07:07] [INFO ] Invariant cache hit.
[2024-05-21 21:07:07] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-21 21:07:07] [INFO ] Invariant cache hit.
[2024-05-21 21:07:09] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2024-05-21 21:07:09] [INFO ] Redundant transitions in 74 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31875ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34649 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3))))]
Knowledge based reduction with 18 factoid took 262 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
RANDOM walk for 4816 steps (0 resets) in 1062 ms. (4 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p3)))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 18 factoid took 701 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 167 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 209 ms :[p0, (AND p1 p0), p0, (AND p0 p2 p3), (AND p0 p3)]
Product exploration explored 100000 steps with 121 reset in 5249 ms.
Product exploration explored 100000 steps with 112 reset in 5613 ms.
Support contains 2040 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 57 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:08:18] [INFO ] Invariant cache hit.
[2024-05-21 21:08:18] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-05-21 21:08:18] [INFO ] Invariant cache hit.
[2024-05-21 21:08:20] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2024-05-21 21:08:20] [INFO ] Redundant transitions in 70 ms returned []
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:08:20] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31834ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31861ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34606 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-10 finished in 185455 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((X(p0)||G((p1&&(G(p3)||p2))))))'
Support contains 2020 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 33 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:08:53] [INFO ] Invariant cache hit.
[2024-05-21 21:08:54] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-05-21 21:08:54] [INFO ] Invariant cache hit.
[2024-05-21 21:08:58] [INFO ] Implicit Places using invariants and state equation in 4240 ms returned []
Implicit Place search using SMT with State Equation took 5165 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:08:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32386ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32413ms
Finished structural reductions in LTL mode , in 1 iterations and 37626 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-11 finished in 38004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(G(p2) U p3))))'
Support contains 1240 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 67 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:09:31] [INFO ] Invariant cache hit.
[2024-05-21 21:09:36] [INFO ] Implicit Places using invariants in 5345 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5363 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 65 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5495 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-13 finished in 5791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&G(!p0)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 94 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:09:37] [INFO ] Invariant cache hit.
[2024-05-21 21:09:43] [INFO ] Implicit Places using invariants in 5930 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5950 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 69 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6113 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p1) p0), p0, true]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-14
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-14 finished in 6285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((((p0 U p1)&&F(p2)) U p1) U p0)))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 93 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:09:43] [INFO ] Invariant cache hit.
[2024-05-21 21:09:49] [INFO ] Implicit Places using invariants in 5614 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5626 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 65 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5786 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-15 finished in 5903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-20-LTLFireability-02
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 420 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 800 place count 2860 transition count 2400
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1600 place count 2460 transition count 2400
Applied a total of 1600 rules in 499 ms. Remains 2460 /3260 variables (removed 800) and now considering 2400/3200 (removed 800) transitions.
// Phase 1: matrix 2400 rows 2460 cols
[2024-05-21 21:09:50] [INFO ] Computed 460 invariants in 34 ms
[2024-05-21 21:09:54] [INFO ] Implicit Places using invariants in 4352 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 4363 ms to find 400 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2060/3260 places, 2400/3200 transitions.
Applied a total of 0 rules in 68 ms. Remains 2060 /2060 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4931 ms. Remains : 2060/3260 places, 2400/3200 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLFireability-02
Product exploration explored 100000 steps with 4579 reset in 3721 ms.
Product exploration explored 100000 steps with 4597 reset in 3763 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 83 steps (0 resets) in 8 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2400 rows 2060 cols
[2024-05-21 21:10:05] [INFO ] Computed 60 invariants in 147 ms
[2024-05-21 21:10:17] [INFO ] [Real]Absence check using 54 positive place invariants in 195 ms returned sat
[2024-05-21 21:10:17] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 142 ms returned sat
[2024-05-21 21:10:20] [INFO ] [Real]Absence check using state equation in 2994 ms returned unknown
Could not prove EG (NOT p0)
Support contains 420 out of 2060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2060/2060 places, 2400/2400 transitions.
Applied a total of 0 rules in 45 ms. Remains 2060 /2060 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-21 21:10:20] [INFO ] Invariant cache hit.
[2024-05-21 21:10:22] [INFO ] Implicit Places using invariants in 2020 ms returned []
[2024-05-21 21:10:22] [INFO ] Invariant cache hit.
[2024-05-21 21:10:46] [INFO ] Implicit Places using invariants and state equation in 24323 ms returned []
Implicit Place search using SMT with State Equation took 26344 ms to find 0 implicit places.
Running 2000 sub problems to find dead transitions.
[2024-05-21 21:10:46] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2040/4460 variables, and 39 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:11:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2040 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2040 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2040 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:11:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2040 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:11:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2040 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:11:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2040 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2040 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:35] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2040 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:38] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2040 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:39] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:11:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:11:41] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 21:11:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:11:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2040 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2040 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:11:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:11:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2040 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:11:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:11:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:11:48] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:11:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:11:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:11:48] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:11:48] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
SMT process timed out in 61632ms, After SMT, problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61658ms
Finished structural reductions in LTL mode , in 1 iterations and 88052 ms. Remains : 2060/2060 places, 2400/2400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 76 steps (0 resets) in 12 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 21:11:51] [INFO ] Invariant cache hit.
[2024-05-21 21:12:02] [INFO ] [Real]Absence check using 54 positive place invariants in 169 ms returned sat
[2024-05-21 21:12:03] [INFO ] [Real]Absence check using 54 positive and 6 generalized place invariants in 173 ms returned sat
[2024-05-21 21:12:06] [INFO ] [Real]Absence check using state equation in 3224 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4610 reset in 3725 ms.
Product exploration explored 100000 steps with 4609 reset in 3761 ms.
Support contains 420 out of 2060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2060/2060 places, 2400/2400 transitions.
Applied a total of 0 rules in 45 ms. Remains 2060 /2060 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-21 21:12:14] [INFO ] Invariant cache hit.
[2024-05-21 21:12:16] [INFO ] Implicit Places using invariants in 2008 ms returned []
[2024-05-21 21:12:16] [INFO ] Invariant cache hit.
[2024-05-21 21:12:41] [INFO ] Implicit Places using invariants and state equation in 25023 ms returned []
Implicit Place search using SMT with State Equation took 27035 ms to find 0 implicit places.
Running 2000 sub problems to find dead transitions.
[2024-05-21 21:12:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2040/4460 variables, and 39 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2040 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2040 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2040 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2040 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:13:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2040 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2040 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2040 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:27] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2040 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:13:29] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 5 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2040 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2040 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2040 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2040 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-21 21:13:40] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2040 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 21:13:41] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 21:13:42] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2040 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2040/4460 variables, and 319 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2060 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 280/280 constraints]
After SMT, in 61545ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61568ms
Finished structural reductions in LTL mode , in 1 iterations and 88653 ms. Remains : 2060/2060 places, 2400/2400 transitions.
Treatment of property DatabaseWithMutex-COL-20-LTLFireability-02 finished in 234203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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((F(p0)&&(!p1||X((X(!p0)&&p2)))))))'
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((G(!p0)||(F(!p1)&&(!p0 U (G(!p0)||(!p0&&(G(!p2)||(!p2&&F(!p3)))))))))))'
[2024-05-21 21:13:44] [INFO ] Flatten gal took : 337 ms
[2024-05-21 21:13:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 49 ms.
[2024-05-21 21:13:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3260 places, 3200 transitions and 23200 arcs took 20 ms.
Total runtime 1495167 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DatabaseWithMutex-COL-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3260
TRANSITIONS: 3200
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.115s, Sys 0.004s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.014s, Sys 0.000s]


----------------------------------------------------------------------
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: 4283
MODEL NAME: /home/mcc/execution/414/model
3260 places, 3200 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DatabaseWithMutex-COL-20"
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 DatabaseWithMutex-COL-20, 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 r135-tall-171631130200028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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