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.r516-tajo-171654446900339.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 ltsminxred
Input is PolyORBLF-PT-S06J06T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900339
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717256101424

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:35:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:35:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:35:03] [INFO ] Load time of PNML (sax parser for PT used): 504 ms
[2024-06-01 15:35:03] [INFO ] Transformed 506 places.
[2024-06-01 15:35:03] [INFO ] Transformed 7154 transitions.
[2024-06-01 15:35:03] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 737 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 191 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 135 ms. Remains 497 /506 variables (removed 9) and now considering 1771/1774 (removed 3) transitions.
Running 1765 sub problems to find dead transitions.
[2024-06-01 15:35:04] [INFO ] Flow matrix only has 1747 transitions (discarded 24 similar events)
// Phase 1: matrix 1747 rows 497 cols
[2024-06-01 15:35:04] [INFO ] Computed 48 invariants in 118 ms
[2024-06-01 15:35:04] [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-06-01 15:35:31] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 31 ms to minimize.
[2024-06-01 15:35:32] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 3 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 Real declared 491/2244 variables, and 39 constraints, problems are : Problem set: 0 solved, 1765 unsolved in 20088 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
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 493/2244 variables, and 41 constraints, problems are : Problem set: 220 solved, 1545 unsolved in 20032 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 54535ms problems are : Problem set: 220 solved, 1545 unsolved
Search for dead transitions found 220 dead transitions in 54591ms
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-06-01 15:35:58] [INFO ] Flow matrix only has 1527 transitions (discarded 24 similar events)
// Phase 1: matrix 1527 rows 497 cols
[2024-06-01 15:35:58] [INFO ] Computed 48 invariants in 34 ms
[2024-06-01 15:35:59] [INFO ] Implicit Places using invariants in 546 ms returned [22, 101, 210, 414]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 559 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 493/506 places, 1551/1774 transitions.
Applied a total of 0 rules in 22 ms. Remains 493 /493 variables (removed 0) and now considering 1551/1551 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55386 ms. Remains : 493/506 places, 1551/1774 transitions.
Support contains 191 out of 493 places after structural reductions.
[2024-06-01 15:36:00] [INFO ] Flatten gal took : 313 ms
[2024-06-01 15:36:00] [INFO ] Flatten gal took : 202 ms
[2024-06-01 15:36:00] [INFO ] Input system was already deterministic with 1551 transitions.
Support contains 187 out of 493 places (down from 191) after GAL structural reductions.
RANDOM walk for 40002 steps (174 resets) in 2201 ms. (18 steps per ms) remains 6/29 properties
BEST_FIRST walk for 40003 steps (82 resets) in 450 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (75 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (64 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (67 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (90 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
[2024-06-01 15:36:02] [INFO ] Flow matrix only has 1527 transitions (discarded 24 similar events)
// Phase 1: matrix 1527 rows 493 cols
[2024-06-01 15:36:02] [INFO ] Computed 44 invariants in 24 ms
[2024-06-01 15:36:02] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 381/402 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 51/453 variables, 16/25 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 38/491 variables, 18/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2018/2020 variables, and 534 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 491/493 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 247/256 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/362 variables, 17/20 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/491 variables, 23/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 15:36:04] [INFO ] Deduced a trap composed of 94 places in 503 ms of which 22 ms to minimize.
[2024-06-01 15:36:04] [INFO ] Deduced a trap composed of 93 places in 479 ms of which 16 ms to minimize.
[2024-06-01 15:36:05] [INFO ] Deduced a trap composed of 79 places in 381 ms of which 3 ms to minimize.
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Int declared 491/2020 variables, and 46 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/493 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 3138ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(G(p0)))'
Support contains 8 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 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 493 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 467 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 467 transition count 1469
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 164 place count 411 transition count 1469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 410 transition count 1468
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 410 transition count 1468
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 268 place count 359 transition count 1417
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 271 place count 356 transition count 1414
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 356 transition count 1414
Applied a total of 274 rules in 333 ms. Remains 356 /493 variables (removed 137) and now considering 1414/1551 (removed 137) transitions.
Running 1408 sub problems to find dead transitions.
[2024-06-01 15:36:05] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
// Phase 1: matrix 1390 rows 356 cols
[2024-06-01 15:36:06] [INFO ] Computed 44 invariants in 20 ms
[2024-06-01 15:36:06] [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, 1408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1746 variables, and 33 constraints, problems are : Problem set: 0 solved, 1408 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 14/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1408/1408 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
[2024-06-01 15:36:37] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:36:41] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1746 variables, and 35 constraints, problems are : Problem set: 0 solved, 1408 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 14/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1408 constraints, Known Traps: 2/2 constraints]
After SMT, in 49922ms problems are : Problem set: 0 solved, 1408 unsolved
Search for dead transitions found 0 dead transitions in 49938ms
[2024-06-01 15:36:55] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-06-01 15:36:55] [INFO ] Invariant cache hit.
[2024-06-01 15:36:56] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 15:36:56] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-06-01 15:36:56] [INFO ] Invariant cache hit.
[2024-06-01 15:36:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:37:15] [INFO ] Implicit Places using invariants and state equation in 18723 ms returned []
Implicit Place search using SMT with State Equation took 19218 ms to find 0 implicit places.
[2024-06-01 15:37:15] [INFO ] Redundant transitions in 70 ms returned []
Running 1408 sub problems to find dead transitions.
[2024-06-01 15:37:15] [INFO ] Flow matrix only has 1390 transitions (discarded 24 similar events)
[2024-06-01 15:37:15] [INFO ] Invariant cache hit.
[2024-06-01 15:37:15] [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, 1408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
[2024-06-01 15:37:32] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 3 ms to minimize.
[2024-06-01 15:37:34] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:37:34] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:37:36] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:37:42] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1746 variables, and 38 constraints, problems are : Problem set: 0 solved, 1408 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 14/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1408/1408 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1408 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD106 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 TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD268 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 TDEAD327 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 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 TDEAD693 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD750 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 TDEAD816 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/353 variables, 3/41 constraints. Problems are: Problem set: 104 solved, 1304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/41 constraints. Problems are: Problem set: 104 solved, 1304 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 TDEAD156 is UNSAT
Problem TDEAD171 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 TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD270 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 TDEAD321 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 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 TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 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 TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 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 TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 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 TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD768 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 TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 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 TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1004 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/356 variables, 8/49 constraints. Problems are: Problem set: 392 solved, 1016 unsolved
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 2 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:38:18] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 158 places in 358 ms of which 3 ms to minimize.
[2024-06-01 15:38:19] [INFO ] Deduced a trap composed of 166 places in 477 ms of which 3 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2024-06-01 15:38:20] [INFO ] Deduced a trap composed of 132 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:38:21] [INFO ] Deduced a trap composed of 176 places in 380 ms of which 14 ms to minimize.
[2024-06-01 15:38:22] [INFO ] Deduced a trap composed of 175 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 161 places in 315 ms of which 3 ms to minimize.
[2024-06-01 15:38:23] [INFO ] Deduced a trap composed of 102 places in 229 ms of which 2 ms to minimize.
(s343 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 3)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 9)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 9)
(s258 0)
(s259 0)
(s260 4)
(s261 7)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1746 variables, and 62 constraints, problems are : Problem set: 392 solved, 1016 unsolved in 30066 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/1408 constraints, Known Traps: 18/18 constraints]
After SMT, in 70185ms problems are : Problem set: 392 solved, 1016 unsolved
Search for dead transitions found 392 dead transitions in 70225ms
Found 392 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 392 transitions
Dead transitions reduction (with SMT) removed 392 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 356/493 places, 1022/1551 transitions.
Applied a total of 0 rules in 53 ms. Remains 356 /356 variables (removed 0) and now considering 1022/1022 (removed 0) transitions.
[2024-06-01 15:38:25] [INFO ] Redundant transitions in 27 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 139912 ms. Remains : 356/493 places, 1022/1551 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-00
Product exploration explored 100000 steps with 893 reset in 671 ms.
Product exploration explored 100000 steps with 900 reset in 509 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 1953 steps (20 resets) in 13 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 8 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 20 ms. Remains 356 /356 variables (removed 0) and now considering 1022/1022 (removed 0) transitions.
Running 1016 sub problems to find dead transitions.
[2024-06-01 15:38:27] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
// Phase 1: matrix 998 rows 356 cols
[2024-06-01 15:38:27] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 15:38:27] [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-06-01 15:38:39] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:38:42] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:38:45] [INFO ] Deduced a trap composed of 78 places in 152 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1354 variables, and 36 constraints, problems are : Problem set: 0 solved, 1016 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 14/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-06-01 15:38:51] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 3 ms to minimize.
[2024-06-01 15:38:51] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
At refinement iteration 5 (OVERLAPS) 3/353 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-06-01 15:39:04] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 1 ms to minimize.
[2024-06-01 15:39:04] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 121 places in 219 ms of which 1 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 14 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 6 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:39:05] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1354 variables, and 48 constraints, problems are : Problem set: 0 solved, 1016 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 14/22 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1016 constraints, Known Traps: 12/12 constraints]
After SMT, in 41792ms problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 41800ms
[2024-06-01 15:39:09] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:39:09] [INFO ] Invariant cache hit.
[2024-06-01 15:39:09] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-06-01 15:39:09] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:39:09] [INFO ] Invariant cache hit.
[2024-06-01 15:39:10] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:39:33] [INFO ] Implicit Places using invariants and state equation in 24162 ms returned []
Implicit Place search using SMT with State Equation took 24764 ms to find 0 implicit places.
[2024-06-01 15:39:34] [INFO ] Redundant transitions in 70 ms returned []
Running 1016 sub problems to find dead transitions.
[2024-06-01 15:39:34] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:39:34] [INFO ] Invariant cache hit.
[2024-06-01 15:39: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-06-01 15:39:40] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:39:40] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:39:45] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 14 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 30019 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-06-01 15:40:09] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2024-06-01 15:40:09] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1016 unsolved
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:40:15] [INFO ] Deduced a trap composed of 27 places in 174 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-06-01 15:40:31] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 138 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 181 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:40:32] [INFO ] Deduced a trap composed of 185 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 192 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 147 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:40:33] [INFO ] Deduced a trap composed of 188 places in 279 ms of which 10 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 180 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:40:34] [INFO ] Deduced a trap composed of 184 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 102 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:40:35] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/1354 variables, and 69 constraints, problems are : Problem set: 0 solved, 1016 unsolved in 30030 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: 25/25 constraints]
After SMT, in 61598ms problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 61611ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128282 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 1197 steps (9 resets) in 16 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 923 reset in 554 ms.
Product exploration explored 100000 steps with 967 reset in 439 ms.
Support contains 8 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 46 ms. Remains 356 /356 variables (removed 0) and now considering 1022/1022 (removed 0) transitions.
Running 1016 sub problems to find dead transitions.
[2024-06-01 15:40:37] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:40:37] [INFO ] Invariant cache hit.
[2024-06-01 15:40:37] [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-06-01 15:40:43] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:40:43] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:40:48] [INFO ] Deduced a trap composed of 78 places in 127 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: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 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 21726ms, After SMT, problems are : Problem set: 0 solved, 1016 unsolved
Search for dead transitions found 0 dead transitions in 21741ms
[2024-06-01 15:40:58] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:40:58] [INFO ] Invariant cache hit.
[2024-06-01 15:40:59] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 15:40:59] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:40:59] [INFO ] Invariant cache hit.
[2024-06-01 15:41:00] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:41:22] [INFO ] Implicit Places using invariants and state equation in 23176 ms returned []
Implicit Place search using SMT with State Equation took 23524 ms to find 0 implicit places.
[2024-06-01 15:41:22] [INFO ] Redundant transitions in 18 ms returned []
Running 1016 sub problems to find dead transitions.
[2024-06-01 15:41:22] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2024-06-01 15:41:22] [INFO ] Invariant cache hit.
[2024-06-01 15:41:22] [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-06-01 15:41:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:41:29] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:41:34] [INFO ] Deduced a trap composed of 78 places in 97 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 "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 9.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30065 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-06-01 15:41:58] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:41:58] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:41:58] [INFO ] Deduced a trap composed of 59 places in 50 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-06-01 15:42:03] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:42:03] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2024-06-01 15:42:03] [INFO ] Deduced a trap composed of 27 places in 125 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-06-01 15:42:21] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:42:21] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 138 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 181 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:42:22] [INFO ] Deduced a trap composed of 185 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 192 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 188 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:42:23] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:42:24] [INFO ] Deduced a trap composed of 180 places in 203 ms of which 2 ms to minimize.
SMT process timed out in 61800ms, After SMT, 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 107153 ms. Remains : 356/356 places, 1022/1022 transitions.
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-00 finished in 378916 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)||G((F(p2)&&p1)))))'
Support contains 70 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 22 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:42:24] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
// Phase 1: matrix 1522 rows 488 cols
[2024-06-01 15:42:24] [INFO ] Computed 44 invariants in 24 ms
[2024-06-01 15:42:24] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:42:43] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:42:58] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:42:58] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 2 ms to minimize.
[2024-06-01 15:42:58] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:42:58] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 40 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 7/7 constraints]
After SMT, in 48367ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 48380ms
[2024-06-01 15:43:12] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:43:12] [INFO ] Invariant cache hit.
[2024-06-01 15:43:13] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-01 15:43:13] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:43:13] [INFO ] Invariant cache hit.
[2024-06-01 15:43:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:43:32] [INFO ] Implicit Places using invariants and state equation in 18614 ms returned []
Implicit Place search using SMT with State Equation took 19132 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:43:32] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:43:32] [INFO ] Invariant cache hit.
[2024-06-01 15:43:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 4 ms to minimize.
[2024-06-01 15:43:52] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:43:54] [INFO ] Deduced a trap composed of 194 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:44:18] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:44:18] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:44:19] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/484 variables, 2/41 constraints. Problems are: Problem set: 204 solved, 1336 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 Int declared 484/2010 variables, and 41 constraints, problems are : Problem set: 204 solved, 1336 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 70189ms problems are : Problem set: 204 solved, 1336 unsolved
Search for dead transitions found 204 dead transitions in 70208ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1342/1551 transitions.
Applied a total of 0 rules in 7 ms. Remains 488 /488 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137758 ms. Remains : 488/493 places, 1342/1551 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-03 finished in 137946 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||G(p1))))'
Support contains 16 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 23 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:44:42] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:44:42] [INFO ] Invariant cache hit.
[2024-06-01 15:44:42] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:45:00] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:45:01] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:45:03] [INFO ] Deduced a trap composed of 194 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:45:17] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:45:18] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:45:18] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 3)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 2)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 2)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 4)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 2)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 4)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 4)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 2)
(s181 0)
(s182 1)
(s183 1)
(s184 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 2)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 4)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 4)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 2)
(s252 4)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 10)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 2)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 4)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 4)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 9)
(s359 0)
(s360 0)
(s361 0)
(s362 4)
(s363 1)
(s364 6)
(s366 3)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 3)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 1)
(s434 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 49285ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 49299ms
[2024-06-01 15:45:31] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:45:31] [INFO ] Invariant cache hit.
[2024-06-01 15:45:32] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 15:45:32] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:45:32] [INFO ] Invariant cache hit.
[2024-06-01 15:45:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:45:53] [INFO ] Implicit Places using invariants and state equation in 21171 ms returned []
Implicit Place search using SMT with State Equation took 21608 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:45:53] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:45:53] [INFO ] Invariant cache hit.
[2024-06-01 15:45:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:46:13] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:46:13] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:46:15] [INFO ] Deduced a trap composed of 194 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 3.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 2.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 2.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 3.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 4.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 4.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 2.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 2.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 (/ 2.0 3.0))
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 4.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 4.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 2.0)
(s252 4.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 9.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 (/ 1.0 3.0))
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 2.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 4.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 (/ 1.0 3.0))
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 4.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 9.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 4.0)
(s363 1.0)
(s364 7.0)
(s366 3.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 (/ 2.0 3.0))
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 3.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:46:41] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 3 ms to minimize.
[2024-06-01 15:46:41] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:46:42] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 70605ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 70618ms
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1546/1551 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141555 ms. Remains : 488/493 places, 1546/1551 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 864 ms.
Product exploration explored 100000 steps with 50000 reset in 694 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 28 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-04 finished in 143316 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(G(p0)) U !p1)||X(G(p1)))))'
Support contains 9 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 45 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:47:05] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:47:05] [INFO ] Invariant cache hit.
[2024-06-01 15:47:05] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:47:24] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:47:24] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:47:27] [INFO ] Deduced a trap composed of 194 places in 130 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 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:47:40] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 2 ms to minimize.
[2024-06-01 15:47:40] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:47:41] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 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 Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 48512ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 48527ms
[2024-06-01 15:47:54] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:47:54] [INFO ] Invariant cache hit.
[2024-06-01 15:47:54] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 15:47:54] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:47:54] [INFO ] Invariant cache hit.
[2024-06-01 15:47:55] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:48:11] [INFO ] Implicit Places using invariants and state equation in 17241 ms returned []
Implicit Place search using SMT with State Equation took 17621 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:48:11] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:48:11] [INFO ] Invariant cache hit.
[2024-06-01 15:48:11] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:48:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:48:30] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:48:32] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:48:57] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:48:57] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:48:58] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/484 variables, 2/41 constraints. Problems are: Problem set: 204 solved, 1336 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 Int declared 484/2010 variables, and 41 constraints, problems are : Problem set: 204 solved, 1336 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 69166ms problems are : Problem set: 204 solved, 1336 unsolved
Search for dead transitions found 204 dead transitions in 69179ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1342/1551 transitions.
Applied a total of 0 rules in 8 ms. Remains 488 /488 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135388 ms. Remains : 488/493 places, 1342/1551 transitions.
Stuttering acceptance computed with spot in 114 ms :[false, false, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-05
Stuttering criterion allowed to conclude after 760 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-05 finished in 135537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 22 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:49:21] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:49:21] [INFO ] Invariant cache hit.
[2024-06-01 15:49:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:49:42] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:49:46] [INFO ] Deduced a trap composed of 74 places in 3313 ms of which 2 ms to minimize.
[2024-06-01 15:49:48] [INFO ] Deduced a trap composed of 194 places in 138 ms of which 11 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 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:49:57] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 2 ms to minimize.
[2024-06-01 15:49:57] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:49:57] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 49447ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 49472ms
[2024-06-01 15:50:10] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:50:10] [INFO ] Invariant cache hit.
[2024-06-01 15:50:11] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-06-01 15:50:11] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:50:11] [INFO ] Invariant cache hit.
[2024-06-01 15:50:12] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:50:30] [INFO ] Implicit Places using invariants and state equation in 19000 ms returned []
Implicit Place search using SMT with State Equation took 19535 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:50:30] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:50:30] [INFO ] Invariant cache hit.
[2024-06-01 15:50:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:50:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:50:49] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:50:51] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:51:15] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:51:15] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:51:16] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/484 variables, 2/41 constraints. Problems are: Problem set: 204 solved, 1336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/2010 variables, and 41 constraints, problems are : Problem set: 204 solved, 1336 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 68836ms problems are : Problem set: 204 solved, 1336 unsolved
Search for dead transitions found 204 dead transitions in 68850ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1342/1551 transitions.
Applied a total of 0 rules in 8 ms. Remains 488 /488 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137897 ms. Remains : 488/493 places, 1342/1551 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-09 finished in 138051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 46 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:51:39] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:51:39] [INFO ] Invariant cache hit.
[2024-06-01 15:51:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:51:57] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:51:57] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:51:59] [INFO ] Deduced a trap composed of 194 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:52:15] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 3 ms to minimize.
[2024-06-01 15:52:15] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:52:16] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 48914ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 48937ms
[2024-06-01 15:52:28] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:52:28] [INFO ] Invariant cache hit.
[2024-06-01 15:52:28] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 15:52:28] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:52:28] [INFO ] Invariant cache hit.
[2024-06-01 15:52:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:52:50] [INFO ] Implicit Places using invariants and state equation in 21297 ms returned []
Implicit Place search using SMT with State Equation took 21727 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:52:50] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:52:50] [INFO ] Invariant cache hit.
[2024-06-01 15:52:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:53:08] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 15:53:08] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:53:10] [INFO ] Deduced a trap composed of 194 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
(s390 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 3.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 2.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 2.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 2.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 4.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 4.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 2.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 2.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 4.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 4.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 2.0)
(s252 4.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 10.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 2.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 4.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 4.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 9.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 3.0)
(s363 1.0)
(s364 8.0)
(s366 3.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:53:35] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:53:35] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:53:36] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/484 variables, 2/41 constraints. Problems are: Problem set: 204 solved, 1336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/2010 variables, and 41 constraints, problems are : Problem set: 204 solved, 1336 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 69037ms problems are : Problem set: 204 solved, 1336 unsolved
Search for dead transitions found 204 dead transitions in 69049ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1342/1551 transitions.
Applied a total of 0 rules in 7 ms. Remains 488 /488 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139780 ms. Remains : 488/493 places, 1342/1551 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1015 steps with 11 reset in 8 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-10 finished in 139875 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((F(p0)||(X(F(p1))&&G(p2))))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 40 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:53:59] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:53:59] [INFO ] Invariant cache hit.
[2024-06-01 15:53:59] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:54:18] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 7 ms to minimize.
[2024-06-01 15:54:18] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 5 ms to minimize.
[2024-06-01 15:54:20] [INFO ] Deduced a trap composed of 194 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:54:33] [INFO ] Deduced a trap composed of 27 places in 419 ms of which 17 ms to minimize.
[2024-06-01 15:54:34] [INFO ] Deduced a trap composed of 92 places in 253 ms of which 13 ms to minimize.
[2024-06-01 15:54:35] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 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 Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 48301ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 48314ms
[2024-06-01 15:54:47] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:54:47] [INFO ] Invariant cache hit.
[2024-06-01 15:54:48] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 15:54:48] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:54:48] [INFO ] Invariant cache hit.
[2024-06-01 15:54:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:55:20] [INFO ] Performed 385/488 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:55:26] [INFO ] Implicit Places using invariants and state equation in 38296 ms returned []
Implicit Place search using SMT with State Equation took 38825 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:55:26] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:55:26] [INFO ] Invariant cache hit.
[2024-06-01 15:55:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:55:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
[2024-06-01 15:55:45] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:55:48] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
(s3 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 2 ms to minimize.
[2024-06-01 15:56:13] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:56:14] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 39 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 69284ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 69301ms
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1546/1551 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156494 ms. Remains : 488/493 places, 1546/1551 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-11
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-11 finished in 156735 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 U p1))))'
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 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 493 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 464 transition count 1522
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 58 place count 464 transition count 1466
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 170 place count 408 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 407 transition count 1465
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 407 transition count 1465
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 272 place count 357 transition count 1415
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 275 place count 354 transition count 1412
Iterating global reduction 2 with 3 rules applied. Total rules applied 278 place count 354 transition count 1412
Applied a total of 278 rules in 166 ms. Remains 354 /493 variables (removed 139) and now considering 1412/1551 (removed 139) transitions.
Running 1406 sub problems to find dead transitions.
[2024-06-01 15:56:36] [INFO ] Flow matrix only has 1388 transitions (discarded 24 similar events)
// Phase 1: matrix 1388 rows 354 cols
[2024-06-01 15:56:36] [INFO ] Computed 44 invariants in 33 ms
[2024-06-01 15:56:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
[2024-06-01 15:56:53] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:56:54] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:56:54] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:57:01] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 348/1742 variables, and 37 constraints, problems are : Problem set: 0 solved, 1406 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 17/28 constraints, State Equation: 0/354 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1406/1406 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 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 TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD670 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 TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 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 TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 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 TDEAD729 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 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 TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 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 TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 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 TDEAD828 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 TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1006 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/354 variables, 11/48 constraints. Problems are: Problem set: 392 solved, 1014 unsolved
[2024-06-01 15:57:15] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:57:16] [INFO ] Deduced a trap composed of 158 places in 323 ms of which 2 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 100 places in 270 ms of which 2 ms to minimize.
[2024-06-01 15:57:17] [INFO ] Deduced a trap composed of 135 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:57:18] [INFO ] Deduced a trap composed of 175 places in 268 ms of which 2 ms to minimize.
[2024-06-01 15:57:18] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 1 ms to minimize.
[2024-06-01 15:57:18] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:57:19] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2024-06-01 15:57:24] [INFO ] Deduced a trap composed of 147 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:57:24] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 1 ms to minimize.
[2024-06-01 15:57:25] [INFO ] Deduced a trap composed of 140 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:57:25] [INFO ] Deduced a trap composed of 140 places in 245 ms of which 1 ms to minimize.
[2024-06-01 15:57:25] [INFO ] Deduced a trap composed of 158 places in 275 ms of which 1 ms to minimize.
SMT process timed out in 49596ms, After SMT, problems are : Problem set: 392 solved, 1014 unsolved
Search for dead transitions found 392 dead transitions in 49617ms
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-06-01 15:57:25] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
// Phase 1: matrix 996 rows 354 cols
[2024-06-01 15:57:25] [INFO ] Computed 44 invariants in 15 ms
[2024-06-01 15:57:26] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 15:57:26] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2024-06-01 15:57:26] [INFO ] Invariant cache hit.
[2024-06-01 15:57:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:57:51] [INFO ] Implicit Places using invariants and state equation in 25465 ms returned []
Implicit Place search using SMT with State Equation took 25812 ms to find 0 implicit places.
[2024-06-01 15:57:51] [INFO ] Redundant transitions in 11 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 354/493 places, 1020/1551 transitions.
Applied a total of 0 rules in 15 ms. Remains 354 /354 variables (removed 0) and now considering 1020/1020 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75638 ms. Remains : 354/493 places, 1020/1551 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-13
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-13 finished in 75810 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)||((!p0 U (p1||G(!p0))) U p0))))'
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1551/1551 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 1547
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 488 transition count 1546
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 488 transition count 1546
Applied a total of 10 rules in 22 ms. Remains 488 /493 variables (removed 5) and now considering 1546/1551 (removed 5) transitions.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:57:51] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
// Phase 1: matrix 1522 rows 488 cols
[2024-06-01 15:57:51] [INFO ] Computed 44 invariants in 23 ms
[2024-06-01 15:57:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:58:26] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 2 ms to minimize.
[2024-06-01 15:58:26] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 2 ms to minimize.
[2024-06-01 15:58:26] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:58:26] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2010 variables, and 40 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 7/7 constraints]
After SMT, in 48915ms problems are : Problem set: 0 solved, 1540 unsolved
Search for dead transitions found 0 dead transitions in 48929ms
[2024-06-01 15:58:40] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:58:40] [INFO ] Invariant cache hit.
[2024-06-01 15:58:41] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 15:58:41] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:58:41] [INFO ] Invariant cache hit.
[2024-06-01 15:58:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:59:06] [INFO ] Implicit Places using invariants and state equation in 24950 ms returned []
Implicit Place search using SMT with State Equation took 25390 ms to find 0 implicit places.
Running 1540 sub problems to find dead transitions.
[2024-06-01 15:59:06] [INFO ] Flow matrix only has 1522 transitions (discarded 24 similar events)
[2024-06-01 15:59:06] [INFO ] Invariant cache hit.
[2024-06-01 15:59:06] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:59:25] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:59:26] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:59:28] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 3.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 2.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 2.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 2.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 2.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 4.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 4.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 timeout
2.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2010 variables, and 36 constraints, problems are : Problem set: 0 solved, 1540 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1540/1540 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
[2024-06-01 15:59:53] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 2 ms to minimize.
[2024-06-01 15:59:53] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:59:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1540 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/484 variables, 2/41 constraints. Problems are: Problem set: 204 solved, 1336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/2010 variables, and 41 constraints, problems are : Problem set: 204 solved, 1336 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 14/23 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1540 constraints, Known Traps: 6/6 constraints]
After SMT, in 68984ms problems are : Problem set: 204 solved, 1336 unsolved
Search for dead transitions found 204 dead transitions in 68996ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1342/1551 transitions.
Applied a total of 0 rules in 5 ms. Remains 488 /488 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143352 ms. Remains : 488/493 places, 1342/1551 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLCardinality-15
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLCardinality-15 finished in 143494 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)))'
[2024-06-01 16:00:15] [INFO ] Flatten gal took : 159 ms
[2024-06-01 16:00:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 17 ms.
[2024-06-01 16:00:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 493 places, 1551 transitions and 8868 arcs took 13 ms.
Total runtime 1512636 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717257616787

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S06J06T04-LTLCardinality-00
ltl formula formula --ltl=/tmp/1668/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 493 places, 1551 transitions and 8868 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1668/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1668/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1668/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1668/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 513 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 494, there are 1555 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~1276!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4353
pnml2lts-mc( 0/ 4): unique states count: 7038
pnml2lts-mc( 0/ 4): unique transitions count: 22113
pnml2lts-mc( 0/ 4): - self-loop count: 196
pnml2lts-mc( 0/ 4): - claim dead count: 9820
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 7045
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2717
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7045 states 22145 transitions, fanout: 3.143
pnml2lts-mc( 0/ 4): Total exploration time 0.520 sec (0.510 sec minimum, 0.515 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13548, Transitions per second: 42587
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 32.5 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1581 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S06J06T04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446900339"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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