fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r476-tall-171620505700371
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CircularTrains-PT-768

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1291.487 1220418.00 1833471.00 2826.90 ?TTTFFFFF?TFT?FF normal

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.r476-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 ltsminxred
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 r476-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 1717205854156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:37:35] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-06-01 01:37:35] [INFO ] Transformed 1536 places.
[2024-06-01 01:37:35] [INFO ] Transformed 768 transitions.
[2024-06-01 01:37:35] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 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 187 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2024-06-01 01:37:36] [INFO ] Computed 769 invariants in 81 ms
[2024-06-01 01:37:37] [INFO ] Implicit Places using invariants in 1670 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 1715 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 101 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 2028 ms. Remains : 1292/1536 places, 768/768 transitions.
Support contains 51 out of 1292 places after structural reductions.
[2024-06-01 01:37:38] [INFO ] Flatten gal took : 89 ms
[2024-06-01 01:37:38] [INFO ] Flatten gal took : 55 ms
[2024-06-01 01:37:38] [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 4072 ms. (9 steps per ms) remains 7/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 7/7 properties
// Phase 1: matrix 768 rows 1292 cols
[2024-06-01 01:37:40] [INFO ] Computed 525 invariants in 44 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 81 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 164ms 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 201 ms. Remains 1038 /1292 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1038 cols
[2024-06-01 01:37:41] [INFO ] Computed 525 invariants in 7 ms
[2024-06-01 01:37:41] [INFO ] Implicit Places using invariants in 917 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 922 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 42 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 1165 ms. Remains : 1026/1292 places, 514/768 transitions.
Stuttering acceptance computed with spot in 260 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 1387 reset in 4385 ms.
Product exploration explored 100000 steps with 1367 reset in 4541 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 327 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1128 steps (0 resets) in 75 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 427 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 514 rows 1026 cols
[2024-06-01 01:37:52] [INFO ] Computed 513 invariants in 11 ms
[2024-06-01 01:37:53] [INFO ] [Real]Absence check using 511 positive place invariants in 212 ms returned sat
[2024-06-01 01:37:53] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 71 ms returned sat
[2024-06-01 01:38:03] [INFO ] [Real]Absence check using state equation in 9765 ms returned sat
[2024-06-01 01:38:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:38:03] [INFO ] [Nat]Absence check using 511 positive place invariants in 227 ms returned sat
[2024-06-01 01:38:03] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 71 ms returned sat
[2024-06-01 01:38:18] [INFO ] [Nat]Absence check using state equation in 14309 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 40 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-01 01:38:18] [INFO ] Invariant cache hit.
[2024-06-01 01:38:18] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 01:38:18] [INFO ] Invariant cache hit.
[2024-06-01 01:38:19] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2024-06-01 01:38:19] [INFO ] Redundant transitions in 25 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 01:38:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1540 variables, 1026/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 1539 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 511/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 1/1026 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 514/1540 variables, 1026/1539 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 258/1797 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1540 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/1540 variables, and 1797 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61741 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 368 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 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 734 steps (0 resets) in 63 ms. (11 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 429 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 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 01:39:21] [INFO ] Invariant cache hit.
[2024-06-01 01:39:22] [INFO ] [Real]Absence check using 511 positive place invariants in 243 ms returned sat
[2024-06-01 01:39:22] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 39 ms returned sat
[2024-06-01 01:39:27] [INFO ] [Real]Absence check using state equation in 5420 ms returned sat
[2024-06-01 01:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:39:28] [INFO ] [Nat]Absence check using 511 positive place invariants in 221 ms returned sat
[2024-06-01 01:39:28] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 55 ms returned sat
[2024-06-01 01:39:34] [INFO ] [Nat]Absence check using state equation in 6628 ms returned sat
[2024-06-01 01:39:34] [INFO ] Computed and/alt/rep : 258/514/258 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 01:39:41] [INFO ] Added : 25 causal constraints over 5 iterations in 6741 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1345 reset in 4251 ms.
Product exploration explored 100000 steps with 1390 reset in 4541 ms.
Support contains 4 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 514/514 transitions.
Applied a total of 0 rules in 32 ms. Remains 1026 /1026 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-01 01:39:50] [INFO ] Invariant cache hit.
[2024-06-01 01:39:51] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-06-01 01:39:51] [INFO ] Invariant cache hit.
[2024-06-01 01:39:52] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-06-01 01:39:52] [INFO ] Redundant transitions in 11 ms returned []
Running 258 sub problems to find dead transitions.
[2024-06-01 01:39:52] [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 30011 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 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61704 ms. Remains : 1026/1026 places, 514/514 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-00 finished in 191584 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 38 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-06-01 01:40:52] [INFO ] Computed 525 invariants in 7 ms
[2024-06-01 01:40:53] [INFO ] Implicit Places using invariants in 876 ms returned [134, 205, 424, 473, 575, 803, 905, 1034, 1066, 1261]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 878 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 39 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 956 ms. Remains : 1282/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 114 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 16 reset in 2935 ms.
Product exploration explored 100000 steps with 30 reset in 3335 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 260 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 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 32790 steps (7 resets) in 1745 ms. (18 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 553 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 768 rows 1282 cols
[2024-06-01 01:41:01] [INFO ] Computed 515 invariants in 8 ms
[2024-06-01 01:41:02] [INFO ] [Real]Absence check using 511 positive place invariants in 241 ms returned sat
[2024-06-01 01:41:02] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 33 ms returned sat
[2024-06-01 01:41:12] [INFO ] [Real]Absence check using state equation in 9374 ms returned sat
[2024-06-01 01:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:41:13] [INFO ] [Nat]Absence check using 511 positive place invariants in 259 ms returned sat
[2024-06-01 01:41:13] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 116 ms returned sat
[2024-06-01 01:41:24] [INFO ] [Nat]Absence check using state equation in 11759 ms returned sat
[2024-06-01 01:41:25] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 41 ms.
[2024-06-01 01:41:27] [INFO ] Added : 10 causal constraints over 2 iterations in 2227 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 38 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:41:27] [INFO ] Invariant cache hit.
[2024-06-01 01:41:28] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-06-01 01:41:28] [INFO ] Invariant cache hit.
[2024-06-01 01:41:29] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:41:29] [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 30011 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 30013 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 60104ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 61987 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 254 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 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 13065 steps (1 resets) in 723 ms. (18 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 390 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 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 01:42:30] [INFO ] Invariant cache hit.
[2024-06-01 01:42:31] [INFO ] [Real]Absence check using 511 positive place invariants in 241 ms returned sat
[2024-06-01 01:42:31] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 93 ms returned sat
[2024-06-01 01:42:40] [INFO ] [Real]Absence check using state equation in 8918 ms returned sat
[2024-06-01 01:42:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:42:41] [INFO ] [Nat]Absence check using 511 positive place invariants in 242 ms returned sat
[2024-06-01 01:42:41] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 45 ms returned sat
[2024-06-01 01:42:42] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2024-06-01 01:42:42] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 36 ms.
[2024-06-01 01:42:47] [INFO ] Added : 15 causal constraints over 3 iterations in 5269 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25 reset in 2900 ms.
Product exploration explored 100000 steps with 24 reset in 3151 ms.
Support contains 5 out of 1282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1282/1282 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1282 /1282 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:42:54] [INFO ] Invariant cache hit.
[2024-06-01 01:42:54] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-06-01 01:42:54] [INFO ] Invariant cache hit.
[2024-06-01 01:42:55] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:42:55] [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 30028 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 30018 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 60112ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Finished structural reductions in LTL mode , in 1 iterations and 61941 ms. Remains : 1282/1282 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-04 finished in 183712 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 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 488 place count 1048 transition count 524
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 512 place count 1036 transition count 512
Applied a total of 512 rules in 152 ms. Remains 1036 /1292 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1036 cols
[2024-06-01 01:43:56] [INFO ] Computed 525 invariants in 6 ms
[2024-06-01 01:43:56] [INFO ] Implicit Places using invariants in 707 ms returned [110, 165, 167, 339, 465, 642, 724, 823, 1010, 1013]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 708 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 32 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 892 ms. Remains : 1026/1292 places, 512/768 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-05
Product exploration explored 100000 steps with 200 reset in 3513 ms.
Product exploration explored 100000 steps with 193 reset in 3765 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 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2821 steps (0 resets) in 111 ms. (25 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 259 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 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-06-01 01:44:05] [INFO ] Computed 515 invariants in 13 ms
[2024-06-01 01:44:06] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-06-01 01:44:06] [INFO ] Invariant cache hit.
[2024-06-01 01:44:06] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2024-06-01 01:44:07] [INFO ] Redundant transitions in 5 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:44:07] [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 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 256/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 1797 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61649 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 174 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 710 steps (0 resets) in 43 ms. (16 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 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 190 reset in 3555 ms.
Product exploration explored 100000 steps with 195 reset in 3867 ms.
Support contains 2 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 512/512 transitions.
Applied a total of 0 rules in 32 ms. Remains 1026 /1026 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-06-01 01:45:15] [INFO ] Invariant cache hit.
[2024-06-01 01:45:16] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 01:45:16] [INFO ] Invariant cache hit.
[2024-06-01 01:45:17] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
[2024-06-01 01:45:17] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:45:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1538/1538 variables, and 1541 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1026/1026 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/1026 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1538 variables, 1026/1541 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 256/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/1797 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1538/1538 variables, and 1797 constraints, problems are : Problem set: 0 solved, 256 unsolved in 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]
After SMT, in 60061ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61663 ms. Remains : 1026/1026 places, 512/512 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-05 finished in 141192 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 98 ms. Remains 1037 /1292 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1037 cols
[2024-06-01 01:46:17] [INFO ] Computed 525 invariants in 15 ms
[2024-06-01 01:46:18] [INFO ] Implicit Places using invariants in 711 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 712 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1025/1292 places, 513/768 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 512
Applied a total of 2 rules in 34 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 01:46:18] [INFO ] Computed 513 invariants in 6 ms
[2024-06-01 01:46:18] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-06-01 01:46:18] [INFO ] Invariant cache hit.
[2024-06-01 01:46:19] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1560 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 2404 ms. Remains : 1024/1292 places, 512/768 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 2895 ms.
Product exploration explored 100000 steps with 0 reset in 3290 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 133 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 35 ms :[(NOT p0)]
RANDOM walk for 3874 steps (0 resets) in 188 ms. (20 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 118 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-06-01 01:46:26] [INFO ] Invariant cache hit.
[2024-06-01 01:46:27] [INFO ] [Real]Absence check using 511 positive place invariants in 245 ms returned sat
[2024-06-01 01:46:27] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 69 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 163 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 10439 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-06-01 01:46:27] [INFO ] Computed 525 invariants in 14 ms
[2024-06-01 01:46:28] [INFO ] Implicit Places using invariants in 785 ms returned [205, 208, 424, 473, 905, 1034, 1066, 1258, 1261]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 787 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1283/1292 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1283 /1283 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 865 ms. Remains : 1283/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 317 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 290 reset in 3675 ms.
Product exploration explored 100000 steps with 291 reset in 3918 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 383 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 340 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 27053 steps (5 resets) in 1222 ms. (22 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 674 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 315 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 296 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-06-01 01:46:39] [INFO ] Computed 516 invariants in 13 ms
[2024-06-01 01:46:40] [INFO ] [Real]Absence check using 511 positive place invariants in 263 ms returned sat
[2024-06-01 01:46:40] [INFO ] [Real]Absence check using 511 positive and 5 generalized place invariants in 54 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 729 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 13367 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 39 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-06-01 01:46:41] [INFO ] Computed 525 invariants in 12 ms
[2024-06-01 01:46:41] [INFO ] Implicit Places using invariants in 804 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 808 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 35 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 882 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 353 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 169 reset in 3486 ms.
Product exploration explored 100000 steps with 168 reset in 3742 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 178 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 321 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
RANDOM walk for 478 steps (0 resets) in 39 ms. (11 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 188 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 287 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:46:51] [INFO ] Computed 513 invariants in 11 ms
[2024-06-01 01:46:52] [INFO ] [Real]Absence check using 511 positive place invariants in 263 ms returned sat
[2024-06-01 01:46:52] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 39 ms returned sat
[2024-06-01 01:47:01] [INFO ] [Real]Absence check using state equation in 9148 ms returned sat
[2024-06-01 01:47:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:47:02] [INFO ] [Nat]Absence check using 511 positive place invariants in 267 ms returned sat
[2024-06-01 01:47:02] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 61 ms returned sat
[2024-06-01 01:47:14] [INFO ] [Nat]Absence check using state equation in 11957 ms returned sat
[2024-06-01 01:47:14] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 43 ms.
[2024-06-01 01:47:16] [INFO ] Added : 10 causal constraints over 2 iterations in 2074 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 40 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:47:16] [INFO ] Invariant cache hit.
[2024-06-01 01:47:17] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-06-01 01:47:17] [INFO ] Invariant cache hit.
[2024-06-01 01:47:18] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:47:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30074ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30080ms
Finished structural reductions in LTL mode , in 1 iterations and 31972 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 178 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 319 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
RANDOM walk for 175 steps (0 resets) in 24 ms. (7 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 187 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 286 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 299 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
[2024-06-01 01:47:50] [INFO ] Invariant cache hit.
[2024-06-01 01:47:50] [INFO ] [Real]Absence check using 511 positive place invariants in 239 ms returned sat
[2024-06-01 01:47:51] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 128 ms returned sat
[2024-06-01 01:48:05] [INFO ] [Real]Absence check using state equation in 14052 ms returned unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 290 ms :[p0, p0, p0, p0, p0, p0, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 157 reset in 3301 ms.
Product exploration explored 100000 steps with 158 reset in 3584 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 293 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 166 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 01:48:12] [INFO ] Redundant transitions in 7 ms returned []
Running 512 sub problems to find dead transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:48:12] [INFO ] Computed 513 invariants in 9 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-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 26 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 138 ms of which 7 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 138 ms of which 3 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 3 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 3 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 115 ms of which 2 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 3 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 112 ms of which 3 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 3 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 2 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 3 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 2 ms to minimize.
[2024-06-01 01:48:25] [INFO ] Deduced a trap composed of 2 places in 100 ms of which 2 ms to minimize.
[2024-06-01 01:48:26] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-06-01 01:48:26] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-06-01 01:48:26] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-06-01 01:48:26] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 2 ms to minimize.
[2024-06-01 01:48:26] [INFO ] Deduced a trap composed of 2 places in 91 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-06-01 01:48:36] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-06-01 01:48:36] [INFO ] Deduced a trap composed of 2 places in 99 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 101 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 102 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 2 ms to minimize.
[2024-06-01 01:48:37] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 3 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 5 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 2 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 2 places in 73 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-06-01 01:48:39] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 1 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 1 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 2 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 62 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-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-06-01 01:48:41] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 2 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 2 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-06-01 01:48:42] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-06-01 01:48:43] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 60 solved, 452 unsolved
Search for dead transitions found 60 dead transitions in 30115ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1280/1280 places, 708/768 transitions.
Graph (complete) has 2438 edges and 1280 vertex of which 1220 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.3 ms
Discarding 60 places :
Also discarding 0 output transitions
Deduced a syphon composed of 195 places in 0 ms
Applied a total of 1 rules in 49 ms. Remains 1220 /1280 variables (removed 60) and now considering 708/708 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1220/1280 places, 708/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30357 ms. Remains : 1220/1280 places, 708/768 transitions.
Support contains 2 out of 1280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Applied a total of 0 rules in 51 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:48:43] [INFO ] Computed 513 invariants in 10 ms
[2024-06-01 01:48:43] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-06-01 01:48:43] [INFO ] Invariant cache hit.
[2024-06-01 01:48:44] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2024-06-01 01:48:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 511/1279 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1279 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1279 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SMT process timed out in 30083ms, After SMT, problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 30088ms
Finished structural reductions in LTL mode , in 1 iterations and 31960 ms. Remains : 1280/1280 places, 768/768 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-09 finished in 154003 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 38 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-06-01 01:49:15] [INFO ] Computed 525 invariants in 14 ms
[2024-06-01 01:49:15] [INFO ] Implicit Places using invariants in 774 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 775 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 48 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 862 ms. Remains : 1280/1292 places, 768/768 transitions.
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))]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-13
Product exploration explored 100000 steps with 273 reset in 3555 ms.
Product exploration explored 100000 steps with 225 reset in 3719 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 525 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 213 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 1314 ms. (30 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
// Phase 1: matrix 768 rows 1280 cols
[2024-06-01 01:49:25] [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 20 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 45ms 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 760 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
[2024-06-01 01:49:26] [INFO ] Invariant cache hit.
[2024-06-01 01:49:26] [INFO ] [Real]Absence check using 511 positive place invariants in 265 ms returned sat
[2024-06-01 01:49:27] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 78 ms returned sat
[2024-06-01 01:49:38] [INFO ] [Real]Absence check using state equation in 11528 ms returned sat
[2024-06-01 01:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:49:39] [INFO ] [Nat]Absence check using 511 positive place invariants in 262 ms returned sat
[2024-06-01 01:49:39] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 101 ms returned sat
[2024-06-01 01:49:53] [INFO ] [Nat]Absence check using state equation in 14071 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 47 ms. Remains 1025 /1280 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1025 cols
[2024-06-01 01:49:53] [INFO ] Computed 513 invariants in 6 ms
[2024-06-01 01:49:54] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-06-01 01:49:54] [INFO ] Invariant cache hit.
[2024-06-01 01:49:55] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2024-06-01 01:49:55] [INFO ] Redundant transitions in 4 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-01 01:49:55] [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
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 30013 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 30013 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 60056ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
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 61657 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 63 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 350 steps (0 resets) in 31 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 145 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 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
[2024-06-01 01:50:56] [INFO ] Invariant cache hit.
[2024-06-01 01:50:56] [INFO ] [Real]Absence check using 511 positive place invariants in 237 ms returned sat
[2024-06-01 01:50:56] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 43 ms returned sat
[2024-06-01 01:51:01] [INFO ] [Real]Absence check using state equation in 4793 ms returned sat
[2024-06-01 01:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:51:02] [INFO ] [Nat]Absence check using 511 positive place invariants in 238 ms returned sat
[2024-06-01 01:51:02] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 43 ms returned sat
[2024-06-01 01:51:08] [INFO ] [Nat]Absence check using state equation in 6243 ms returned sat
[2024-06-01 01:51:08] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 01:51:12] [INFO ] Added : 10 causal constraints over 2 iterations in 3430 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 973 reset in 4169 ms.
Product exploration explored 100000 steps with 962 reset in 4424 ms.
Support contains 2 out of 1025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1025/1025 places, 513/513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 512
Applied a total of 2 rules in 41 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2024-06-01 01:51:20] [INFO ] Computed 513 invariants in 14 ms
[2024-06-01 01:51:21] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-06-01 01:51:21] [INFO ] Invariant cache hit.
[2024-06-01 01:51:22] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2024-06-01 01:51:22] [INFO ] Redundant transitions in 3 ms returned []
Running 256 sub problems to find dead transitions.
[2024-06-01 01:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 1537 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 511/1023 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/1024 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1024 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 512/1536 variables, 1024/1537 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1536 variables, 256/1793 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 1793 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1024/1024 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1025 places, 512/513 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61628 ms. Remains : 1024/1025 places, 512/513 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-13 finished in 187447 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 32 ms. Remains 1292 /1292 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1292 cols
[2024-06-01 01:52:22] [INFO ] Computed 525 invariants in 12 ms
[2024-06-01 01:52:23] [INFO ] Implicit Places using invariants in 817 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 819 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 33 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 884 ms. Remains : 1280/1292 places, 768/768 transitions.
Stuttering acceptance computed with spot in 146 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 1047 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 103 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 75 ms. Remains 1037 /1292 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1037 cols
[2024-06-01 01:52:23] [INFO ] Computed 525 invariants in 11 ms
[2024-06-01 01:52:24] [INFO ] Implicit Places using invariants in 699 ms returned [110, 165, 339, 379, 465, 643, 725, 824, 850, 1014]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 700 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 33 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 810 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 83 reset in 3295 ms.
Product exploration explored 100000 steps with 91 reset in 3650 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 366 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 183 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 15447 steps (2 resets) in 664 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))))]
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 544 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 513 rows 1027 cols
[2024-06-01 01:52:33] [INFO ] Computed 515 invariants in 7 ms
[2024-06-01 01:52:34] [INFO ] [Real]Absence check using 511 positive place invariants in 233 ms returned sat
[2024-06-01 01:52:34] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 86 ms returned sat
[2024-06-01 01:52:38] [INFO ] [Real]Absence check using state equation in 4274 ms returned sat
[2024-06-01 01:52:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:52:39] [INFO ] [Nat]Absence check using 511 positive place invariants in 237 ms returned sat
[2024-06-01 01:52:39] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 40 ms returned sat
[2024-06-01 01:52:53] [INFO ] [Nat]Absence check using state equation in 14342 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-06-01 01:52:53] [INFO ] Invariant cache hit.
[2024-06-01 01:52:54] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-06-01 01:52:54] [INFO ] Invariant cache hit.
[2024-06-01 01:52:55] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-01 01:52:55] [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 30011 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 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1027/1027 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 61598 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 376 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)]
RANDOM walk for 17364 steps (2 resets) in 570 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))))]
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 538 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 01:53:57] [INFO ] Invariant cache hit.
[2024-06-01 01:53:57] [INFO ] [Real]Absence check using 511 positive place invariants in 237 ms returned sat
[2024-06-01 01:53:57] [INFO ] [Real]Absence check using 511 positive and 4 generalized place invariants in 70 ms returned sat
[2024-06-01 01:54:02] [INFO ] [Real]Absence check using state equation in 4014 ms returned sat
[2024-06-01 01:54:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:54:02] [INFO ] [Nat]Absence check using 511 positive place invariants in 219 ms returned sat
[2024-06-01 01:54:02] [INFO ] [Nat]Absence check using 511 positive and 4 generalized place invariants in 53 ms returned sat
[2024-06-01 01:54:11] [INFO ] [Nat]Absence check using state equation in 8506 ms returned sat
[2024-06-01 01:54:11] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 01:54:17] [INFO ] Added : 35 causal constraints over 7 iterations in 5822 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 92 reset in 3310 ms.
Product exploration explored 100000 steps with 70 reset in 3518 ms.
Support contains 5 out of 1027 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1027/1027 places, 513/513 transitions.
Applied a total of 0 rules in 28 ms. Remains 1027 /1027 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-06-01 01:54:24] [INFO ] Invariant cache hit.
[2024-06-01 01:54:24] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-06-01 01:54:24] [INFO ] Invariant cache hit.
[2024-06-01 01:54:25] [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.
Running 257 sub problems to find dead transitions.
[2024-06-01 01:54:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 512/1025 variables, 511/511 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 2/1027 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 513/1540 variables, 1027/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1540 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 1542 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30011 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 30017 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 60058ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in LTL mode , in 1 iterations and 61585 ms. Remains : 1027/1027 places, 513/513 transitions.
Treatment of property CircularTrains-PT-768-LTLCardinality-04 finished in 182076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((!p0 U X(X(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(F(p1)))) U X(p2)))'
[2024-06-01 01:55:26] [INFO ] Flatten gal took : 48 ms
[2024-06-01 01:55:26] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 01:55:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1292 places, 768 transitions and 2584 arcs took 13 ms.
Total runtime 1070837 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : CircularTrains-PT-768-LTLCardinality-00
FORMULA CircularTrains-PT-768-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CircularTrains-PT-768-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CircularTrains-PT-768-LTLCardinality-09
Could not compute solution for formula : CircularTrains-PT-768-LTLCardinality-13

BK_STOP 1717207074574

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name CircularTrains-PT-768-LTLCardinality-00
ltl formula formula --ltl=/tmp/2797/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1292 places, 768 transitions and 2584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2797/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2797/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2797/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.040 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2797/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1294 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1293, there are 771 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~936 levels ~10000 states ~553560 transitions
pnml2lts-mc( 3/ 4): ~1703 levels ~20000 states ~735012 transitions
pnml2lts-mc( 3/ 4): ~3238 levels ~40000 states ~965584 transitions
pnml2lts-mc( 3/ 4): ~6394 levels ~80000 states ~1256096 transitions
pnml2lts-mc( 3/ 4): ~12665 levels ~160000 states ~1599840 transitions
pnml2lts-mc( 3/ 4): ~24908 levels ~320000 states ~1962832 transitions
pnml2lts-mc( 3/ 4): ~24908 levels ~640000 states ~2385076 transitions
pnml2lts-mc( 3/ 4): ~24908 levels ~1280000 states ~3341812 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1667306
pnml2lts-mc( 0/ 4): unique states count: 1766287
pnml2lts-mc( 0/ 4): unique transitions count: 4174215
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 840098
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1766290
pnml2lts-mc( 0/ 4): - cum. max stack depth: 99615
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1766290 states 4175752 transitions, fanout: 2.364
pnml2lts-mc( 0/ 4): Total exploration time 65.990 sec (65.950 sec minimum, 65.965 sec on average)
pnml2lts-mc( 0/ 4): States per second: 26766, Transitions per second: 63279
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 89.4MB, 28.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 89.4MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLCardinality-04
ltl formula formula --ltl=/tmp/2797/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1292 places, 768 transitions and 2584 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2797/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2797/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2797/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2797/ltl_1_
pnml2lts-mc( 0/ 4): There are 1293 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1293, there are 783 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2306 levels ~10000 states ~1141768 transitions
pnml2lts-mc( 3/ 4): ~2683 levels ~20000 states ~1213380 transitions
pnml2lts-mc( 3/ 4): ~2821 levels ~40000 states ~1252260 transitions
pnml2lts-mc( 3/ 4): ~3098 levels ~80000 states ~1330316 transitions
pnml2lts-mc( 3/ 4): ~7523 levels ~160000 states ~1765180 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~50071!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 46994
pnml2lts-mc( 0/ 4): unique states count: 147501
pnml2lts-mc( 0/ 4): unique transitions count: 2501125
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3042
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 147504
pnml2lts-mc( 0/ 4): - cum. max stack depth: 100510
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 147504 states 2503433 transitions, fanout: 16.972
pnml2lts-mc( 0/ 4): Total exploration time 8.700 sec (8.700 sec minimum, 8.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16954, Transitions per second: 287751
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 64.1MB, 36.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/78.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 64.1MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLCardinality-05
ltl formula formula --ltl=/tmp/2797/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1292 places, 768 transitions and 2584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2797/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2797/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2797/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2797/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1294 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1293, there are 771 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1454 levels ~10000 states ~712008 transitions
pnml2lts-mc( 2/ 4): ~3045 levels ~20000 states ~981428 transitions
pnml2lts-mc( 3/ 4): ~6691 levels ~40000 states ~1244208 transitions
pnml2lts-mc( 3/ 4): ~12294 levels ~80000 states ~1487196 transitions
pnml2lts-mc( 3/ 4): ~31791 levels ~160000 states ~1909460 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~46496!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 75249
pnml2lts-mc( 0/ 4): unique states count: 228993
pnml2lts-mc( 0/ 4): unique transitions count: 2162627
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 228996
pnml2lts-mc( 0/ 4): - cum. max stack depth: 153747
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 228996 states 2163399 transitions, fanout: 9.447
pnml2lts-mc( 0/ 4): Total exploration time 9.300 sec (9.300 sec minimum, 9.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24623, Transitions per second: 232624
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 75.2MB, 36.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/91.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 75.2MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLCardinality-09
ltl formula formula --ltl=/tmp/2797/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1292 places, 768 transitions and 2584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2797/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2797/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2797/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2797/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 1293 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1293, there are 785 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~724 levels ~10000 states ~963476 transitions
pnml2lts-mc( 3/ 4): ~1350 levels ~20000 states ~1330084 transitions
pnml2lts-mc( 3/ 4): ~2647 levels ~40000 states ~1840316 transitions
pnml2lts-mc( 0/ 4): ~6160 levels ~80000 states ~2346660 transitions
pnml2lts-mc( 0/ 4): ~12416 levels ~160000 states ~2824652 transitions
pnml2lts-mc( 3/ 4): ~21189 levels ~320000 states ~3388004 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 225997
pnml2lts-mc( 0/ 4): unique states count: 323046
pnml2lts-mc( 0/ 4): unique transitions count: 3565060
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 323049
pnml2lts-mc( 0/ 4): - cum. max stack depth: 97052
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 323049 states 3566593 transitions, fanout: 11.040
pnml2lts-mc( 0/ 4): Total exploration time 13.810 sec (13.750 sec minimum, 13.785 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23392, Transitions per second: 258262
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 91.2MB, 26.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 91.2MB (~256.0MB paged-in)
ltl formula name CircularTrains-PT-768-LTLCardinality-13
ltl formula formula --ltl=/tmp/2797/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1292 places, 768 transitions and 2584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2797/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2797/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2797/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2797/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1294 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1293, there are 770 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1151 levels ~10000 states ~623688 transitions
pnml2lts-mc( 1/ 4): ~2571 levels ~20000 states ~880268 transitions
pnml2lts-mc( 1/ 4): ~5088 levels ~40000 states ~1112416 transitions
pnml2lts-mc( 1/ 4): ~10227 levels ~80000 states ~1352288 transitions
pnml2lts-mc( 0/ 4): ~19197 levels ~160000 states ~1684596 transitions
pnml2lts-mc( 3/ 4): ~25544 levels ~320000 states ~2060916 transitions
pnml2lts-mc( 1/ 4): ~25543 levels ~640000 states ~2509048 transitions
pnml2lts-mc( 3/ 4): ~25544 levels ~1280000 states ~3647812 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1275031
pnml2lts-mc( 0/ 4): unique states count: 1376732
pnml2lts-mc( 0/ 4): unique transitions count: 3938667
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 930069
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1376776
pnml2lts-mc( 0/ 4): - cum. max stack depth: 102158
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1376776 states 3939590 transitions, fanout: 2.861
pnml2lts-mc( 0/ 4): Total exploration time 46.970 sec (46.950 sec minimum, 46.963 sec on average)
pnml2lts-mc( 0/ 4): States per second: 29312, Transitions per second: 83875
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 87.0MB, 30.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 780 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 87.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-768"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r476-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 ;