Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446900340.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S06J06T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446900340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716920553540

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 18:22:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:22:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:22:35] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2024-05-28 18:22:35] [INFO ] Transformed 506 places.
[2024-05-28 18:22:35] [INFO ] Transformed 7154 transitions.
[2024-05-28 18:22:35] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2024-05-28 18:22:35] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 497 transition count 1771
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 497 transition count 1771
Applied a total of 12 rules in 102 ms. Remains 497 /506 variables (removed 9) and now considering 1771/1774 (removed 3) transitions.
Running 1765 sub problems to find dead transitions.
[2024-05-28 18:22:36] [INFO ] Flow matrix only has 1747 transitions (discarded 24 similar events)
// Phase 1: matrix 1747 rows 497 cols
[2024-05-28 18:22:36] [INFO ] Computed 48 invariants in 124 ms
[2024-05-28 18:22:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
[2024-05-28 18:23:03] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 15 ms to minimize.
[2024-05-28 18:23:04] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/2244 variables, and 39 constraints, problems are : Problem set: 0 solved, 1765 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 20/22 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1765/1765 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1765 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1765 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1769 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/493 variables, 2/41 constraints. Problems are: Problem set: 220 solved, 1545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/2244 variables, and 41 constraints, problems are : Problem set: 220 solved, 1545 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1765 constraints, Known Traps: 2/2 constraints]
After SMT, in 54947ms problems are : Problem set: 220 solved, 1545 unsolved
Search for dead transitions found 220 dead transitions in 54998ms
Found 220 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 220 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 220 transitions.
[2024-05-28 18:23:30] [INFO ] Flow matrix only has 1527 transitions (discarded 24 similar events)
// Phase 1: matrix 1527 rows 497 cols
[2024-05-28 18:23:30] [INFO ] Computed 48 invariants in 33 ms
[2024-05-28 18:23:31] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-28 18:23:31] [INFO ] Flow matrix only has 1527 transitions (discarded 24 similar events)
[2024-05-28 18:23:31] [INFO ] Invariant cache hit.
[2024-05-28 18:23:32] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:23:43] [INFO ] Implicit Places using invariants and state equation in 12182 ms returned []
Implicit Place search using SMT with State Equation took 12610 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 497/506 places, 1551/1774 transitions.
Applied a total of 0 rules in 64 ms. Remains 497 /497 variables (removed 0) and now considering 1551/1551 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67824 ms. Remains : 497/506 places, 1551/1774 transitions.
Support contains 186 out of 497 places after structural reductions.
[2024-05-28 18:23:44] [INFO ] Flatten gal took : 380 ms
[2024-05-28 18:23:44] [INFO ] Flatten gal took : 177 ms
[2024-05-28 18:23:45] [INFO ] Input system was already deterministic with 1551 transitions.
Support contains 170 out of 497 places (down from 186) after GAL structural reductions.
RANDOM walk for 40001 steps (163 resets) in 1799 ms. (22 steps per ms) remains 4/23 properties
BEST_FIRST walk for 40002 steps (74 resets) in 464 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (77 resets) in 176 ms. (225 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (78 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
[2024-05-28 18:23:46] [INFO ] Flow matrix only has 1527 transitions (discarded 24 similar events)
[2024-05-28 18:23:46] [INFO ] Invariant cache hit.
[2024-05-28 18:23:46] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/228 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/237 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 238/475 variables, 16/32 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/483 variables, 5/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 18:23:46] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-28 18:23:46] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 2/39 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 12/495 variables, 10/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/495 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2022/2024 variables, and 544 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 495/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 343/345 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/428 variables, 20/23 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/494 variables, 23/46 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 2/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/495 variables, 1/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2022/2024 variables, and 544 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1834 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 495/497 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 4109ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 497 transition count 1526
Reduce places removed 25 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 472 transition count 1522
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 468 transition count 1522
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 58 place count 468 transition count 1466
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 170 place count 412 transition count 1466
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 272 place count 361 transition count 1415
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 280 place count 361 transition count 1407
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 288 place count 353 transition count 1407
Applied a total of 288 rules in 257 ms. Remains 353 /497 variables (removed 144) and now considering 1407/1551 (removed 144) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:23:50] [INFO ] Flow matrix only has 1383 transitions (discarded 24 similar events)
// Phase 1: matrix 1383 rows 353 cols
[2024-05-28 18:23:50] [INFO ] Computed 48 invariants in 40 ms
[2024-05-28 18:23:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:24:09] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:24:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-28 18:24:09] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-05-28 18:24:11] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-05-28 18:24:14] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/1736 variables, and 42 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/353 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/347 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1381 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/349 variables, 2/44 constraints. Problems are: Problem set: 204 solved, 1197 unsolved
[2024-05-28 18:24:35] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 1/45 constraints. Problems are: Problem set: 204 solved, 1197 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 3)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 2)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 2)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 2)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 1)
(s117 0)
(s118 1)
(s119 4)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 2)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 2)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 1)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 4)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 2)
(s179 4)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 10)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 2)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 4)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 1)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 4)
(s250 0)
(s251 1)
(s252 1)
(s253 0)
(s254 0)
(s255 9)
(s256 0)
(s257 0)
(s258 4)
(s259 10)
(s261 3)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 3)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s297 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1736 variables, and 45 constraints, problems are : Problem set: 204 solved, 1197 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/353 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 6/6 constraints]
After SMT, in 52023ms problems are : Problem set: 204 solved, 1197 unsolved
Search for dead transitions found 204 dead transitions in 52046ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 353/497 places, 1203/1551 transitions.
Applied a total of 0 rules in 43 ms. Remains 353 /353 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52352 ms. Remains : 353/497 places, 1203/1551 transitions.
RANDOM walk for 36058 steps (344 resets) in 552 ms. (65 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 33 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 497 transition count 1530
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 476 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 475 transition count 1529
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 44 place count 475 transition count 1473
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 156 place count 419 transition count 1473
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 258 place count 368 transition count 1422
Applied a total of 258 rules in 103 ms. Remains 368 /497 variables (removed 129) and now considering 1422/1551 (removed 129) transitions.
Running 1416 sub problems to find dead transitions.
[2024-05-28 18:24:43] [INFO ] Flow matrix only has 1398 transitions (discarded 24 similar events)
// Phase 1: matrix 1398 rows 368 cols
[2024-05-28 18:24:43] [INFO ] Computed 48 invariants in 26 ms
[2024-05-28 18:24:43] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1416 unsolved
[2024-05-28 18:25:02] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-28 18:25:02] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-28 18:25:04] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-28 18:25:06] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1416 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 362/1766 variables, and 41 constraints, problems are : Problem set: 0 solved, 1416 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1416/1416 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1416 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/366 variables, 4/45 constraints. Problems are: Problem set: 300 solved, 1116 unsolved
[2024-05-28 18:25:29] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 3 ms to minimize.
[2024-05-28 18:25:29] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:25:33] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1766 variables, and 48 constraints, problems are : Problem set: 300 solved, 1116 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/28 constraints, State Equation: 0/368 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1416 constraints, Known Traps: 7/7 constraints]
After SMT, in 51706ms problems are : Problem set: 300 solved, 1116 unsolved
Search for dead transitions found 300 dead transitions in 51726ms
Found 300 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 300 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 300 transitions.
[2024-05-28 18:25:35] [INFO ] Flow matrix only has 1098 transitions (discarded 24 similar events)
// Phase 1: matrix 1098 rows 368 cols
[2024-05-28 18:25:35] [INFO ] Computed 48 invariants in 39 ms
[2024-05-28 18:25:35] [INFO ] Implicit Places using invariants in 548 ms returned [19, 73, 154, 307]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 556 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/497 places, 1122/1551 transitions.
Applied a total of 0 rules in 26 ms. Remains 364 /364 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52417 ms. Remains : 364/497 places, 1122/1551 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 14 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-01 finished in 52747 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)))'
Support contains 11 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 493 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 493 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 492 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 492 transition count 1546
Applied a total of 10 rules in 87 ms. Remains 492 /497 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-05-28 18:25:36] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
// Phase 1: matrix 1522 rows 492 cols
[2024-05-28 18:25:36] [INFO ] Computed 48 invariants in 67 ms
[2024-05-28 18:25:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-05-28 18:25:56] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-28 18:26:02] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2014 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (OVERLAPS) 2/488 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/2014 variables, and 41 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 2/2 constraints]
After SMT, in 49265ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 49291ms
[2024-05-28 18:26:25] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-05-28 18:26:25] [INFO ] Invariant cache hit.
[2024-05-28 18:26:25] [INFO ] Implicit Places using invariants in 353 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 358 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/497 places, 1546/1551 transitions.
Applied a total of 0 rules in 11 ms. Remains 488 /488 variables (removed 0) and now considering 1546/1546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49753 ms. Remains : 488/497 places, 1546/1551 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-02 finished in 49950 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 5 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 497 transition count 1523
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 469 transition count 1523
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 56 place count 469 transition count 1466
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 170 place count 412 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 411 transition count 1465
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 411 transition count 1465
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 266 place count 364 transition count 1418
Applied a total of 266 rules in 87 ms. Remains 364 /497 variables (removed 133) and now considering 1418/1551 (removed 133) transitions.
Running 1412 sub problems to find dead transitions.
[2024-05-28 18:26:26] [INFO ] Flow matrix only has 1394 transitions (discarded 24 similar events)
// Phase 1: matrix 1394 rows 364 cols
[2024-05-28 18:26:26] [INFO ] Computed 48 invariants in 47 ms
[2024-05-28 18:26:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
[2024-05-28 18:26:48] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 6 ms to minimize.
[2024-05-28 18:26:50] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-05-28 18:26:57] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1758 variables, and 40 constraints, problems are : Problem set: 0 solved, 1412 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1412/1412 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
[2024-05-28 18:27:04] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 1 ms to minimize.
[2024-05-28 18:27:04] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:27:04] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:27:06] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 2 ms to minimize.
[2024-05-28 18:27:06] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1758 variables, and 45 constraints, problems are : Problem set: 0 solved, 1412 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1412 constraints, Known Traps: 8/8 constraints]
After SMT, in 55147ms problems are : Problem set: 0 solved, 1412 unsolved
Search for dead transitions found 0 dead transitions in 55159ms
[2024-05-28 18:27:21] [INFO ] Flow matrix only has 1394 transitions (discarded 24 similar events)
[2024-05-28 18:27:21] [INFO ] Invariant cache hit.
[2024-05-28 18:27:21] [INFO ] Implicit Places using invariants in 566 ms returned [18, 74, 152, 303]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 571 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/497 places, 1418/1551 transitions.
Applied a total of 0 rules in 22 ms. Remains 360 /360 variables (removed 0) and now considering 1418/1418 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55842 ms. Remains : 360/497 places, 1418/1551 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-03
Product exploration explored 100000 steps with 928 reset in 562 ms.
Stack based approach found an accepted trace after 51964 steps with 456 reset with depth 218 and stack size 218 in 294 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-03 finished in 56841 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))||G(p1)))'
Support contains 42 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 497 transition count 1525
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 471 transition count 1525
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 52 place count 471 transition count 1469
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 164 place count 415 transition count 1469
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 266 place count 364 transition count 1418
Applied a total of 266 rules in 128 ms. Remains 364 /497 variables (removed 133) and now considering 1418/1551 (removed 133) transitions.
Running 1412 sub problems to find dead transitions.
[2024-05-28 18:27:22] [INFO ] Flow matrix only has 1394 transitions (discarded 24 similar events)
// Phase 1: matrix 1394 rows 364 cols
[2024-05-28 18:27:22] [INFO ] Computed 48 invariants in 24 ms
[2024-05-28 18:27:22] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
[2024-05-28 18:27:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 3.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 2.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 2.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 2.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 4.0)
(s122 1.0)
(s123 0.0)
(s124 4.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 2.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 4.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 4.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 4.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 10.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 2.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 4.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 timeout
0.0)
(s223 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1758 variables, and 36 constraints, problems are : Problem set: 0 solved, 1412 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 17/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1412/1412 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/360 variables, 2/38 constraints. Problems are: Problem set: 204 solved, 1208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/38 constraints. Problems are: Problem set: 204 solved, 1208 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1005 is UNSAT
At refinement iteration 6 (OVERLAPS) 4/364 variables, 11/49 constraints. Problems are: Problem set: 392 solved, 1020 unsolved
[2024-05-28 18:28:12] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 2 ms to minimize.
[2024-05-28 18:28:12] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 1 ms to minimize.
[2024-05-28 18:28:12] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2024-05-28 18:28:12] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:28:12] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:28:13] [INFO ] Deduced a trap composed of 149 places in 371 ms of which 3 ms to minimize.
[2024-05-28 18:28:13] [INFO ] Deduced a trap composed of 180 places in 346 ms of which 5 ms to minimize.
SMT process timed out in 50746ms, After SMT, problems are : Problem set: 392 solved, 1020 unsolved
Search for dead transitions found 392 dead transitions in 50770ms
Found 392 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 392 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 392 transitions.
[2024-05-28 18:28:13] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
// Phase 1: matrix 1002 rows 364 cols
[2024-05-28 18:28:13] [INFO ] Computed 48 invariants in 15 ms
[2024-05-28 18:28:14] [INFO ] Implicit Places using invariants in 454 ms returned [18, 74, 152, 302]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 461 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/497 places, 1026/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 356 transition count 1022
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 356 transition count 1022
Applied a total of 8 rules in 51 ms. Remains 356 /360 variables (removed 4) and now considering 1022/1026 (removed 4) transitions.
[2024-05-28 18:28:14] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
// Phase 1: matrix 998 rows 356 cols
[2024-05-28 18:28:14] [INFO ] Computed 44 invariants in 35 ms
[2024-05-28 18:28:14] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-28 18:28:14] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:28:14] [INFO ] Invariant cache hit.
[2024-05-28 18:28:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:28:34] [INFO ] Implicit Places using invariants and state equation in 19916 ms returned []
Implicit Place search using SMT with State Equation took 20365 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 356/497 places, 1022/1551 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71782 ms. Remains : 356/497 places, 1022/1551 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-05
Product exploration explored 100000 steps with 2153 reset in 5886 ms.
Product exploration explored 100000 steps with 2244 reset in 6028 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40001 steps (358 resets) in 1081 ms. (36 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4811 ms. (8 steps per ms) remains 1/1 properties
[2024-05-28 18:28:48] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:28:48] [INFO ] Invariant cache hit.
[2024-05-28 18:28:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/174 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/178 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/187 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 344/1354 variables, and 35 constraints, problems are : Problem set: 1 solved, 0 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 17/22 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1508ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 178 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 42 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 1022/1022 transitions.
Applied a total of 0 rules in 27 ms. Remains 356 /356 variables (removed 0) and now considering 1022/1022 (removed 0) transitions.
Running 1016 sub problems to find dead transitions.
[2024-05-28 18:28:50] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:28:50] [INFO ] Invariant cache hit.
[2024-05-28 18:28:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:28:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-28 18:28:59] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2024-05-28 18:29:04] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
SMT process timed out in 22263ms, After SMT, problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 22277ms
[2024-05-28 18:29:13] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:29:13] [INFO ] Invariant cache hit.
[2024-05-28 18:29:13] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-28 18:29:13] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:29:13] [INFO ] Invariant cache hit.
[2024-05-28 18:29:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:29:32] [INFO ] Implicit Places using invariants and state equation in 19244 ms returned []
Implicit Place search using SMT with State Equation took 19632 ms to find 0 implicit places.
[2024-05-28 18:29:32] [INFO ] Redundant transitions in 59 ms returned []
Running 1016 sub problems to find dead transitions.
[2024-05-28 18:29:32] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:29:32] [INFO ] Invariant cache hit.
[2024-05-28 18:29:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:29:39] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-28 18:29:40] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-05-28 18:29:46] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 4 (OVERLAPS) 3/353 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 6 (OVERLAPS) 3/356 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1354 variables, and 47 constraints, problems are : Problem set: 0 solved, 1016 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1016/1016 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1016 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:30:08] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 4 ms to minimize.
[2024-05-28 18:30:08] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2024-05-28 18:30:08] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:30:13] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-28 18:30:13] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2024-05-28 18:30:13] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 6 (OVERLAPS) 3/353 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 8 (OVERLAPS) 3/356 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:30:30] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 2 ms to minimize.
[2024-05-28 18:30:30] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:30:30] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:30:30] [INFO ] Deduced a trap composed of 138 places in 296 ms of which 3 ms to minimize.
[2024-05-28 18:30:31] [INFO ] Deduced a trap composed of 181 places in 303 ms of which 5 ms to minimize.
[2024-05-28 18:30:31] [INFO ] Deduced a trap composed of 185 places in 272 ms of which 3 ms to minimize.
[2024-05-28 18:30:31] [INFO ] Deduced a trap composed of 192 places in 283 ms of which 2 ms to minimize.
[2024-05-28 18:30:32] [INFO ] Deduced a trap composed of 147 places in 223 ms of which 2 ms to minimize.
[2024-05-28 18:30:32] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 3 ms to minimize.
[2024-05-28 18:30:32] [INFO ] Deduced a trap composed of 188 places in 184 ms of which 2 ms to minimize.
[2024-05-28 18:30:32] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 2 ms to minimize.
[2024-05-28 18:30:33] [INFO ] Deduced a trap composed of 173 places in 231 ms of which 3 ms to minimize.
[2024-05-28 18:30:33] [INFO ] Deduced a trap composed of 180 places in 189 ms of which 2 ms to minimize.
[2024-05-28 18:30:33] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 2 ms to minimize.
[2024-05-28 18:30:33] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 2 ms to minimize.
[2024-05-28 18:30:34] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 3 ms to minimize.
[2024-05-28 18:30:34] [INFO ] Deduced a trap composed of 188 places in 249 ms of which 2 ms to minimize.
[2024-05-28 18:30:34] [INFO ] Deduced a trap composed of 185 places in 185 ms of which 2 ms to minimize.
SMT process timed out in 62026ms, After SMT, problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 62108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 104122 ms. Remains : 356/356 places, 1022/1022 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 74 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40003 steps (353 resets) in 811 ms. (49 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3369 ms. (11 steps per ms) remains 1/1 properties
[2024-05-28 18:30:36] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:30:36] [INFO ] Invariant cache hit.
[2024-05-28 18:30:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/174 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/178 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/187 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 344/1354 variables, and 35 constraints, problems are : Problem set: 1 solved, 0 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 17/22 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1651ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2232 reset in 5747 ms.
Product exploration explored 100000 steps with 2227 reset in 5591 ms.
Built C files in :
/tmp/ltsmin3492478352751695583
[2024-05-28 18:30:49] [INFO ] Computing symmetric may disable matrix : 1022 transitions.
[2024-05-28 18:30:49] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:30:49] [INFO ] Computing symmetric may enable matrix : 1022 transitions.
[2024-05-28 18:30:49] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:30:50] [INFO ] Computing Do-Not-Accords matrix : 1022 transitions.
[2024-05-28 18:30:50] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:30:50] [INFO ] Built C files in 545ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3492478352751695583
Running compilation step : cd /tmp/ltsmin3492478352751695583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3492478352751695583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3492478352751695583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 42 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 1022/1022 transitions.
Applied a total of 0 rules in 26 ms. Remains 356 /356 variables (removed 0) and now considering 1022/1022 (removed 0) transitions.
Running 1016 sub problems to find dead transitions.
[2024-05-28 18:30:53] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:30:53] [INFO ] Invariant cache hit.
[2024-05-28 18:30:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:31:00] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-28 18:31:01] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-28 18:31:06] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
SMT process timed out in 22110ms, After SMT, problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 22121ms
[2024-05-28 18:31:15] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:31:15] [INFO ] Invariant cache hit.
[2024-05-28 18:31:15] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-28 18:31:15] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:31:15] [INFO ] Invariant cache hit.
[2024-05-28 18:31:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:31:34] [INFO ] Implicit Places using invariants and state equation in 18759 ms returned []
Implicit Place search using SMT with State Equation took 19026 ms to find 0 implicit places.
[2024-05-28 18:31:34] [INFO ] Redundant transitions in 16 ms returned []
Running 1016 sub problems to find dead transitions.
[2024-05-28 18:31:34] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-05-28 18:31:34] [INFO ] Invariant cache hit.
[2024-05-28 18:31:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:31:41] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:31:41] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-28 18:31:46] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 4 (OVERLAPS) 3/353 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (OVERLAPS) 3/356 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1354 variables, and 47 constraints, problems are : Problem set: 0 solved, 1016 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1016/1016 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1016 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:32:10] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-05-28 18:32:10] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2024-05-28 18:32:10] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:32:15] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2024-05-28 18:32:15] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2024-05-28 18:32:15] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 6 (OVERLAPS) 3/353 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 8 (OVERLAPS) 3/356 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-05-28 18:32:31] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 2 ms to minimize.
[2024-05-28 18:32:31] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:32:31] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:32:32] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 2 ms to minimize.
[2024-05-28 18:32:32] [INFO ] Deduced a trap composed of 181 places in 215 ms of which 2 ms to minimize.
[2024-05-28 18:32:32] [INFO ] Deduced a trap composed of 185 places in 188 ms of which 2 ms to minimize.
[2024-05-28 18:32:32] [INFO ] Deduced a trap composed of 192 places in 180 ms of which 2 ms to minimize.
[2024-05-28 18:32:33] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 2 ms to minimize.
[2024-05-28 18:32:33] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 3 ms to minimize.
[2024-05-28 18:32:33] [INFO ] Deduced a trap composed of 188 places in 186 ms of which 2 ms to minimize.
[2024-05-28 18:32:33] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 2 ms to minimize.
[2024-05-28 18:32:34] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 2 ms to minimize.
[2024-05-28 18:32:34] [INFO ] Deduced a trap composed of 180 places in 181 ms of which 2 ms to minimize.
[2024-05-28 18:32:34] [INFO ] Deduced a trap composed of 184 places in 181 ms of which 1 ms to minimize.
[2024-05-28 18:32:34] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 2 ms to minimize.
[2024-05-28 18:32:34] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-05-28 18:32:35] [INFO ] Deduced a trap composed of 188 places in 174 ms of which 2 ms to minimize.
[2024-05-28 18:32:35] [INFO ] Deduced a trap composed of 185 places in 233 ms of which 3 ms to minimize.
[2024-05-28 18:32:35] [INFO ] Deduced a trap composed of 187 places in 194 ms of which 2 ms to minimize.
[2024-05-28 18:32:35] [INFO ] Deduced a trap composed of 170 places in 256 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1354 variables, and 73 constraints, problems are : Problem set: 0 solved, 1016 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1016 constraints, Known Traps: 29/29 constraints]
After SMT, in 61801ms problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 61809ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103026 ms. Remains : 356/356 places, 1022/1022 transitions.
Built C files in :
/tmp/ltsmin10214189164801776162
[2024-05-28 18:32:36] [INFO ] Computing symmetric may disable matrix : 1022 transitions.
[2024-05-28 18:32:36] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:32:36] [INFO ] Computing symmetric may enable matrix : 1022 transitions.
[2024-05-28 18:32:36] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:32:37] [INFO ] Computing Do-Not-Accords matrix : 1022 transitions.
[2024-05-28 18:32:37] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:32:37] [INFO ] Built C files in 504ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10214189164801776162
Running compilation step : cd /tmp/ltsmin10214189164801776162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10214189164801776162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10214189164801776162;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 18:32:40] [INFO ] Flatten gal took : 45 ms
[2024-05-28 18:32:40] [INFO ] Flatten gal took : 41 ms
[2024-05-28 18:32:40] [INFO ] Time to serialize gal into /tmp/LTL8325831849218298237.gal : 12 ms
[2024-05-28 18:32:40] [INFO ] Time to serialize properties into /tmp/LTL16994991448160987997.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8325831849218298237.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15977669071203222828.hoa' '-atoms' '/tmp/LTL16994991448160987997.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16994991448160987997.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15977669071203222828.hoa
Detected timeout of ITS tools.
[2024-05-28 18:32:55] [INFO ] Flatten gal took : 44 ms
[2024-05-28 18:32:55] [INFO ] Flatten gal took : 43 ms
[2024-05-28 18:32:55] [INFO ] Time to serialize gal into /tmp/LTL4571912765189075233.gal : 8 ms
[2024-05-28 18:32:55] [INFO ] Time to serialize properties into /tmp/LTL10694247347428556837.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4571912765189075233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10694247347428556837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((P_1119_4_6<1)||(AvailableJobId_1<1))&&((AvailableJobId_3<1)||(P_1119_3_4<1)))&&(((P_1119_1_4<1)||(AvailableJobId_1<...54973
Formula 0 simplified : FG!"((((((((((P_1119_4_6<1)||(AvailableJobId_1<1))&&((AvailableJobId_3<1)||(P_1119_3_4<1)))&&(((P_1119_1_4<1)||(AvailableJobId_1<1))...54963
Detected timeout of ITS tools.
[2024-05-28 18:33:10] [INFO ] Flatten gal took : 66 ms
[2024-05-28 18:33:10] [INFO ] Applying decomposition
[2024-05-28 18:33:10] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8785730240689134920.txt' '-o' '/tmp/graph8785730240689134920.bin' '-w' '/tmp/graph8785730240689134920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8785730240689134920.bin' '-l' '-1' '-v' '-w' '/tmp/graph8785730240689134920.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:33:11] [INFO ] Decomposing Gal with order
[2024-05-28 18:33:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:33:11] [INFO ] Removed a total of 748 redundant transitions.
[2024-05-28 18:33:11] [INFO ] Flatten gal took : 292 ms
[2024-05-28 18:33:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 41 ms.
[2024-05-28 18:33:11] [INFO ] Time to serialize gal into /tmp/LTL18111024325061543146.gal : 24 ms
[2024-05-28 18:33:11] [INFO ] Time to serialize properties into /tmp/LTL10343194393324685515.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18111024325061543146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10343194393324685515.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((u10.P_1119_4_6<1)||(u13.AvailableJobId_1<1))&&((u21.AvailableJobId_3<1)||(u10.P_1119_3_4<1)))&&(((u10.P_1119_1_4<1)...65653
Formula 0 simplified : FG!"((((((((((u10.P_1119_4_6<1)||(u13.AvailableJobId_1<1))&&((u21.AvailableJobId_3<1)||(u10.P_1119_3_4<1)))&&(((u10.P_1119_1_4<1)||(...65643
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-05 finished in 364122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((!p0&&F(!p1)))) U (G(p2) U X(p0))))'
Support contains 12 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 493 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 493 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 492 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 492 transition count 1546
Applied a total of 10 rules in 47 ms. Remains 492 /497 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-05-28 18:33:26] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
// Phase 1: matrix 1522 rows 492 cols
[2024-05-28 18:33:26] [INFO ] Computed 48 invariants in 50 ms
[2024-05-28 18:33:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-05-28 18:33:46] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-28 18:33:52] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2014 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (OVERLAPS) 2/488 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/2014 variables, and 41 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 2/2 constraints]
After SMT, in 50140ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 50154ms
[2024-05-28 18:34:17] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-05-28 18:34:17] [INFO ] Invariant cache hit.
[2024-05-28 18:34:17] [INFO ] Implicit Places using invariants in 402 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 424 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/497 places, 1546/1551 transitions.
Applied a total of 0 rules in 8 ms. Remains 488 /488 variables (removed 0) and now considering 1546/1546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50636 ms. Remains : 488/497 places, 1546/1551 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-06
Stuttering criterion allowed to conclude after 42 steps with 11 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-06 finished in 50842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p1)))))'
Support contains 10 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 496 transition count 1550
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 496 transition count 1550
Applied a total of 2 rules in 15 ms. Remains 496 /497 variables (removed 1) and now considering 1550/1551 (removed 1) transitions.
Running 1544 sub problems to find dead transitions.
[2024-05-28 18:34:17] [INFO ] Flow matrix only has 1526 transitions (discarded 24 similar events)
// Phase 1: matrix 1526 rows 496 cols
[2024-05-28 18:34:17] [INFO ] Computed 48 invariants in 17 ms
[2024-05-28 18:34:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1544 unsolved
[2024-05-28 18:34:36] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-28 18:34:38] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/2022 variables, and 39 constraints, problems are : Problem set: 0 solved, 1544 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 18/28 constraints, State Equation: 0/496 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1544/1544 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1544 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1544 unsolved
[2024-05-28 18:34:54] [INFO ] Deduced a trap composed of 43 places in 329 ms of which 3 ms to minimize.
[2024-05-28 18:34:55] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 2 ms to minimize.
[2024-05-28 18:34:55] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-28 18:34:55] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-28 18:34:55] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/2022 variables, and 44 constraints, problems are : Problem set: 0 solved, 1544 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 18/28 constraints, State Equation: 0/496 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1544 constraints, Known Traps: 7/7 constraints]
After SMT, in 49339ms problems are : Problem set: 0 solved, 1544 unsolved
Search for dead transitions found 0 dead transitions in 49352ms
[2024-05-28 18:35:07] [INFO ] Flow matrix only has 1526 transitions (discarded 24 similar events)
[2024-05-28 18:35:07] [INFO ] Invariant cache hit.
[2024-05-28 18:35:07] [INFO ] Implicit Places using invariants in 436 ms returned [22, 101, 210, 413]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 449 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 492/497 places, 1550/1551 transitions.
Applied a total of 0 rules in 8 ms. Remains 492 /492 variables (removed 0) and now considering 1550/1550 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49828 ms. Remains : 492/497 places, 1550/1551 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-07 finished in 49959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G(p0)||(!p1 U (p2||G(!p1)))))) U p0))'
Support contains 7 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 497 transition count 1534
Reduce places removed 17 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 25 rules applied. Total rules applied 42 place count 480 transition count 1526
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 50 place count 472 transition count 1526
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 50 place count 472 transition count 1466
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 170 place count 412 transition count 1466
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 248 place count 373 transition count 1427
Applied a total of 248 rules in 100 ms. Remains 373 /497 variables (removed 124) and now considering 1427/1551 (removed 124) transitions.
Running 1421 sub problems to find dead transitions.
[2024-05-28 18:35:07] [INFO ] Flow matrix only has 1403 transitions (discarded 24 similar events)
// Phase 1: matrix 1403 rows 373 cols
[2024-05-28 18:35:07] [INFO ] Computed 48 invariants in 16 ms
[2024-05-28 18:35:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
[2024-05-28 18:35:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-28 18:35:25] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1421 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 367/1776 variables, and 39 constraints, problems are : Problem set: 0 solved, 1421 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/373 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1421/1421 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1421 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1026 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/369 variables, 2/41 constraints. Problems are: Problem set: 204 solved, 1217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 5/46 constraints. Problems are: Problem set: 204 solved, 1217 unsolved
[2024-05-28 18:35:49] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2024-05-28 18:35:49] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:35:49] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:35:49] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2024-05-28 18:35:49] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
[2024-05-28 18:35:50] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 2 ms to minimize.
[2024-05-28 18:35:50] [INFO ] Deduced a trap composed of 144 places in 290 ms of which 2 ms to minimize.
[2024-05-28 18:35:51] [INFO ] Deduced a trap composed of 189 places in 280 ms of which 2 ms to minimize.
[2024-05-28 18:35:51] [INFO ] Deduced a trap composed of 183 places in 283 ms of which 2 ms to minimize.
[2024-05-28 18:35:53] [INFO ] Deduced a trap composed of 106 places in 229 ms of which 2 ms to minimize.
[2024-05-28 18:35:54] [INFO ] Deduced a trap composed of 195 places in 271 ms of which 2 ms to minimize.
[2024-05-28 18:35:55] [INFO ] Deduced a trap composed of 159 places in 292 ms of which 2 ms to minimize.
[2024-05-28 18:35:56] [INFO ] Deduced a trap composed of 170 places in 261 ms of which 12 ms to minimize.
[2024-05-28 18:35:57] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1776 variables, and 60 constraints, problems are : Problem set: 204 solved, 1217 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/373 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1421 constraints, Known Traps: 16/16 constraints]
After SMT, in 49889ms problems are : Problem set: 204 solved, 1217 unsolved
Search for dead transitions found 204 dead transitions in 49901ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 204 transitions.
[2024-05-28 18:35:57] [INFO ] Flow matrix only has 1199 transitions (discarded 24 similar events)
// Phase 1: matrix 1199 rows 373 cols
[2024-05-28 18:35:57] [INFO ] Computed 48 invariants in 15 ms
[2024-05-28 18:35:58] [INFO ] Implicit Places using invariants in 379 ms returned [18, 74, 153, 311]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 383 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 369/497 places, 1223/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 365 transition count 1219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 365 transition count 1219
Applied a total of 8 rules in 22 ms. Remains 365 /369 variables (removed 4) and now considering 1219/1223 (removed 4) transitions.
[2024-05-28 18:35:58] [INFO ] Flow matrix only has 1195 transitions (discarded 24 similar events)
// Phase 1: matrix 1195 rows 365 cols
[2024-05-28 18:35:58] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 18:35:58] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-28 18:35:58] [INFO ] Flow matrix only has 1195 transitions (discarded 24 similar events)
[2024-05-28 18:35:58] [INFO ] Invariant cache hit.
[2024-05-28 18:35:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:36:14] [INFO ] Implicit Places using invariants and state equation in 15848 ms returned []
Implicit Place search using SMT with State Equation took 16207 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 365/497 places, 1219/1551 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66618 ms. Remains : 365/497 places, 1219/1551 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-08
Stuttering criterion allowed to conclude after 30646 steps with 280 reset in 176 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-08 finished in 66957 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))'
Support contains 6 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 497 transition count 1529
Reduce places removed 22 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 26 rules applied. Total rules applied 48 place count 475 transition count 1525
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 52 place count 471 transition count 1525
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 52 place count 471 transition count 1465
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 172 place count 411 transition count 1465
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 250 place count 372 transition count 1426
Applied a total of 250 rules in 109 ms. Remains 372 /497 variables (removed 125) and now considering 1426/1551 (removed 125) transitions.
Running 1420 sub problems to find dead transitions.
[2024-05-28 18:36:14] [INFO ] Flow matrix only has 1402 transitions (discarded 24 similar events)
// Phase 1: matrix 1402 rows 372 cols
[2024-05-28 18:36:14] [INFO ] Computed 48 invariants in 42 ms
[2024-05-28 18:36:14] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
[2024-05-28 18:36:31] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 2 ms to minimize.
[2024-05-28 18:36:32] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2024-05-28 18:36:34] [INFO ] Deduced a trap composed of 106 places in 185 ms of which 2 ms to minimize.
[2024-05-28 18:36:37] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 2 ms to minimize.
[2024-05-28 18:36:37] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 1 ms to minimize.
[2024-05-28 18:36:42] [INFO ] Deduced a trap composed of 88 places in 211 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1420 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 366/1774 variables, and 47 constraints, problems are : Problem set: 0 solved, 1420 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 25/30 constraints, State Equation: 0/372 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1420/1420 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1025 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/368 variables, 2/49 constraints. Problems are: Problem set: 104 solved, 1316 unsolved
[2024-05-28 18:36:59] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/1774 variables, and 50 constraints, problems are : Problem set: 104 solved, 1316 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/30 constraints, State Equation: 0/372 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1420 constraints, Known Traps: 7/7 constraints]
After SMT, in 49447ms problems are : Problem set: 104 solved, 1316 unsolved
Search for dead transitions found 104 dead transitions in 49462ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 104 transitions.
[2024-05-28 18:37:04] [INFO ] Flow matrix only has 1298 transitions (discarded 24 similar events)
// Phase 1: matrix 1298 rows 372 cols
[2024-05-28 18:37:04] [INFO ] Computed 48 invariants in 17 ms
[2024-05-28 18:37:04] [INFO ] Implicit Places using invariants in 392 ms returned [18, 74, 153, 310]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 408 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 368/497 places, 1322/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 364 transition count 1318
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 364 transition count 1318
Applied a total of 8 rules in 24 ms. Remains 364 /368 variables (removed 4) and now considering 1318/1322 (removed 4) transitions.
[2024-05-28 18:37:04] [INFO ] Flow matrix only has 1294 transitions (discarded 24 similar events)
// Phase 1: matrix 1294 rows 364 cols
[2024-05-28 18:37:04] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 18:37:04] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-28 18:37:05] [INFO ] Flow matrix only has 1294 transitions (discarded 24 similar events)
[2024-05-28 18:37:05] [INFO ] Invariant cache hit.
[2024-05-28 18:37:06] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:37:21] [INFO ] Implicit Places using invariants and state equation in 16451 ms returned []
Implicit Place search using SMT with State Equation took 16808 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 364/497 places, 1318/1551 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66816 ms. Remains : 364/497 places, 1318/1551 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-11
Stuttering criterion allowed to conclude after 453 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-11 finished in 66902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 497 transition count 1522
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 468 transition count 1522
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 58 place count 468 transition count 1467
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 168 place count 413 transition count 1467
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 268 place count 363 transition count 1417
Applied a total of 268 rules in 51 ms. Remains 363 /497 variables (removed 134) and now considering 1417/1551 (removed 134) transitions.
Running 1411 sub problems to find dead transitions.
[2024-05-28 18:37:21] [INFO ] Flow matrix only has 1393 transitions (discarded 24 similar events)
// Phase 1: matrix 1393 rows 363 cols
[2024-05-28 18:37:21] [INFO ] Computed 48 invariants in 33 ms
[2024-05-28 18:37:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
[2024-05-28 18:37:38] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:37:41] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-28 18:37:41] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-28 18:37:43] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-28 18:37:46] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1756 variables, and 42 constraints, problems are : Problem set: 0 solved, 1411 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 20/30 constraints, State Equation: 0/363 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1411/1411 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD1007 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/358 variables, 1/43 constraints. Problems are: Problem set: 104 solved, 1307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/43 constraints. Problems are: Problem set: 104 solved, 1307 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1005 is UNSAT
At refinement iteration 6 (OVERLAPS) 5/363 variables, 10/53 constraints. Problems are: Problem set: 392 solved, 1019 unsolved
[2024-05-28 18:38:10] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2024-05-28 18:38:10] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 1 ms to minimize.
[2024-05-28 18:38:11] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-28 18:38:11] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:38:11] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2024-05-28 18:38:11] [INFO ] Deduced a trap composed of 169 places in 277 ms of which 2 ms to minimize.
[2024-05-28 18:38:11] [INFO ] Deduced a trap composed of 139 places in 291 ms of which 2 ms to minimize.
SMT process timed out in 50208ms, After SMT, problems are : Problem set: 392 solved, 1019 unsolved
Search for dead transitions found 392 dead transitions in 50220ms
Found 392 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 392 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 392 transitions.
[2024-05-28 18:38:11] [INFO ] Flow matrix only has 1001 transitions (discarded 24 similar events)
// Phase 1: matrix 1001 rows 363 cols
[2024-05-28 18:38:11] [INFO ] Computed 48 invariants in 12 ms
[2024-05-28 18:38:12] [INFO ] Implicit Places using invariants in 342 ms returned [18, 72, 150, 302]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 353 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/497 places, 1025/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 1021
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 1021
Applied a total of 8 rules in 24 ms. Remains 355 /359 variables (removed 4) and now considering 1021/1025 (removed 4) transitions.
[2024-05-28 18:38:12] [INFO ] Flow matrix only has 997 transitions (discarded 24 similar events)
// Phase 1: matrix 997 rows 355 cols
[2024-05-28 18:38:12] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 18:38:12] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-28 18:38:12] [INFO ] Flow matrix only has 997 transitions (discarded 24 similar events)
[2024-05-28 18:38:12] [INFO ] Invariant cache hit.
[2024-05-28 18:38:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:38:32] [INFO ] Implicit Places using invariants and state equation in 20158 ms returned []
Implicit Place search using SMT with State Equation took 20517 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 355/497 places, 1021/1551 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71170 ms. Remains : 355/497 places, 1021/1551 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-12
Product exploration explored 100000 steps with 854 reset in 507 ms.
Product exploration explored 100000 steps with 993 reset in 452 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (343 resets) in 264 ms. (150 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (191 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
[2024-05-28 18:38:34] [INFO ] Flow matrix only has 997 transitions (discarded 24 similar events)
[2024-05-28 18:38:34] [INFO ] Invariant cache hit.
[2024-05-28 18:38:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/46 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/82 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/142 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 202/344 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/348 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 353/1352 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/355 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 11 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-12 finished in 72745 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(G(p0))))'
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 493 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 493 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 492 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 492 transition count 1546
Applied a total of 10 rules in 21 ms. Remains 492 /497 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-05-28 18:38:34] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
// Phase 1: matrix 1522 rows 492 cols
[2024-05-28 18:38:34] [INFO ] Computed 48 invariants in 22 ms
[2024-05-28 18:38:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-05-28 18:38:56] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 4 ms to minimize.
[2024-05-28 18:39:04] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2014 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (OVERLAPS) 2/488 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/2014 variables, and 41 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 2/2 constraints]
After SMT, in 50700ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 50713ms
[2024-05-28 18:39:25] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-05-28 18:39:25] [INFO ] Invariant cache hit.
[2024-05-28 18:39:25] [INFO ] Implicit Places using invariants in 406 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 433 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/497 places, 1546/1551 transitions.
Applied a total of 0 rules in 7 ms. Remains 488 /488 variables (removed 0) and now considering 1546/1546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51179 ms. Remains : 488/497 places, 1546/1551 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 157 steps with 2 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-13 finished in 51281 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(p1))))'
Support contains 5 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 1551/1551 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 497 transition count 1521
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 467 transition count 1521
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 60 place count 467 transition count 1465
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 172 place count 411 transition count 1465
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 260 place count 367 transition count 1421
Applied a total of 260 rules in 64 ms. Remains 367 /497 variables (removed 130) and now considering 1421/1551 (removed 130) transitions.
Running 1415 sub problems to find dead transitions.
[2024-05-28 18:39:25] [INFO ] Flow matrix only has 1397 transitions (discarded 24 similar events)
// Phase 1: matrix 1397 rows 367 cols
[2024-05-28 18:39:25] [INFO ] Computed 48 invariants in 16 ms
[2024-05-28 18:39:25] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
[2024-05-28 18:39:43] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2024-05-28 18:39:47] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 2 ms to minimize.
[2024-05-28 18:39:47] [INFO ] Deduced a trap composed of 46 places in 312 ms of which 2 ms to minimize.
[2024-05-28 18:39:54] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 2 ms to minimize.
[2024-05-28 18:39:55] [INFO ] Deduced a trap composed of 91 places in 200 ms of which 2 ms to minimize.
SMT process timed out in 29636ms, After SMT, problems are : Problem set: 0 solved, 1415 unsolved
Search for dead transitions found 0 dead transitions in 29649ms
[2024-05-28 18:39:55] [INFO ] Flow matrix only has 1397 transitions (discarded 24 similar events)
[2024-05-28 18:39:55] [INFO ] Invariant cache hit.
[2024-05-28 18:39:55] [INFO ] Implicit Places using invariants in 363 ms returned [18, 74, 153, 305]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 386 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/497 places, 1421/1551 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 360 transition count 1418
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 360 transition count 1418
Applied a total of 6 rules in 25 ms. Remains 360 /363 variables (removed 3) and now considering 1418/1421 (removed 3) transitions.
[2024-05-28 18:39:55] [INFO ] Flow matrix only has 1394 transitions (discarded 24 similar events)
// Phase 1: matrix 1394 rows 360 cols
[2024-05-28 18:39:55] [INFO ] Computed 44 invariants in 19 ms
[2024-05-28 18:39:56] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-28 18:39:56] [INFO ] Flow matrix only has 1394 transitions (discarded 24 similar events)
[2024-05-28 18:39:56] [INFO ] Invariant cache hit.
[2024-05-28 18:39:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:40:09] [INFO ] Implicit Places using invariants and state equation in 13834 ms returned []
Implicit Place search using SMT with State Equation took 14257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 360/497 places, 1418/1551 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44397 ms. Remains : 360/497 places, 1418/1551 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-14
Product exploration explored 100000 steps with 959 reset in 436 ms.
Product exploration explored 100000 steps with 932 reset in 448 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 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1456 steps (10 resets) in 9 ms. (145 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 1418/1418 transitions.
Applied a total of 0 rules in 19 ms. Remains 360 /360 variables (removed 0) and now considering 1418/1418 (removed 0) transitions.
Running 1412 sub problems to find dead transitions.
[2024-05-28 18:40:11] [INFO ] Flow matrix only has 1394 transitions (discarded 24 similar events)
[2024-05-28 18:40:11] [INFO ] Invariant cache hit.
[2024-05-28 18:40:11] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
[2024-05-28 18:40:30] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:40:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:40:31] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-28 18:40:33] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-28 18:40:33] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2024-05-28 18:40:34] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2024-05-28 18:40:40] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/1754 variables, and 40 constraints, problems are : Problem set: 0 solved, 1412 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/360 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1412/1412 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1412 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1019 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/356 variables, 2/42 constraints. Problems are: Problem set: 104 solved, 1308 unsolved
[2024-05-28 18:40:53] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2024-05-28 18:40:53] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 2/44 constraints. Problems are: Problem set: 104 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1754 variables, and 44 constraints, problems are : Problem set: 104 solved, 1308 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/360 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1412 constraints, Known Traps: 9/9 constraints]
After SMT, in 49858ms problems are : Problem set: 104 solved, 1308 unsolved
Search for dead transitions found 104 dead transitions in 49872ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 104 transitions.
[2024-05-28 18:41:01] [INFO ] Flow matrix only has 1290 transitions (discarded 24 similar events)
// Phase 1: matrix 1290 rows 360 cols
[2024-05-28 18:41:01] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 18:41:01] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-28 18:41:01] [INFO ] Flow matrix only has 1290 transitions (discarded 24 similar events)
[2024-05-28 18:41:01] [INFO ] Invariant cache hit.
[2024-05-28 18:41:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:41:18] [INFO ] Implicit Places using invariants and state equation in 16829 ms returned []
Implicit Place search using SMT with State Equation took 17180 ms to find 0 implicit places.
[2024-05-28 18:41:18] [INFO ] Redundant transitions in 21 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 360/360 places, 1314/1418 transitions.
Applied a total of 0 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67145 ms. Remains : 360/360 places, 1314/1418 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 p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 683 steps (1 resets) in 8 ms. (75 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 966 reset in 407 ms.
Product exploration explored 100000 steps with 923 reset in 417 ms.
Built C files in :
/tmp/ltsmin18341182356837439794
[2024-05-28 18:41:20] [INFO ] Computing symmetric may disable matrix : 1314 transitions.
[2024-05-28 18:41:20] [INFO ] Computation of Complete disable matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:41:20] [INFO ] Computing symmetric may enable matrix : 1314 transitions.
[2024-05-28 18:41:20] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:41:20] [INFO ] Computing Do-Not-Accords matrix : 1314 transitions.
[2024-05-28 18:41:20] [INFO ] Computation of Completed DNA matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:41:20] [INFO ] Built C files in 566ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18341182356837439794
Running compilation step : cd /tmp/ltsmin18341182356837439794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18341182356837439794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18341182356837439794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 1314/1314 transitions.
Applied a total of 0 rules in 16 ms. Remains 360 /360 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Running 1308 sub problems to find dead transitions.
[2024-05-28 18:41:23] [INFO ] Flow matrix only has 1290 transitions (discarded 24 similar events)
[2024-05-28 18:41:23] [INFO ] Invariant cache hit.
[2024-05-28 18:41:23] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
[2024-05-28 18:41:38] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:41:39] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-28 18:41:40] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 1 ms to minimize.
[2024-05-28 18:41:42] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-28 18:41:46] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 1 ms to minimize.
[2024-05-28 18:41:47] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/1650 variables, and 39 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/360 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 4 (OVERLAPS) 2/356 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
[2024-05-28 18:42:05] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 1 ms to minimize.
[2024-05-28 18:42:05] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 1 ms to minimize.
[2024-05-28 18:42:05] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1650 variables, and 44 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/360 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 9/9 constraints]
After SMT, in 46984ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 46997ms
[2024-05-28 18:42:10] [INFO ] Flow matrix only has 1290 transitions (discarded 24 similar events)
[2024-05-28 18:42:10] [INFO ] Invariant cache hit.
[2024-05-28 18:42:11] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-28 18:42:11] [INFO ] Flow matrix only has 1290 transitions (discarded 24 similar events)
[2024-05-28 18:42:11] [INFO ] Invariant cache hit.
[2024-05-28 18:42:12] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:42:28] [INFO ] Implicit Places using invariants and state equation in 17126 ms returned []
Implicit Place search using SMT with State Equation took 17797 ms to find 0 implicit places.
[2024-05-28 18:42:28] [INFO ] Redundant transitions in 21 ms returned []
Running 1308 sub problems to find dead transitions.
[2024-05-28 18:42:28] [INFO ] Flow matrix only has 1290 transitions (discarded 24 similar events)
[2024-05-28 18:42:28] [INFO ] Invariant cache hit.
[2024-05-28 18:42:28] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
[2024-05-28 18:42:43] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:42:44] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-28 18:42:45] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
[2024-05-28 18:42:46] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-05-28 18:42:50] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 1 ms to minimize.
[2024-05-28 18:42:51] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
SMT process timed out in 36927ms, After SMT, problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 36959ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101819 ms. Remains : 360/360 places, 1314/1314 transitions.
Built C files in :
/tmp/ltsmin17025450356966521895
[2024-05-28 18:43:05] [INFO ] Computing symmetric may disable matrix : 1314 transitions.
[2024-05-28 18:43:05] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:43:05] [INFO ] Computing symmetric may enable matrix : 1314 transitions.
[2024-05-28 18:43:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:43:05] [INFO ] Computing Do-Not-Accords matrix : 1314 transitions.
[2024-05-28 18:43:05] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 18:43:05] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17025450356966521895
Running compilation step : cd /tmp/ltsmin17025450356966521895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17025450356966521895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17025450356966521895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 18:43:09] [INFO ] Flatten gal took : 123 ms
[2024-05-28 18:43:09] [INFO ] Flatten gal took : 108 ms
[2024-05-28 18:43:09] [INFO ] Time to serialize gal into /tmp/LTL3670911833251047489.gal : 7 ms
[2024-05-28 18:43:09] [INFO ] Time to serialize properties into /tmp/LTL18320767597514240517.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3670911833251047489.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16356154425800585799.hoa' '-atoms' '/tmp/LTL18320767597514240517.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18320767597514240517.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16356154425800585799.hoa
Detected timeout of ITS tools.
[2024-05-28 18:43:24] [INFO ] Flatten gal took : 77 ms
[2024-05-28 18:43:24] [INFO ] Flatten gal took : 65 ms
[2024-05-28 18:43:24] [INFO ] Time to serialize gal into /tmp/LTL5594009130652640999.gal : 10 ms
[2024-05-28 18:43:24] [INFO ] Time to serialize properties into /tmp/LTL3684116541506561319.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5594009130652640999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3684116541506561319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((EnablePollingB_3<1)||(PollingAbort<1))"))&&("(((ScheduleTaskB_1<1)||(cIsMonitoring<1))||(cPollingAbort<1))"))))
Formula 0 simplified : G(!"(((ScheduleTaskB_1<1)||(cIsMonitoring<1))||(cPollingAbort<1))" | F!"((EnablePollingB_3<1)||(PollingAbort<1))")
Detected timeout of ITS tools.
[2024-05-28 18:43:39] [INFO ] Flatten gal took : 43 ms
[2024-05-28 18:43:39] [INFO ] Applying decomposition
[2024-05-28 18:43:39] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12077505863693052399.txt' '-o' '/tmp/graph12077505863693052399.bin' '-w' '/tmp/graph12077505863693052399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12077505863693052399.bin' '-l' '-1' '-v' '-w' '/tmp/graph12077505863693052399.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:43:39] [INFO ] Decomposing Gal with order
[2024-05-28 18:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:43:40] [INFO ] Removed a total of 663 redundant transitions.
[2024-05-28 18:43:40] [INFO ] Flatten gal took : 164 ms
[2024-05-28 18:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 12 ms.
[2024-05-28 18:43:40] [INFO ] Time to serialize gal into /tmp/LTL1736498458686495122.gal : 10 ms
[2024-05-28 18:43:40] [INFO ] Time to serialize properties into /tmp/LTL17966260876126349741.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1736498458686495122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17966260876126349741.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i2.u16.EnablePollingB_3<1)||(i2.u16.PollingAbort<1))"))&&("(((i2.u4.ScheduleTaskB_1<1)||(i2.u6.cIsMonitoring<1))||(i2.u16.c...176
Formula 0 simplified : G(!"(((i2.u4.ScheduleTaskB_1<1)||(i2.u6.cIsMonitoring<1))||(i2.u16.cPollingAbort<1))" | F!"((i2.u16.EnablePollingB_3<1)||(i2.u16.Pol...170
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-14 finished in 269625 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))||G(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' '!(F((p0&&G(p1))))'
[2024-05-28 18:43:55] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5119001411095807630
[2024-05-28 18:43:55] [INFO ] Too many transitions (1551) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:43:55] [INFO ] Applying decomposition
[2024-05-28 18:43:55] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5119001411095807630
Running compilation step : cd /tmp/ltsmin5119001411095807630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 18:43:55] [INFO ] Flatten gal took : 107 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5692194236670957548.txt' '-o' '/tmp/graph5692194236670957548.bin' '-w' '/tmp/graph5692194236670957548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5692194236670957548.bin' '-l' '-1' '-v' '-w' '/tmp/graph5692194236670957548.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:43:56] [INFO ] Decomposing Gal with order
[2024-05-28 18:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:43:56] [INFO ] Removed a total of 708 redundant transitions.
[2024-05-28 18:43:56] [INFO ] Flatten gal took : 351 ms
[2024-05-28 18:43:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 79 ms.
[2024-05-28 18:43:56] [INFO ] Time to serialize gal into /tmp/LTLFireability13161062081177750190.gal : 59 ms
[2024-05-28 18:43:56] [INFO ] Time to serialize properties into /tmp/LTLFireability16392157855142872287.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13161062081177750190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16392157855142872287.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !(((G(F("((((((((((u55.P_1119_4_6<1)||(i8.u41.AvailableJobId_1<1))&&((i3.u59.AvailableJobId_3<1)||(u55.P_1119_3_4<1)))&&(((u55.P_1119_...66205
Formula 0 simplified : FG!"((((((((((u55.P_1119_4_6<1)||(i8.u41.AvailableJobId_1<1))&&((i3.u59.AvailableJobId_3<1)||(u55.P_1119_3_4<1)))&&(((u55.P_1119_1_4...66195
Compilation finished in 4559 ms.
Running link step : cd /tmp/ltsmin5119001411095807630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin5119001411095807630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5119001411095807630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5119001411095807630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp2==true)&&[]((LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 127718 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5119001411095807630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 19:11:03] [INFO ] Flatten gal took : 138 ms
[2024-05-28 19:11:03] [INFO ] Time to serialize gal into /tmp/LTLFireability11191038789007776349.gal : 19 ms
[2024-05-28 19:11:03] [INFO ] Time to serialize properties into /tmp/LTLFireability4357290329952423062.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11191038789007776349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4357290329952423062.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((P_1119_4_6<1)||(AvailableJobId_1<1))&&((AvailableJobId_3<1)||(P_1119_3_4<1)))&&(((P_1119_1_4<1)||(AvailableJobId_1<...54973
Formula 0 simplified : FG!"((((((((((P_1119_4_6<1)||(AvailableJobId_1<1))&&((AvailableJobId_3<1)||(P_1119_3_4<1)))&&(((P_1119_1_4<1)||(AvailableJobId_1<1))...54963

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J06T04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446900340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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