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.r069-tall-171620504400371.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 CircularTrains-PT-768, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504400371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K 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 CircularTrains-PT-768-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716432243088

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:44:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:44:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:44:04] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-23 02:44:04] [INFO ] Transformed 1536 places.
[2024-05-23 02:44:04] [INFO ] Transformed 768 transitions.
[2024-05-23 02:44:04] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-768-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 768/768 transitions.
Applied a total of 0 rules in 153 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-05-23 02:44:04] [INFO ] Computed 769 invariants in 98 ms
[2024-05-23 02:44:06] [INFO ] Implicit Places using invariants in 1584 ms returned [3, 14, 18, 29, 35, 45, 47, 59, 75, 79, 81, 83, 85, 90, 94, 96, 102, 106, 110, 111, 125, 128, 138, 144, 149, 150, 152, 155, 158, 173, 180, 187, 193, 196, 197, 198, 224, 228, 244, 248, 250, 255, 259, 273, 276, 296, 304, 312, 318, 325, 330, 333, 339, 350, 353, 355, 361, 368, 380, 381, 389, 402, 409, 414, 419, 420, 421, 438, 451, 453, 463, 464, 471, 473, 480, 509, 516, 519, 530, 531, 533, 535, 544, 549, 558, 561, 577, 578, 580, 600, 606, 612, 622, 630, 633, 656, 658, 661, 662, 665, 666, 669, 671, 677, 681, 688, 689, 693, 694, 696, 697, 699, 705, 709, 711, 715, 716, 725, 732, 750, 761, 767, 770, 776, 780, 793, 804, 807, 810, 811, 817, 820, 839, 843, 846, 856, 872, 874, 883, 884, 885, 887, 905, 929, 934, 940, 942, 943, 948, 952, 970, 973, 975, 977, 991, 997, 1005, 1009, 1013, 1017, 1018, 1019, 1020, 1042, 1046, 1059, 1071, 1073, 1078, 1079, 1087, 1088, 1094, 1096, 1101, 1121, 1128, 1131, 1147, 1150, 1153, 1157, 1160, 1162, 1163, 1168, 1178, 1182, 1185, 1198, 1204, 1209, 1211, 1216, 1229, 1244, 1247, 1252, 1261, 1262, 1273, 1292, 1299, 1300, 1301, 1305, 1306, 1329, 1335, 1337, 1338, 1339, 1350, 1354, 1356, 1360, 1362, 1373, 1378, 1379, 1385, 1391, 1409, 1430, 1438, 1446, 1450, 1453, 1461, 1472, 1476, 1484, 1485, 1487, 1488, 1495, 1507, 1512, 1513, 1515, 1517, 1525, 1527, 1531]
Discarding 244 places :
Implicit Place search using SMT only with invariants took 1619 ms to find 244 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1292/1536 places, 768/768 transitions.
Applied a total of 0 rules in 131 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1927 ms. Remains : 1292/1536 places, 768/768 transitions.
Support contains 51 out of 1292 places after structural reductions.
[2024-05-23 02:44:06] [INFO ] Flatten gal took : 91 ms
[2024-05-23 02:44:06] [INFO ] Flatten gal took : 52 ms
[2024-05-23 02:44:06] [INFO ] Input system was already deterministic with 768 transitions.
Support contains 50 out of 1292 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2760 ms. (14 steps per ms) remains 7/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 485 ms. (82 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
// Phase 1: matrix 768 rows 1292 cols
[2024-05-23 02:44:08] [INFO ] Computed 525 invariants in 42 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 23/2060 variables, and 8 constraints, problems are : Problem set: 7 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 8/510 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA CircularTrains-PT-768-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-768-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 4 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 228 place count 1292 transition count 540
Reduce places removed 228 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 229 rules applied. Total rules applied 457 place count 1064 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 458 place count 1063 transition count 539
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 458 place count 1063 transition count 526
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 484 place count 1050 transition count 526
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 508 place count 1038 transition count 514
Applied a total of 508 rules in 212 ms. Remains 1038 /1292 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1038 cols
[2024-05-23 02:44:09] [INFO ] Computed 525 invariants in 12 ms
[2024-05-23 02:44:09] [INFO ] Implicit Places using invariants in 705 ms returned [110, 165, 167, 339, 379, 465, 643, 725, 825, 851, 1012, 1015]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 707 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1292 places, 514/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 960 ms. Remains : 1026/1292 places, 514/768 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-00
Product exploration explored 100000 steps with 1386 reset in 4571 ms.
Product exploration explored 100000 steps with 1366 reset in 4693 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1167 steps (0 resets) in 68 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 413 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 514 rows 1026 cols
[2024-05-23 02:44:20] [INFO ] Computed 513 invariants in 9 ms
[2024-05-23 02:44:21] [INFO ] [Real]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-05-23 02:44:21] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-23 02:44:30] [INFO ] [Real]Absence check using state equation in 9323 ms returned sat
[2024-05-23 02:44:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:44:31] [INFO ] [Nat]Absence check using 511 positive place invariants in 217 ms returned sat
[2024-05-23 02:44:31] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-23 02:44:46] [INFO ] [Nat]Absence check using state equation in 14326 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 514/514 transitions.
Applied a total of 0 rules in 41 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-05-23 02:44:46] [INFO ] Invariant cache hit.
[2024-05-23 02:44:46] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-23 02:44:46] [INFO ] Invariant cache hit.
[2024-05-23 02:44:47] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2024-05-23 02:44:47] [INFO ] Redundant transitions in 25 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 02:44:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1540 variables, 1026/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 1539 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1540 variables, 1026/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 258/1797 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1540 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/1540 variables, and 1797 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61695 ms. Remains : 1026/1026 places, 514/514 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 378 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 989 steps (0 resets) in 65 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 371 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 02:45:49] [INFO ] Invariant cache hit.
[2024-05-23 02:45:49] [INFO ] [Real]Absence check using 511 positive place invariants in 239 ms returned sat
[2024-05-23 02:45:49] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 40 ms returned sat
[2024-05-23 02:45:55] [INFO ] [Real]Absence check using state equation in 5641 ms returned sat
[2024-05-23 02:45:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:45:56] [INFO ] [Nat]Absence check using 511 positive place invariants in 237 ms returned sat
[2024-05-23 02:45:56] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 60 ms returned sat
[2024-05-23 02:46:03] [INFO ] [Nat]Absence check using state equation in 7075 ms returned sat
[2024-05-23 02:46:03] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-23 02:46:10] [INFO ] Added : 25 causal constraints over 5 iterations in 7033 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1376 reset in 4426 ms.
Product exploration explored 100000 steps with 1385 reset in 4660 ms.
Support contains 4 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 514/514 transitions.
Applied a total of 0 rules in 33 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-05-23 02:46:19] [INFO ] Invariant cache hit.
[2024-05-23 02:46:20] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-23 02:46:20] [INFO ] Invariant cache hit.
[2024-05-23 02:46:21] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2024-05-23 02:46:21] [INFO ] Redundant transitions in 5 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-23 02:46:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1540 variables, 1026/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 1539 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1540 variables, 1026/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 258/1797 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1540 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/1540 variables, and 1797 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61657 ms. Remains : 1026/1026 places, 514/514 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-00 finished in 192463 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(p1))||G(p1)))))'
Support contains 5 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Applied a total of 0 rules in 47 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-23 02:47:21] [INFO ] Computed 525 invariants in 8 ms
[2024-05-23 02:47:22] [INFO ] Implicit Places using invariants in 763 ms returned [134, 205, 424, 473, 575, 803, 905, 1034, 1066, 1261]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 765 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1292 places, 768/768 transitions.
Applied a total of 0 rules in 46 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 858 ms. Remains : 1282/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-04
Product exploration explored 100000 steps with 20 reset in 3003 ms.
Product exploration explored 100000 steps with 21 reset in 3273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 26637 steps (5 resets) in 1116 ms. (23 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 495 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 768 rows 1282 cols
[2024-05-23 02:47:30] [INFO ] Computed 515 invariants in 12 ms
[2024-05-23 02:47:31] [INFO ] [Real]Absence check using 511 positive place invariants in 251 ms returned sat
[2024-05-23 02:47:31] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 34 ms returned sat
[2024-05-23 02:47:41] [INFO ] [Real]Absence check using state equation in 9320 ms returned sat
[2024-05-23 02:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:41] [INFO ] [Nat]Absence check using 511 positive place invariants in 266 ms returned sat
[2024-05-23 02:47:42] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 116 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using state equation in 11692 ms returned sat
[2024-05-23 02:47:53] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-23 02:47:56] [INFO ] Added : 10 causal constraints over 2 iterations in 2295 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 5 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 53 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:47:56] [INFO ] Invariant cache hit.
[2024-05-23 02:47:56] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-05-23 02:47:56] [INFO ] Invariant cache hit.
[2024-05-23 02:47:58] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:47:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 511/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 514 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 511/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 1/1282 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2050 variables, 1282/1797 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2050 variables, 512/2309 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 2309 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Finished structural reductions in LTL mode , in 1 iterations and 61998 ms. Remains : 1282/1282 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 294 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 27962 steps (6 resets) in 1086 ms. (25 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 497 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-23 02:49:00] [INFO ] Invariant cache hit.
[2024-05-23 02:49:01] [INFO ] [Real]Absence check using 511 positive place invariants in 260 ms returned sat
[2024-05-23 02:49:01] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 89 ms returned sat
[2024-05-23 02:49:10] [INFO ] [Real]Absence check using state equation in 9135 ms returned sat
[2024-05-23 02:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:49:11] [INFO ] [Nat]Absence check using 511 positive place invariants in 256 ms returned sat
[2024-05-23 02:49:11] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 46 ms returned sat
[2024-05-23 02:49:12] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2024-05-23 02:49:12] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-23 02:49:17] [INFO ] Added : 15 causal constraints over 3 iterations in 5368 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 17 reset in 3001 ms.
Product exploration explored 100000 steps with 23 reset in 3254 ms.
Support contains 5 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 46 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:49:24] [INFO ] Invariant cache hit.
[2024-05-23 02:49:24] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-23 02:49:24] [INFO ] Invariant cache hit.
[2024-05-23 02:49:25] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:49:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 511/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1281/2050 variables, and 514 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 511/1281 variables, 511/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1281 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (OVERLAPS) 1/1282 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (OVERLAPS) 768/2050 variables, 1282/1797 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2050 variables, 512/2309 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 2309 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in LTL mode , in 1 iterations and 61967 ms. Remains : 1282/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-04 finished in 184693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1292 transition count 536
Reduce places removed 232 places and 0 transitions.
Iterating post reduction 1 with 232 rules applied. Total rules applied 464 place count 1060 transition count 536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 464 place count 1060 transition count 524
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 488 place count 1048 transition count 524
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 512 place count 1036 transition count 512
Applied a total of 512 rules in 114 ms. Remains 1036 /1292 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1036 cols
[2024-05-23 02:50:26] [INFO ] Computed 525 invariants in 12 ms
[2024-05-23 02:50:26] [INFO ] Implicit Places using invariants in 691 ms returned [110, 165, 167, 339, 465, 642, 724, 823, 1010, 1013]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 692 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1292 places, 512/768 transitions.
Applied a total of 0 rules in 30 ms. Remains 1026 /1026 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 838 ms. Remains : 1026/1292 places, 512/768 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-05
Product exploration explored 100000 steps with 193 reset in 3566 ms.
Product exploration explored 100000 steps with 215 reset in 3854 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 769 steps (0 resets) in 52 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 512/512 transitions.
Applied a total of 0 rules in 34 ms. Remains 1026 /1026 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1026 cols
[2024-05-23 02:50:35] [INFO ] Computed 515 invariants in 12 ms
[2024-05-23 02:50:36] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-23 02:50:36] [INFO ] Invariant cache hit.
[2024-05-23 02:50:37] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2024-05-23 02:50:37] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 02:50:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 1541 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 256/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 1797 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61667 ms. Remains : 1026/1026 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1458 steps (0 resets) in 82 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 200 reset in 3637 ms.
Product exploration explored 100000 steps with 216 reset in 3923 ms.
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 512/512 transitions.
Applied a total of 0 rules in 46 ms. Remains 1026 /1026 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-23 02:51:45] [INFO ] Invariant cache hit.
[2024-05-23 02:51:46] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-23 02:51:46] [INFO ] Invariant cache hit.
[2024-05-23 02:51:47] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
[2024-05-23 02:51:47] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 02:51:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 0.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
timeout
(s567 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 1541 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 256/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 1797 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61716 ms. Remains : 1026/1026 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-05 finished in 141467 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 4 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 229 place count 1292 transition count 539
Reduce places removed 229 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 230 rules applied. Total rules applied 459 place count 1063 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 460 place count 1062 transition count 538
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 460 place count 1062 transition count 525
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 486 place count 1049 transition count 525
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 510 place count 1037 transition count 513
Applied a total of 510 rules in 79 ms. Remains 1037 /1292 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1037 cols
[2024-05-23 02:52:47] [INFO ] Computed 525 invariants in 6 ms
[2024-05-23 02:52:48] [INFO ] Implicit Places using invariants in 695 ms returned [110, 165, 167, 339, 380, 466, 643, 725, 824, 850, 1011, 1014]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 696 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1025/1292 places, 513/768 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 512
Applied a total of 2 rules in 34 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 02:52:48] [INFO ] Computed 513 invariants in 10 ms
[2024-05-23 02:52:49] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-23 02:52:49] [INFO ] Invariant cache hit.
[2024-05-23 02:52:49] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1024/1292 places, 512/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2333 ms. Remains : 1024/1292 places, 512/768 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 2907 ms.
Product exploration explored 100000 steps with 0 reset in 3235 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))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 135 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 34 ms :[(NOT p0)]
RANDOM walk for 3245 steps (0 resets) in 151 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 120 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-23 02:52:56] [INFO ] Invariant cache hit.
[2024-05-23 02:52:57] [INFO ] [Real]Absence check using 511 positive place invariants in 250 ms returned sat
[2024-05-23 02:52:57] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 68 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-768-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLCardinality-06 finished in 10357 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(!p0)||X(F(p1))) U X(p2)))))'
Support contains 3 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-23 02:52:58] [INFO ] Computed 525 invariants in 22 ms
[2024-05-23 02:52:58] [INFO ] Implicit Places using invariants in 792 ms returned [205, 208, 424, 473, 905, 1034, 1066, 1258, 1261]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 793 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1283/1292 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1283 /1283 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 867 ms. Remains : 1283/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-07
Product exploration explored 100000 steps with 286 reset in 3649 ms.
Product exploration explored 100000 steps with 299 reset in 3948 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 p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 419 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2))]
RANDOM walk for 28191 steps (6 resets) in 1003 ms. (28 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0 p2))), (F p2), (F (NOT (OR p1 p0))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 3 factoid took 741 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 768 rows 1283 cols
[2024-05-23 02:53:09] [INFO ] Computed 516 invariants in 9 ms
[2024-05-23 02:53:10] [INFO ] [Real]Absence check using 511 positive place invariants in 272 ms returned sat
[2024-05-23 02:53:10] [INFO ] [Real]Absence check using 511 positive and 5 generalized place invariants in 48 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0 p2))), (F p2), (F (NOT (OR p1 p0))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (AND p0 (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 3 factoid took 837 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-768-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLCardinality-07 finished in 13733 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)) U G((!p0 U X(X(!p0))))))'
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Applied a total of 0 rules in 43 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-23 02:53:11] [INFO ] Computed 525 invariants in 14 ms
[2024-05-23 02:53:12] [INFO ] Implicit Places using invariants in 816 ms returned [134, 205, 208, 424, 473, 575, 803, 905, 1034, 1066, 1258, 1261]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 820 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1292 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 899 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 286 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-09
Product exploration explored 100000 steps with 178 reset in 3488 ms.
Product exploration explored 100000 steps with 177 reset in 3717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 8 states, 17 edges and 1 AP (stutter sensitive) to 8 states, 17 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
RANDOM walk for 1018 steps (0 resets) in 56 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 308 ms. Reduced automaton from 8 states, 17 edges and 1 AP (stutter sensitive) to 8 states, 17 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 296 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:53:21] [INFO ] Computed 513 invariants in 9 ms
[2024-05-23 02:53:22] [INFO ] [Real]Absence check using 511 positive place invariants in 270 ms returned sat
[2024-05-23 02:53:22] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 40 ms returned sat
[2024-05-23 02:53:32] [INFO ] [Real]Absence check using state equation in 9202 ms returned sat
[2024-05-23 02:53:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:53:32] [INFO ] [Nat]Absence check using 511 positive place invariants in 267 ms returned sat
[2024-05-23 02:53:33] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 63 ms returned sat
[2024-05-23 02:53:45] [INFO ] [Nat]Absence check using state equation in 11961 ms returned sat
[2024-05-23 02:53:45] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-23 02:53:47] [INFO ] Added : 10 causal constraints over 2 iterations in 2047 ms. Result :unknown
Could not prove EG p0
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 41 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:53:47] [INFO ] Invariant cache hit.
[2024-05-23 02:53:47] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-23 02:53:47] [INFO ] Invariant cache hit.
[2024-05-23 02:53:49] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30070ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30076ms
Finished structural reductions in LTL mode , in 1 iterations and 31980 ms. Remains : 1280/1280 places, 768/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 8 states, 17 edges and 1 AP (stutter sensitive) to 8 states, 17 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
RANDOM walk for 221 steps (0 resets) in 26 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 8 states, 17 edges and 1 AP (stutter sensitive) to 8 states, 17 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 321 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
[2024-05-23 02:54:20] [INFO ] Invariant cache hit.
[2024-05-23 02:54:21] [INFO ] [Real]Absence check using 511 positive place invariants in 251 ms returned sat
[2024-05-23 02:54:21] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 125 ms returned sat
[2024-05-23 02:54:35] [INFO ] [Real]Absence check using state equation in 14060 ms returned unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 306 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 173 reset in 3476 ms.
Product exploration explored 100000 steps with 172 reset in 3674 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 317 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 1280 transition count 768
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 255 rules in 183 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 02:54:44] [INFO ] Redundant transitions in 9 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:54:44] [INFO ] Computed 513 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 22 ms to minimize.
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 144 ms of which 7 ms to minimize.
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 3 ms to minimize.
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 3 ms to minimize.
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 3 ms to minimize.
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 2 ms to minimize.
[2024-05-23 02:54:55] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 3 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 3 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 3 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 3 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 3 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-23 02:54:56] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-23 02:54:57] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 3 ms to minimize.
[2024-05-23 02:54:57] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-23 02:54:57] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-23 02:54:57] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 20/532 constraints. Problems are: Problem set: 20 solved, 492 unsolved
[2024-05-23 02:55:06] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 3 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 3 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-23 02:55:07] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 3 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 2 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:55:08] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/552 constraints. Problems are: Problem set: 40 solved, 472 unsolved
[2024-05-23 02:55:09] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-23 02:55:10] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 2 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 2 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 4 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD503 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/572 constraints. Problems are: Problem set: 60 solved, 452 unsolved
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:55:11] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:55:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:55:13] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD489 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1279/2048 variables, and 592 constraints, problems are : Problem set: 80 solved, 432 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 80 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 0/0 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 591/1279 variables, 511/511 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 80 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 80/592 constraints. Problems are: Problem set: 80 solved, 432 unsolved
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:55:18] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1279 variables, 20/612 constraints. Problems are: Problem set: 100 solved, 412 unsolved
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-23 02:55:19] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-23 02:55:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-23 02:55:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-23 02:55:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-23 02:55:21] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD153 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1279 variables, 20/632 constraints. Problems are: Problem set: 120 solved, 392 unsolved
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-23 02:55:22] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-23 02:55:23] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-23 02:55:23] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-23 02:55:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1279 variables, 20/652 constraints. Problems are: Problem set: 140 solved, 372 unsolved
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-23 02:55:24] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-23 02:55:25] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1279 variables, 20/672 constraints. Problems are: Problem set: 160 solved, 352 unsolved
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-23 02:55:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-23 02:55:28] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-05-23 02:55:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/1279 variables, 20/692 constraints. Problems are: Problem set: 180 solved, 332 unsolved
[2024-05-23 02:55:31] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-05-23 02:55:31] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-23 02:55:31] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-23 02:55:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-23 02:55:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-05-23 02:55:31] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-23 02:55:32] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1279 variables, 20/712 constraints. Problems are: Problem set: 200 solved, 312 unsolved
[2024-05-23 02:55:35] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-05-23 02:55:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-23 02:55:35] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-05-23 02:55:35] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD290 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-23 02:55:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD303 is UNSAT
[2024-05-23 02:55:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-05-23 02:55:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
[2024-05-23 02:55:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1279 variables, 20/732 constraints. Problems are: Problem set: 220 solved, 292 unsolved
[2024-05-23 02:55:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD311 is UNSAT
[2024-05-23 02:55:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-05-23 02:55:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD314 is UNSAT
[2024-05-23 02:55:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-05-23 02:55:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD326 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD330 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD339 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD345 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD350 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD354 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD359 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD364 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD367 is UNSAT
[2024-05-23 02:55:41] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/1279 variables, 20/752 constraints. Problems are: Problem set: 240 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1279/2048 variables, and 752 constraints, problems are : Problem set: 240 solved, 272 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 0/512 constraints, Known Traps: 240/240 constraints]
After SMT, in 60115ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60120ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1280/1280 places, 528/768 transitions.
Graph (complete) has 2078 edges and 1280 vertex of which 1040 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.4 ms
Discarding 240 places :
Also discarding 0 output transitions
Deduced a syphon composed of 15 places in 1 ms
Applied a total of 1 rules in 43 ms. Remains 1040 /1280 variables (removed 240) and now considering 528/528 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1040/1280 places, 528/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60366 ms. Remains : 1040/1280 places, 528/768 transitions.
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 50 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:55:44] [INFO ] Computed 513 invariants in 20 ms
[2024-05-23 02:55:45] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-05-23 02:55:45] [INFO ] Invariant cache hit.
[2024-05-23 02:55:46] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-23 02:55:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30067ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30072ms
Finished structural reductions in LTL mode , in 1 iterations and 31907 ms. Remains : 1280/1280 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-09 finished in 184470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(F(p1)))) U X(p2)))'
Support contains 5 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-23 02:56:16] [INFO ] Computed 525 invariants in 17 ms
[2024-05-23 02:56:17] [INFO ] Implicit Places using invariants in 813 ms returned [134, 205, 208, 424, 473, 575, 803, 905, 1034, 1066, 1258, 1261]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 815 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1292 places, 768/768 transitions.
Applied a total of 0 rules in 34 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 889 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-13
Product exploration explored 100000 steps with 248 reset in 3601 ms.
Product exploration explored 100000 steps with 241 reset in 3785 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 544 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1297 ms. (30 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
// Phase 1: matrix 768 rows 1280 cols
[2024-05-23 02:56:26] [INFO ] Computed 513 invariants in 7 ms
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 5/2048 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/511 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/1280 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (OR p0 p1 p2)), (G (OR p0 p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR p0 p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 680 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
[2024-05-23 02:56:27] [INFO ] Invariant cache hit.
[2024-05-23 02:56:28] [INFO ] [Real]Absence check using 511 positive place invariants in 252 ms returned sat
[2024-05-23 02:56:28] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 88 ms returned sat
[2024-05-23 02:56:39] [INFO ] [Real]Absence check using state equation in 11667 ms returned sat
[2024-05-23 02:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:56:40] [INFO ] [Nat]Absence check using 511 positive place invariants in 259 ms returned sat
[2024-05-23 02:56:40] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-23 02:56:54] [INFO ] [Nat]Absence check using state equation in 14078 ms returned unknown
Could not prove EG (NOT p2)
Support contains 2 out of 1280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 1280 transition count 517
Reduce places removed 251 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 253 rules applied. Total rules applied 504 place count 1029 transition count 515
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 1027 transition count 515
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 506 place count 1027 transition count 513
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 510 place count 1025 transition count 513
Applied a total of 510 rules in 39 ms. Remains 1025 /1280 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1025 cols
[2024-05-23 02:56:55] [INFO ] Computed 513 invariants in 11 ms
[2024-05-23 02:56:55] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-23 02:56:55] [INFO ] Invariant cache hit.
[2024-05-23 02:56:56] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2024-05-23 02:56:56] [INFO ] Redundant transitions in 3 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-23 02:56:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 511/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 1/1025 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1538 variables, 1025/1538 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 1538 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1025/1025 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 511/1024 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 1/1025 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1538 variables, 1025/1538 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 257/1795 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 1795 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1025/1025 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1025/1280 places, 513/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61614 ms. Remains : 1025/1280 places, 513/768 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 p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 157 steps (0 resets) in 21 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
[2024-05-23 02:57:57] [INFO ] Invariant cache hit.
[2024-05-23 02:57:58] [INFO ] [Real]Absence check using 511 positive place invariants in 229 ms returned sat
[2024-05-23 02:57:58] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 42 ms returned sat
[2024-05-23 02:58:03] [INFO ] [Real]Absence check using state equation in 4733 ms returned sat
[2024-05-23 02:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:58:03] [INFO ] [Nat]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-05-23 02:58:03] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 43 ms returned sat
[2024-05-23 02:58:09] [INFO ] [Nat]Absence check using state equation in 6236 ms returned sat
[2024-05-23 02:58:10] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-23 02:58:13] [INFO ] Added : 10 causal constraints over 2 iterations in 3053 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 975 reset in 4280 ms.
Product exploration explored 100000 steps with 998 reset in 4521 ms.
Support contains 2 out of 1025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1025/1025 places, 513/513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 512
Applied a total of 2 rules in 30 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-23 02:58:22] [INFO ] Computed 513 invariants in 16 ms
[2024-05-23 02:58:22] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-23 02:58:22] [INFO ] Invariant cache hit.
[2024-05-23 02:58:23] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2024-05-23 02:58:23] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-23 02:58:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1025 places, 512/513 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61683 ms. Remains : 1024/1025 places, 512/513 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-13 finished in 187556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Applied a total of 0 rules in 39 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-23 02:59:23] [INFO ] Computed 525 invariants in 17 ms
[2024-05-23 02:59:24] [INFO ] Implicit Places using invariants in 803 ms returned [134, 205, 208, 424, 473, 575, 803, 905, 1034, 1066, 1258, 1261]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 804 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1292 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 881 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-15 finished in 1080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
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(p1))||G(p1)))))'
Found a Shortening insensitive property : CircularTrains-PT-768-LTLCardinality-04
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1292/1292 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 229 place count 1292 transition count 539
Reduce places removed 229 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 230 rules applied. Total rules applied 459 place count 1063 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 460 place count 1062 transition count 538
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 460 place count 1062 transition count 525
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 486 place count 1049 transition count 525
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 510 place count 1037 transition count 513
Applied a total of 510 rules in 70 ms. Remains 1037 /1292 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1037 cols
[2024-05-23 02:59:25] [INFO ] Computed 525 invariants in 10 ms
[2024-05-23 02:59:25] [INFO ] Implicit Places using invariants in 702 ms returned [110, 165, 339, 379, 465, 643, 725, 824, 850, 1014]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 703 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1027/1292 places, 513/768 transitions.
Applied a total of 0 rules in 25 ms. Remains 1027 /1027 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 800 ms. Remains : 1027/1292 places, 513/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-04
Product exploration explored 100000 steps with 62 reset in 3303 ms.
Product exploration explored 100000 steps with 73 reset in 3617 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 358 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 20837 steps (4 resets) in 724 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 550 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 513 rows 1027 cols
[2024-05-23 02:59:34] [INFO ] Computed 515 invariants in 8 ms
[2024-05-23 02:59:35] [INFO ] [Real]Absence check using 511 positive place invariants in 232 ms returned sat
[2024-05-23 02:59:35] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 83 ms returned sat
[2024-05-23 02:59:39] [INFO ] [Real]Absence check using state equation in 4234 ms returned sat
[2024-05-23 02:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:59:40] [INFO ] [Nat]Absence check using 511 positive place invariants in 230 ms returned sat
[2024-05-23 02:59:40] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 30 ms returned sat
[2024-05-23 02:59:54] [INFO ] [Nat]Absence check using state equation in 14353 ms returned unknown
Could not prove EG (NOT p1)
Support contains 5 out of 1027 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1027/1027 places, 513/513 transitions.
Applied a total of 0 rules in 25 ms. Remains 1027 /1027 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 02:59:54] [INFO ] Invariant cache hit.
[2024-05-23 02:59:55] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-23 02:59:55] [INFO ] Invariant cache hit.
[2024-05-23 02:59:56] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 02:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 512/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1027 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1540 variables, 1027/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 1542 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1027/1027 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 512/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1027 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1540 variables, 1027/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 257/1799 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1540 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/1540 variables, and 1799 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1027/1027 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in LTL mode , in 1 iterations and 61657 ms. Remains : 1027/1027 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 510 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 13460 steps (2 resets) in 471 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 568 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-23 03:00:58] [INFO ] Invariant cache hit.
[2024-05-23 03:00:59] [INFO ] [Real]Absence check using 511 positive place invariants in 218 ms returned sat
[2024-05-23 03:00:59] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 64 ms returned sat
[2024-05-23 03:01:03] [INFO ] [Real]Absence check using state equation in 4052 ms returned sat
[2024-05-23 03:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:01:04] [INFO ] [Nat]Absence check using 511 positive place invariants in 225 ms returned sat
[2024-05-23 03:01:04] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-23 03:01:13] [INFO ] [Nat]Absence check using state equation in 8794 ms returned sat
[2024-05-23 03:01:13] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-23 03:01:18] [INFO ] Added : 30 causal constraints over 6 iterations in 5516 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 51 reset in 3163 ms.
Product exploration explored 100000 steps with 76 reset in 3532 ms.
Support contains 5 out of 1027 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1027/1027 places, 513/513 transitions.
Applied a total of 0 rules in 27 ms. Remains 1027 /1027 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-23 03:01:25] [INFO ] Invariant cache hit.
[2024-05-23 03:01:26] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-23 03:01:26] [INFO ] Invariant cache hit.
[2024-05-23 03:01:27] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 03:01:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 512/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1027 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1540 variables, 1027/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 1542 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1027/1027 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 512/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1027 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1540 variables, 1027/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 257/1799 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1540 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/1540 variables, and 1799 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1027/1027 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 61589 ms. Remains : 1027/1027 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-04 finished in 182274 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)))'
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)) U G((!p0 U X(X(!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' '!((F((p0||G(F(p1)))) U X(p2)))'
[2024-05-23 03:02:27] [INFO ] Flatten gal took : 39 ms
[2024-05-23 03:02:27] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 03:02:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1292 places, 768 transitions and 2584 arcs took 7 ms.
Total runtime 1103368 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CircularTrains-PT-768

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1292
TRANSITIONS: 768
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.006s]


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


----------------------------------------------------------------------
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: 3317
MODEL NAME: /home/mcc/execution/403/model
1292 places, 768 transitions.

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.
Building monolithic NSF...
FORMULA CircularTrains-PT-768-LTLCardinality-00 CANNOT_COMPUTE
FORMULA CircularTrains-PT-768-LTLCardinality-04 CANNOT_COMPUTE
FORMULA CircularTrains-PT-768-LTLCardinality-05 CANNOT_COMPUTE
FORMULA CircularTrains-PT-768-LTLCardinality-09 CANNOT_COMPUTE
FORMULA CircularTrains-PT-768-LTLCardinality-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716434113043

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CircularTrains-PT-768"
export BK_EXAMINATION="LTLCardinality"
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 CircularTrains-PT-768, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504400371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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