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.r070-tall-171620505700371.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 itstools
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 r070-tall-171620505700371
=====================================================================

--------------------
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 1716289670150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 11:07:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 11:07:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:07:51] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-21 11:07:51] [INFO ] Transformed 1536 places.
[2024-05-21 11:07:51] [INFO ] Transformed 768 transitions.
[2024-05-21 11:07:51] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 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 157 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-05-21 11:07:52] [INFO ] Computed 769 invariants in 82 ms
[2024-05-21 11:07:53] [INFO ] Implicit Places using invariants in 1562 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 1603 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 148 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 1926 ms. Remains : 1292/1536 places, 768/768 transitions.
Support contains 51 out of 1292 places after structural reductions.
[2024-05-21 11:07:53] [INFO ] Flatten gal took : 99 ms
[2024-05-21 11:07:54] [INFO ] Flatten gal took : 67 ms
[2024-05-21 11:07:54] [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 3673 ms. (10 steps per ms) remains 7/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 7/7 properties
// Phase 1: matrix 768 rows 1292 cols
[2024-05-21 11:07:56] [INFO ] Computed 525 invariants in 43 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 125 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 200ms 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 276 ms. Remains 1038 /1292 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1038 cols
[2024-05-21 11:07:56] [INFO ] Computed 525 invariants in 6 ms
[2024-05-21 11:07:57] [INFO ] Implicit Places using invariants in 771 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 775 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 36 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 1087 ms. Remains : 1026/1292 places, 514/768 transitions.
Stuttering acceptance computed with spot in 169 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 1400 reset in 4060 ms.
Product exploration explored 100000 steps with 1427 reset in 4211 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 340 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 774 steps (0 resets) in 52 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 416 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 514 rows 1026 cols
[2024-05-21 11:08:07] [INFO ] Computed 513 invariants in 8 ms
[2024-05-21 11:08:08] [INFO ] [Real]Absence check using 511 positive place invariants in 216 ms returned sat
[2024-05-21 11:08:08] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-21 11:08:18] [INFO ] [Real]Absence check using state equation in 9727 ms returned sat
[2024-05-21 11:08:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:08:18] [INFO ] [Nat]Absence check using 511 positive place invariants in 223 ms returned sat
[2024-05-21 11:08:18] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 65 ms returned sat
[2024-05-21 11:08:33] [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 48 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-05-21 11:08:33] [INFO ] Invariant cache hit.
[2024-05-21 11:08:33] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-05-21 11:08:33] [INFO ] Invariant cache hit.
[2024-05-21 11:08:34] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-05-21 11:08:34] [INFO ] Redundant transitions in 23 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-21 11:08:34] [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
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 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]
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 30016 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 60109ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61728 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 379 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 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 852 steps (0 resets) in 57 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 508 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 11:09:36] [INFO ] Invariant cache hit.
[2024-05-21 11:09:37] [INFO ] [Real]Absence check using 511 positive place invariants in 220 ms returned sat
[2024-05-21 11:09:37] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 37 ms returned sat
[2024-05-21 11:09:41] [INFO ] [Real]Absence check using state equation in 4887 ms returned sat
[2024-05-21 11:09:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:09:42] [INFO ] [Nat]Absence check using 511 positive place invariants in 209 ms returned sat
[2024-05-21 11:09:42] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-21 11:09:49] [INFO ] [Nat]Absence check using state equation in 6372 ms returned sat
[2024-05-21 11:09:49] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-21 11:09:55] [INFO ] Added : 25 causal constraints over 5 iterations in 6695 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1423 reset in 3879 ms.
Product exploration explored 100000 steps with 1430 reset in 4199 ms.
Built C files in :
/tmp/ltsmin5942611981504995474
[2024-05-21 11:10:04] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-21 11:10:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:10:04] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-21 11:10:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:10:04] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-21 11:10:04] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:10:04] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5942611981504995474
Running compilation step : cd /tmp/ltsmin5942611981504995474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1720 ms.
Running link step : cd /tmp/ltsmin5942611981504995474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5942611981504995474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17203827030868754749.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 39 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-05-21 11:10:19] [INFO ] Invariant cache hit.
[2024-05-21 11:10:19] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-05-21 11:10:19] [INFO ] Invariant cache hit.
[2024-05-21 11:10:20] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2024-05-21 11:10:20] [INFO ] Redundant transitions in 10 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-21 11:10:20] [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
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 30014 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 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]
After SMT, in 60063ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61661 ms. Remains : 1026/1026 places, 514/514 transitions.
Built C files in :
/tmp/ltsmin8708458250881206111
[2024-05-21 11:11:20] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-21 11:11:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:11:20] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-21 11:11:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:11:20] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2024-05-21 11:11:20] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:11:20] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8708458250881206111
Running compilation step : cd /tmp/ltsmin8708458250881206111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1559 ms.
Running link step : cd /tmp/ltsmin8708458250881206111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8708458250881206111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11371766374068167353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:11:35] [INFO ] Flatten gal took : 30 ms
[2024-05-21 11:11:35] [INFO ] Flatten gal took : 29 ms
[2024-05-21 11:11:35] [INFO ] Time to serialize gal into /tmp/LTL1651759636137083410.gal : 8 ms
[2024-05-21 11:11:35] [INFO ] Time to serialize properties into /tmp/LTL17669245732390218195.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1651759636137083410.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5303722456807188374.hoa' '-atoms' '/tmp/LTL17669245732390218195.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17669245732390218195.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5303722456807188374.hoa
Detected timeout of ITS tools.
[2024-05-21 11:11:50] [INFO ] Flatten gal took : 27 ms
[2024-05-21 11:11:51] [INFO ] Flatten gal took : 29 ms
[2024-05-21 11:11:51] [INFO ] Time to serialize gal into /tmp/LTL8323207993956348075.gal : 6 ms
[2024-05-21 11:11:51] [INFO ] Time to serialize properties into /tmp/LTL17416338843905050925.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8323207993956348075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17416338843905050925.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(F487<=Section_503)")||(G(F("((Section_202>=1)||(Section_214>=3))"))))))
Formula 0 simplified : G(!"(F487<=Section_503)" & FG!"((Section_202>=1)||(Section_214>=3))")
Detected timeout of ITS tools.
[2024-05-21 11:12:06] [INFO ] Flatten gal took : 25 ms
[2024-05-21 11:12:06] [INFO ] Applying decomposition
[2024-05-21 11:12:06] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14907954989632360535.txt' '-o' '/tmp/graph14907954989632360535.bin' '-w' '/tmp/graph14907954989632360535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14907954989632360535.bin' '-l' '-1' '-v' '-w' '/tmp/graph14907954989632360535.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:12:06] [INFO ] Decomposing Gal with order
[2024-05-21 11:12:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:12:06] [INFO ] Flatten gal took : 68 ms
[2024-05-21 11:12:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 11:12:06] [INFO ] Time to serialize gal into /tmp/LTL17401401393457406548.gal : 11 ms
[2024-05-21 11:12:06] [INFO ] Time to serialize properties into /tmp/LTL2764183077362108605.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17401401393457406548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2764183077362108605.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(gu131.F487<=gu131.Section_503)")||(G(F("((gi1.gi1.gi1.gi0.gi1.gi1.gu229.Section_202>=1)||(gi1.gi1.gi1.gi0.gi0.gi1.gu366.Sectio...172
Formula 0 simplified : G(!"(gu131.F487<=gu131.Section_503)" & FG!"((gi1.gi1.gi1.gi0.gi1.gi1.gu229.Section_202>=1)||(gi1.gi1.gi1.gi0.gi0.gi1.gu366.Section_2...164
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLCardinality-00 finished in 265258 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 41 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-21 11:12:21] [INFO ] Computed 525 invariants in 14 ms
[2024-05-21 11:12:22] [INFO ] Implicit Places using invariants in 843 ms returned [134, 205, 424, 473, 575, 803, 905, 1034, 1066, 1261]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 855 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 37 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 933 ms. Remains : 1282/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 124 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 22 reset in 2755 ms.
Product exploration explored 100000 steps with 20 reset in 3068 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 235 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 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 12765 steps (2 resets) in 419 ms. (30 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 518 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 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 768 rows 1282 cols
[2024-05-21 11:12:30] [INFO ] Computed 515 invariants in 10 ms
[2024-05-21 11:12:31] [INFO ] [Real]Absence check using 511 positive place invariants in 251 ms returned sat
[2024-05-21 11:12:31] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 33 ms returned sat
[2024-05-21 11:12:40] [INFO ] [Real]Absence check using state equation in 8979 ms returned sat
[2024-05-21 11:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:12:41] [INFO ] [Nat]Absence check using 511 positive place invariants in 247 ms returned sat
[2024-05-21 11:12:41] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 114 ms returned sat
[2024-05-21 11:12:52] [INFO ] [Nat]Absence check using state equation in 11280 ms returned sat
[2024-05-21 11:12:52] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-21 11:12:55] [INFO ] Added : 10 causal constraints over 2 iterations in 2736 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 47 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:12:55] [INFO ] Invariant cache hit.
[2024-05-21 11:12:56] [INFO ] Implicit Places using invariants in 798 ms returned []
[2024-05-21 11:12:56] [INFO ] Invariant cache hit.
[2024-05-21 11:12:57] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:12:57] [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
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 30016 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 30020 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 60121ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 62111 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 282 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 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 28097 steps (6 resets) in 1198 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 381 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 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-21 11:13:59] [INFO ] Invariant cache hit.
[2024-05-21 11:14:00] [INFO ] [Real]Absence check using 511 positive place invariants in 255 ms returned sat
[2024-05-21 11:14:00] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 90 ms returned sat
[2024-05-21 11:14:09] [INFO ] [Real]Absence check using state equation in 9036 ms returned sat
[2024-05-21 11:14:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:14:10] [INFO ] [Nat]Absence check using 511 positive place invariants in 240 ms returned sat
[2024-05-21 11:14:10] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 45 ms returned sat
[2024-05-21 11:14:11] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2024-05-21 11:14:11] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 37 ms.
[2024-05-21 11:14:16] [INFO ] Added : 15 causal constraints over 3 iterations in 5304 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22 reset in 2653 ms.
Product exploration explored 100000 steps with 20 reset in 2948 ms.
Built C files in :
/tmp/ltsmin2826834166822052921
[2024-05-21 11:14:22] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2826834166822052921
Running compilation step : cd /tmp/ltsmin2826834166822052921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1785 ms.
Running link step : cd /tmp/ltsmin2826834166822052921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2826834166822052921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16191749878607933585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 47 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:14:37] [INFO ] Invariant cache hit.
[2024-05-21 11:14:38] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-05-21 11:14:38] [INFO ] Invariant cache hit.
[2024-05-21 11:14:39] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:14:39] [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
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30077ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30083ms
Finished structural reductions in LTL mode , in 1 iterations and 32006 ms. Remains : 1282/1282 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin13605577623391241011
[2024-05-21 11:15:09] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13605577623391241011
Running compilation step : cd /tmp/ltsmin13605577623391241011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1614 ms.
Running link step : cd /tmp/ltsmin13605577623391241011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13605577623391241011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5420512661456773423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:15:24] [INFO ] Flatten gal took : 44 ms
[2024-05-21 11:15:24] [INFO ] Flatten gal took : 34 ms
[2024-05-21 11:15:24] [INFO ] Time to serialize gal into /tmp/LTL9499723102779027269.gal : 5 ms
[2024-05-21 11:15:24] [INFO ] Time to serialize properties into /tmp/LTL18015228215822990138.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9499723102779027269.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17063901291157600597.hoa' '-atoms' '/tmp/LTL18015228215822990138.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18015228215822990138.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17063901291157600597.hoa
Detected timeout of ITS tools.
[2024-05-21 11:15:39] [INFO ] Flatten gal took : 27 ms
[2024-05-21 11:15:39] [INFO ] Flatten gal took : 26 ms
[2024-05-21 11:15:39] [INFO ] Time to serialize gal into /tmp/LTL13515517516542222704.gal : 5 ms
[2024-05-21 11:15:39] [INFO ] Time to serialize properties into /tmp/LTL17465142188271613841.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13515517516542222704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17465142188271613841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(F327>F92)"))||((X("(F327>F92)"))&&("((Section_762>Section_172)||(F668<2))"))))))
Formula 0 simplified : G(F!"(F327>F92)" & FG(!"((Section_762>Section_172)||(F668<2))" | X!"(F327>F92)"))
Detected timeout of ITS tools.
[2024-05-21 11:15:54] [INFO ] Flatten gal took : 26 ms
[2024-05-21 11:15:54] [INFO ] Applying decomposition
[2024-05-21 11:15:54] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8752516394761829575.txt' '-o' '/tmp/graph8752516394761829575.bin' '-w' '/tmp/graph8752516394761829575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8752516394761829575.bin' '-l' '-1' '-v' '-w' '/tmp/graph8752516394761829575.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:15:55] [INFO ] Decomposing Gal with order
[2024-05-21 11:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:15:55] [INFO ] Flatten gal took : 32 ms
[2024-05-21 11:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 11:15:55] [INFO ] Time to serialize gal into /tmp/LTL8034156716939930368.gal : 6 ms
[2024-05-21 11:15:55] [INFO ] Time to serialize properties into /tmp/LTL14498862646951263833.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8034156716939930368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14498862646951263833.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(gu51.F327>gu51.F92)"))||((X("(gu51.F327>gu51.F92)"))&&("((gu72.Section_762>gu72.Section_172)||(gi4.gu5.F668<2))"))))))
Formula 0 simplified : G(F!"(gu51.F327>gu51.F92)" & FG(!"((gu72.Section_762>gu72.Section_172)||(gi4.gu5.F668<2))" | X!"(gu51.F327>gu51.F92)"))
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLCardinality-04 finished in 228475 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 0 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 78 ms. Remains 1036 /1292 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1036 cols
[2024-05-21 11:16:10] [INFO ] Computed 525 invariants in 15 ms
[2024-05-21 11:16:11] [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 693 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 39 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 811 ms. Remains : 1026/1292 places, 512/768 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-05
Product exploration explored 100000 steps with 177 reset in 3104 ms.
Product exploration explored 100000 steps with 165 reset in 3395 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 175 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 p0), (NOT p0)]
RANDOM walk for 797 steps (0 resets) in 61 ms. (12 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 206 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 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 33 ms. Remains 1026 /1026 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1026 cols
[2024-05-21 11:16:18] [INFO ] Computed 515 invariants in 13 ms
[2024-05-21 11:16:19] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-21 11:16:19] [INFO ] Invariant cache hit.
[2024-05-21 11:16:20] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
[2024-05-21 11:16:20] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 11:16:20] [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 30015 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 30019 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 60066ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61607 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 156 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 1223 steps (0 resets) in 49 ms. (24 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 185 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 179 reset in 3041 ms.
Product exploration explored 100000 steps with 191 reset in 3405 ms.
Built C files in :
/tmp/ltsmin3864279752701556502
[2024-05-21 11:17:27] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-21 11:17:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:17:27] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-21 11:17:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:17:27] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-21 11:17:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:17:27] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3864279752701556502
Running compilation step : cd /tmp/ltsmin3864279752701556502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1496 ms.
Running link step : cd /tmp/ltsmin3864279752701556502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3864279752701556502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5637959337478219002.hoa' '--buchi-type=spotba'
LTSmin run took 13323 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLCardinality-05 finished in 92605 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 86 ms. Remains 1037 /1292 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1037 cols
[2024-05-21 11:17:42] [INFO ] Computed 525 invariants in 10 ms
[2024-05-21 11:17:43] [INFO ] Implicit Places using invariants in 728 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 730 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 33 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-05-21 11:17:43] [INFO ] Computed 513 invariants in 12 ms
[2024-05-21 11:17:44] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-21 11:17:44] [INFO ] Invariant cache hit.
[2024-05-21 11:17:45] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1563 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 2413 ms. Remains : 1024/1292 places, 512/768 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 2601 ms.
Product exploration explored 100000 steps with 0 reset in 3053 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 147 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 47 ms :[(NOT p0)]
RANDOM walk for 9502 steps (1 resets) in 301 ms. (31 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 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-21 11:17:52] [INFO ] Invariant cache hit.
[2024-05-21 11:17:52] [INFO ] [Real]Absence check using 511 positive place invariants in 248 ms returned sat
[2024-05-21 11:17:52] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 67 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 179 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 10064 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 42 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-21 11:17:52] [INFO ] Computed 525 invariants in 14 ms
[2024-05-21 11:17:53] [INFO ] Implicit Places using invariants in 742 ms returned [205, 208, 424, 473, 905, 1034, 1066, 1258, 1261]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 743 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 35 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 820 ms. Remains : 1283/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 328 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 274 reset in 3121 ms.
Product exploration explored 100000 steps with 284 reset in 3394 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 331 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 314 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 32274 steps (6 resets) in 1111 ms. (29 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 672 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 337 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 308 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-21 11:18:03] [INFO ] Computed 516 invariants in 15 ms
[2024-05-21 11:18:04] [INFO ] [Real]Absence check using 511 positive place invariants in 251 ms returned sat
[2024-05-21 11:18:04] [INFO ] [Real]Absence check using 511 positive and 5 generalized place invariants in 45 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 718 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 12129 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 44 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-21 11:18:05] [INFO ] Computed 525 invariants in 9 ms
[2024-05-21 11:18:05] [INFO ] Implicit Places using invariants in 790 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 792 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 872 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 283 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 175 reset in 3003 ms.
Product exploration explored 100000 steps with 175 reset in 3311 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 166 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 308 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
RANDOM walk for 390 steps (0 resets) in 25 ms. (15 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 195 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 284 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:18:14] [INFO ] Computed 513 invariants in 14 ms
[2024-05-21 11:18:15] [INFO ] [Real]Absence check using 511 positive place invariants in 247 ms returned sat
[2024-05-21 11:18:15] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 37 ms returned sat
[2024-05-21 11:18:23] [INFO ] [Real]Absence check using state equation in 8560 ms returned sat
[2024-05-21 11:18:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:18:24] [INFO ] [Nat]Absence check using 511 positive place invariants in 246 ms returned sat
[2024-05-21 11:18:24] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 59 ms returned sat
[2024-05-21 11:18:35] [INFO ] [Nat]Absence check using state equation in 11289 ms returned sat
[2024-05-21 11:18:35] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-21 11:18:38] [INFO ] Added : 15 causal constraints over 3 iterations in 2797 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 33 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:18:38] [INFO ] Invariant cache hit.
[2024-05-21 11:18:39] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-05-21 11:18:39] [INFO ] Invariant cache hit.
[2024-05-21 11:18:40] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:18:40] [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 30079ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30087ms
Finished structural reductions in LTL mode , in 1 iterations and 31898 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 207 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 310 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
RANDOM walk for 317 steps (0 resets) in 31 ms. (9 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 229 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 309 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
[2024-05-21 11:19:12] [INFO ] Invariant cache hit.
[2024-05-21 11:19:13] [INFO ] [Real]Absence check using 511 positive place invariants in 252 ms returned sat
[2024-05-21 11:19:13] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 124 ms returned sat
[2024-05-21 11:19:27] [INFO ] [Real]Absence check using state equation in 14087 ms returned unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 300 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 178 reset in 3025 ms.
Product exploration explored 100000 steps with 167 reset in 3302 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 287 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 184 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-21 11:19:34] [INFO ] Redundant transitions in 8 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:19:34] [INFO ] Computed 513 invariants in 10 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-21 11:19:45] [INFO ] Deduced a trap composed of 2 places in 144 ms of which 20 ms to minimize.
[2024-05-21 11:19:45] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 4 ms to minimize.
[2024-05-21 11:19:45] [INFO ] Deduced a trap composed of 2 places in 132 ms of which 2 ms to minimize.
[2024-05-21 11:19:45] [INFO ] Deduced a trap composed of 2 places in 117 ms of which 6 ms to minimize.
[2024-05-21 11:19:45] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 2 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 2 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 2 places in 111 ms of which 2 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 2 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 3 ms to minimize.
[2024-05-21 11:19:46] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 95 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 2 ms to minimize.
[2024-05-21 11:19:47] [INFO ] Deduced a trap composed of 2 places in 94 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-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 2 ms to minimize.
[2024-05-21 11:19:57] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 2 ms to minimize.
[2024-05-21 11:19:59] [INFO ] Deduced a trap composed of 2 places in 68 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-21 11:19:59] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 2 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-21 11:20:00] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 2 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 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-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 2 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 2 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-21 11:20:01] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-21 11:20:02] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 11:20:02] [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
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 30021 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-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 11:20:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 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-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 11:20:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 11:20:11] [INFO ] Deduced a trap composed of 2 places in 24 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-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 11:20:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 11:20:13] [INFO ] Deduced a trap composed of 2 places in 18 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-21 11:20:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 11:20:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-21 11:20:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 11:20:14] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-21 11:20:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
[2024-05-21 11:20:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-21 11:20:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-21 11:20:16] [INFO ] Deduced a trap composed of 2 places in 20 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-21 11:20:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-21 11:20:17] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD179 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 11:20:18] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-21 11:20:19] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-21 11:20:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD199 is UNSAT
[2024-05-21 11:20:19] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-21 11:20:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-21 11:20:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-05-21 11:20:19] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 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-21 11:20:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-05-21 11:20:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-21 11:20:22] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-21 11:20:23] [INFO ] Deduced a trap composed of 2 places in 15 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-21 11:20:25] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD257 is UNSAT
[2024-05-21 11:20:25] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD290 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD296 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-21 11:20:26] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD303 is UNSAT
[2024-05-21 11:20:27] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD305 is UNSAT
[2024-05-21 11:20:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD308 is UNSAT
[2024-05-21 11:20:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 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-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD311 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD312 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD314 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD326 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD330 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-05-21 11:20:30] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD339 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD345 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD346 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD350 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD354 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD356 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD359 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD364 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD365 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD367 is UNSAT
[2024-05-21 11:20:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 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 30008 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 60103ms problems are : Problem set: 240 solved, 272 unsolved
Search for dead transitions found 240 dead transitions in 60109ms
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 47 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 60357 ms. Remains : 1040/1280 places, 528/768 transitions.
Built C files in :
/tmp/ltsmin9440370362242860140
[2024-05-21 11:20:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9440370362242860140
Running compilation step : cd /tmp/ltsmin9440370362242860140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1649 ms.
Running link step : cd /tmp/ltsmin9440370362242860140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9440370362242860140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14624184141698285681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 40 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:20:50] [INFO ] Computed 513 invariants in 12 ms
[2024-05-21 11:20:50] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-21 11:20:50] [INFO ] Invariant cache hit.
[2024-05-21 11:20:51] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-05-21 11:20:51] [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 "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30086ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30091ms
Finished structural reductions in LTL mode , in 1 iterations and 32008 ms. Remains : 1280/1280 places, 768/768 transitions.
Built C files in :
/tmp/ltsmin13352285280417986067
[2024-05-21 11:21:22] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13352285280417986067
Running compilation step : cd /tmp/ltsmin13352285280417986067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1638 ms.
Running link step : cd /tmp/ltsmin13352285280417986067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13352285280417986067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9222477930974493982.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:21:37] [INFO ] Flatten gal took : 22 ms
[2024-05-21 11:21:37] [INFO ] Flatten gal took : 23 ms
[2024-05-21 11:21:37] [INFO ] Time to serialize gal into /tmp/LTL2791995959251035145.gal : 4 ms
[2024-05-21 11:21:37] [INFO ] Time to serialize properties into /tmp/LTL11595369274884999644.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2791995959251035145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12459058265072393517.hoa' '-atoms' '/tmp/LTL11595369274884999644.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11595369274884999644.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12459058265072393517.hoa
Detected timeout of ITS tools.
[2024-05-21 11:21:52] [INFO ] Flatten gal took : 22 ms
[2024-05-21 11:21:52] [INFO ] Flatten gal took : 23 ms
[2024-05-21 11:21:52] [INFO ] Time to serialize gal into /tmp/LTL2701652018845007204.gal : 4 ms
[2024-05-21 11:21:52] [INFO ] Time to serialize properties into /tmp/LTL1446327583383024577.ltl : 61 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2701652018845007204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1446327583383024577.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("(F172>Section_427)")))U(G(("(F172<=Section_427)")U(X(X("(F172<=Section_427)")))))))
Formula 0 simplified : FG!"(F172>Section_427)" R F(!"(F172<=Section_427)" R XX!"(F172<=Section_427)")
Detected timeout of ITS tools.
[2024-05-21 11:22:07] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:22:07] [INFO ] Applying decomposition
[2024-05-21 11:22:07] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4057835664618113115.txt' '-o' '/tmp/graph4057835664618113115.bin' '-w' '/tmp/graph4057835664618113115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4057835664618113115.bin' '-l' '-1' '-v' '-w' '/tmp/graph4057835664618113115.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:22:07] [INFO ] Decomposing Gal with order
[2024-05-21 11:22:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:22:07] [INFO ] Flatten gal took : 41 ms
[2024-05-21 11:22:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:22:07] [INFO ] Time to serialize gal into /tmp/LTL14235704706271826998.gal : 8 ms
[2024-05-21 11:22:07] [INFO ] Time to serialize properties into /tmp/LTL615051355743103055.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14235704706271826998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL615051355743103055.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("(gu67.F172>gu67.Section_427)")))U(G(("(gu67.F172<=gu67.Section_427)")U(X(X("(gu67.F172<=gu67.Section_427)")))))))
Formula 0 simplified : FG!"(gu67.F172>gu67.Section_427)" R F(!"(gu67.F172<=gu67.Section_427)" R XX!"(gu67.F172<=gu67.Section_427)")
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-768-LTLCardinality-09 finished in 257739 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 42 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-05-21 11:22:22] [INFO ] Computed 525 invariants in 12 ms
[2024-05-21 11:22:23] [INFO ] Implicit Places using invariants in 782 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 783 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 859 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 175 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 250 reset in 3125 ms.
Product exploration explored 100000 steps with 235 reset in 3409 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 618 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 198 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 1531 ms. (26 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
// Phase 1: matrix 768 rows 1280 cols
[2024-05-21 11:22:32] [INFO ] Computed 513 invariants in 13 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 17 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 41ms 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 697 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 80 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
[2024-05-21 11:22:33] [INFO ] Invariant cache hit.
[2024-05-21 11:22:34] [INFO ] [Real]Absence check using 511 positive place invariants in 254 ms returned sat
[2024-05-21 11:22:34] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 76 ms returned sat
[2024-05-21 11:22:45] [INFO ] [Real]Absence check using state equation in 11058 ms returned sat
[2024-05-21 11:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:22:46] [INFO ] [Nat]Absence check using 511 positive place invariants in 252 ms returned sat
[2024-05-21 11:22:46] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-21 11:23:00] [INFO ] [Nat]Absence check using state equation in 14100 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 45 ms. Remains 1025 /1280 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1025 cols
[2024-05-21 11:23:00] [INFO ] Computed 513 invariants in 5 ms
[2024-05-21 11:23:00] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-21 11:23:00] [INFO ] Invariant cache hit.
[2024-05-21 11:23:01] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2024-05-21 11:23:01] [INFO ] Redundant transitions in 3 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 11:23:01] [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 "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 1538/1538 variables, and 1538 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 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 30021 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 60071ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
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 61607 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 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 62 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 185 steps (0 resets) in 17 ms. (10 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 146 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 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
[2024-05-21 11:24:02] [INFO ] Invariant cache hit.
[2024-05-21 11:24:03] [INFO ] [Real]Absence check using 511 positive place invariants in 228 ms returned sat
[2024-05-21 11:24:03] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-21 11:24:08] [INFO ] [Real]Absence check using state equation in 4537 ms returned sat
[2024-05-21 11:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:24:08] [INFO ] [Nat]Absence check using 511 positive place invariants in 192 ms returned sat
[2024-05-21 11:24:08] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 39 ms returned sat
[2024-05-21 11:24:14] [INFO ] [Nat]Absence check using state equation in 5990 ms returned sat
[2024-05-21 11:24:14] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-21 11:24:18] [INFO ] Added : 10 causal constraints over 2 iterations in 3419 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1027 reset in 3812 ms.
Product exploration explored 100000 steps with 946 reset in 4090 ms.
Built C files in :
/tmp/ltsmin8926255232495216840
[2024-05-21 11:24:26] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-21 11:24:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:24:26] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-21 11:24:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:24:26] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-21 11:24:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:24:26] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8926255232495216840
Running compilation step : cd /tmp/ltsmin8926255232495216840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1507 ms.
Running link step : cd /tmp/ltsmin8926255232495216840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8926255232495216840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5594492984978863373.hoa' '--buchi-type=spotba'
LTSmin run took 10815 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLCardinality-13 finished in 135772 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 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-21 11:24:38] [INFO ] Computed 525 invariants in 17 ms
[2024-05-21 11:24:39] [INFO ] Implicit Places using invariants in 763 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 767 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 842 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 183 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 1 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-15 finished in 1054 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 123 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 69 ms. Remains 1037 /1292 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1037 cols
[2024-05-21 11:24:40] [INFO ] Computed 525 invariants in 14 ms
[2024-05-21 11:24:40] [INFO ] Implicit Places using invariants in 668 ms returned [110, 165, 339, 379, 465, 643, 725, 824, 850, 1014]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 669 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 24 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 764 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 67 reset in 2873 ms.
Product exploration explored 100000 steps with 87 reset in 3250 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 531 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 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 18431 steps (3 resets) in 576 ms. (31 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 661 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 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 513 rows 1027 cols
[2024-05-21 11:24:49] [INFO ] Computed 515 invariants in 11 ms
[2024-05-21 11:24:49] [INFO ] [Real]Absence check using 511 positive place invariants in 237 ms returned sat
[2024-05-21 11:24:49] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 86 ms returned sat
[2024-05-21 11:24:54] [INFO ] [Real]Absence check using state equation in 4250 ms returned sat
[2024-05-21 11:24:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:24:54] [INFO ] [Nat]Absence check using 511 positive place invariants in 224 ms returned sat
[2024-05-21 11:24:54] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 30 ms returned sat
[2024-05-21 11:25:09] [INFO ] [Nat]Absence check using state equation in 14370 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-21 11:25:09] [INFO ] Invariant cache hit.
[2024-05-21 11:25:09] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-21 11:25:09] [INFO ] Invariant cache hit.
[2024-05-21 11:25:10] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 11:25:10] [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 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]
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 60061ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in LTL mode , in 1 iterations and 61599 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 325 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 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 12231 steps (2 resets) in 430 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 542 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 218 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-21 11:26:12] [INFO ] Invariant cache hit.
[2024-05-21 11:26:13] [INFO ] [Real]Absence check using 511 positive place invariants in 218 ms returned sat
[2024-05-21 11:26:13] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 66 ms returned sat
[2024-05-21 11:26:17] [INFO ] [Real]Absence check using state equation in 3926 ms returned sat
[2024-05-21 11:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:26:18] [INFO ] [Nat]Absence check using 511 positive place invariants in 222 ms returned sat
[2024-05-21 11:26:18] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-21 11:26:26] [INFO ] [Nat]Absence check using state equation in 8342 ms returned sat
[2024-05-21 11:26:26] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-21 11:26:32] [INFO ] Added : 35 causal constraints over 7 iterations in 5989 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 84 reset in 2920 ms.
Product exploration explored 100000 steps with 56 reset in 3147 ms.
Built C files in :
/tmp/ltsmin14447109347399603210
[2024-05-21 11:26:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14447109347399603210
Running compilation step : cd /tmp/ltsmin14447109347399603210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1140 ms.
Running link step : cd /tmp/ltsmin14447109347399603210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14447109347399603210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6026948953548689414.hoa' '--buchi-type=spotba'
LTSmin run took 11949 ms.
Treatment of property CircularTrains-PT-768-LTLCardinality-04 finished in 132249 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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))))))'
[2024-05-21 11:26:52] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1235839172030708549
[2024-05-21 11:26:52] [INFO ] Computing symmetric may disable matrix : 768 transitions.
[2024-05-21 11:26:52] [INFO ] Applying decomposition
[2024-05-21 11:26:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:26:52] [INFO ] Computing symmetric may enable matrix : 768 transitions.
[2024-05-21 11:26:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:26:52] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16205505151694650053.txt' '-o' '/tmp/graph16205505151694650053.bin' '-w' '/tmp/graph16205505151694650053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16205505151694650053.bin' '-l' '-1' '-v' '-w' '/tmp/graph16205505151694650053.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:26:52] [INFO ] Decomposing Gal with order
[2024-05-21 11:26:52] [INFO ] Computing Do-Not-Accords matrix : 768 transitions.
[2024-05-21 11:26:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:26:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:26:52] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1235839172030708549
Running compilation step : cd /tmp/ltsmin1235839172030708549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 11:26:52] [INFO ] Flatten gal took : 27 ms
[2024-05-21 11:26:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:26:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality12372121702020322237.gal : 6 ms
[2024-05-21 11:26:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality9441735895407064095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12372121702020322237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9441735895407064095.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(("(gu103.F487<=gu103.Section_503)")||(G(F("((gi0.gi1.gi2.gi2.gi0.gu145.Section_202>=1)||(gi0.gi1.gi2.gi3.gi0.gu32.Section_214>=3)...163
Formula 0 simplified : G(!"(gu103.F487<=gu103.Section_503)" & FG!"((gi0.gi1.gi2.gi2.gi0.gu145.Section_202>=1)||(gi0.gi1.gi2.gi3.gi0.gu32.Section_214>=3))")
Compilation finished in 2519 ms.
Running link step : cd /tmp/ltsmin1235839172030708549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin1235839172030708549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 113641 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1235839172030708549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp2==true)&&X((LTLAPp3==true)))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 18744 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1235839172030708549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp4==true))) U []((!(LTLAPp4==true) U X(X(!(LTLAPp4==true))))))' '--buchi-type=spotba'
LTSmin run took 21700 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1297701 ms.

BK_STOP 1716290969017

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r070-tall-171620505700371"
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 ;