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.r289-tajo-171654445000012.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 greatspnxred
Input is PhilosophersDyn-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 14:39 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 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-10-LTLFireability-00
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-01
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-02
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-03
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-04
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-05
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-06
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-07
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-08
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-09
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716840662197

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 20:11:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 573 ms
[2024-05-27 20:11:04] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 20:11:04] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 12 ms.
[2024-05-27 20:11:04] [INFO ] Skeletonized 11 HLPN properties in 2 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA PhilosophersDyn-COL-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40011 steps (2834 resets) in 486 ms. (82 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:04] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 20:11:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-27 20:11:05] [INFO ] Invariant cache hit.
[2024-05-27 20:11:05] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 8/8 places, 7/7 transitions.
RANDOM walk for 40010 steps (2820 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Probably explored full state space saw : 504 states, properties seen :0
Probabilistic random walk after 1609 steps, saw 504 distinct states, run finished after 24 ms. (steps per millisecond=67 ) properties seen :0
Explored full state space saw : 504 states, properties seen :0
Exhaustive walk after 1609 steps, saw 504 distinct states, run finished after 2 ms. (steps per millisecond=804 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2024-05-27 20:11:05] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:11:05] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:05] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 63 ms.
[2024-05-27 20:11:05] [INFO ] Unfolded 13 HLPN properties in 3 ms.
[2024-05-27 20:11:05] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:11:05] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:11:05] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:11:05] [INFO ] Reduced 89 identical enabling conditions.
[2024-05-27 20:11:05] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 28 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-27 20:11:06] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-05-27 20:11:06] [INFO ] Computed 39 invariants in 73 ms
[2024-05-27 20:11:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 35622ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 35664ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:11:42] [INFO ] Computed 39 invariants in 39 ms
[2024-05-27 20:11:42] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 20:11:42] [INFO ] Invariant cache hit.
[2024-05-27 20:11:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:11:43] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 23 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37737 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2024-05-27 20:11:44] [INFO ] Flatten gal took : 451 ms
[2024-05-27 20:11:47] [INFO ] Flatten gal took : 392 ms
[2024-05-27 20:11:49] [INFO ] Input system was already deterministic with 1885 transitions.
Reduction of identical properties reduced properties to check from 13 to 10
RANDOM walk for 40000 steps (4786 resets) in 1703 ms. (23 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (317 resets) in 7118 ms. (5 steps per ms) remains 1/1 properties
[2024-05-27 20:11:52] [INFO ] Invariant cache hit.
[2024-05-27 20:11:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5629ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 168 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:11:58] [INFO ] Invariant cache hit.
[2024-05-27 20:11:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33218ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33409 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4769 resets) in 679 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (318 resets) in 5312 ms. (7 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324446 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324446 steps, saw 81722 distinct states, run finished after 3005 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-27 20:12:36] [INFO ] Invariant cache hit.
[2024-05-27 20:12:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9916 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/158 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 1010/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 14111ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 82 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:12:50] [INFO ] Invariant cache hit.
[2024-05-27 20:12:50] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-27 20:12:50] [INFO ] Invariant cache hit.
[2024-05-27 20:12:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:13:05] [INFO ] Implicit Places using invariants and state equation in 15085 ms returned []
Implicit Place search using SMT with State Equation took 15199 ms to find 0 implicit places.
[2024-05-27 20:13:05] [INFO ] Redundant transitions in 144 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:13:05] [INFO ] Invariant cache hit.
[2024-05-27 20:13:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43473ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58958 ms. Remains : 170/170 places, 1885/1885 transitions.
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' '!((G(F(p0))||(F(p0)&&G(F(p1)))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 175 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:13:50] [INFO ] Invariant cache hit.
[2024-05-27 20:13:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32231ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32254ms
[2024-05-27 20:14:22] [INFO ] Invariant cache hit.
[2024-05-27 20:14:22] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 20:14:22] [INFO ] Invariant cache hit.
[2024-05-27 20:14:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:14:55] [INFO ] Performed 153/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 20:15:32] [INFO ] Performed 156/170 implicitness test of which 0 returned IMPLICIT in 67 seconds.
[2024-05-27 20:16:13] [INFO ] Performed 164/170 implicitness test of which 0 returned IMPLICIT in 109 seconds.
[2024-05-27 20:16:46] [INFO ] Performed 166/170 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2024-05-27 20:16:46] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2024-05-27 20:16:46] [INFO ] Implicit Places using invariants and state equation in 143216 ms returned []
Implicit Place search using SMT with State Equation took 143300 ms to find 0 implicit places.
[2024-05-27 20:16:46] [INFO ] Redundant transitions in 96 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:16:46] [INFO ] Invariant cache hit.
[2024-05-27 20:16:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42564ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42592ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 218442 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 19418 reset in 3295 ms.
Product exploration explored 100000 steps with 19367 reset in 3196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 20:17:40] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:17:55] [INFO ] Invariant cache hit.
[2024-05-27 20:17:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32585ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32610ms
[2024-05-27 20:18:28] [INFO ] Invariant cache hit.
[2024-05-27 20:18:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-27 20:18:28] [INFO ] Invariant cache hit.
[2024-05-27 20:18:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:19:14] [INFO ] Performed 153/170 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2024-05-27 20:19:46] [INFO ] Performed 155/170 implicitness test of which 0 returned IMPLICIT in 75 seconds.
[2024-05-27 20:20:18] [INFO ] Performed 157/170 implicitness test of which 0 returned IMPLICIT in 107 seconds.
[2024-05-27 20:20:52] [INFO ] Performed 161/170 implicitness test of which 0 returned IMPLICIT in 142 seconds.
[2024-05-27 20:20:52] [INFO ] Timeout of Implicit test with SMT after 142 seconds.
[2024-05-27 20:20:52] [INFO ] Implicit Places using invariants and state equation in 144577 ms returned []
Implicit Place search using SMT with State Equation took 144694 ms to find 0 implicit places.
[2024-05-27 20:20:53] [INFO ] Redundant transitions in 68 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:20:53] [INFO ] Invariant cache hit.
[2024-05-27 20:20:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44309ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221841 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4 steps (0 resets) in 9 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 20:21:42] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19298 reset in 3137 ms.
Product exploration explored 100000 steps with 19202 reset in 2967 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 92 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:22:03] [INFO ] Invariant cache hit.
[2024-05-27 20:22:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32454ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32480ms
[2024-05-27 20:22:36] [INFO ] Invariant cache hit.
[2024-05-27 20:22:36] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 20:22:36] [INFO ] Invariant cache hit.
[2024-05-27 20:22:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:23:23] [INFO ] Performed 153/170 implicitness test of which 0 returned IMPLICIT in 45 seconds.
[2024-05-27 20:24:02] [INFO ] Performed 160/170 implicitness test of which 0 returned IMPLICIT in 83 seconds.
[2024-05-27 20:24:34] [INFO ] Performed 162/170 implicitness test of which 0 returned IMPLICIT in 115 seconds.
[2024-05-27 20:25:11] [INFO ] Performed 165/170 implicitness test of which 0 returned IMPLICIT in 153 seconds.
[2024-05-27 20:25:11] [INFO ] Timeout of Implicit test with SMT after 153 seconds.
[2024-05-27 20:25:11] [INFO ] Implicit Places using invariants and state equation in 155205 ms returned []
Implicit Place search using SMT with State Equation took 155278 ms to find 0 implicit places.
[2024-05-27 20:25:11] [INFO ] Redundant transitions in 26 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:25:11] [INFO ] Invariant cache hit.
[2024-05-27 20:25:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43057ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43080ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 230977 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLFireability-00 finished in 725412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)&&(p2 U G(p3))) U (X(p2) U !p0))))'
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:25:55] [INFO ] Invariant cache hit.
[2024-05-27 20:25:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32203ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32231ms
[2024-05-27 20:26:27] [INFO ] Invariant cache hit.
[2024-05-27 20:26:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-27 20:26:28] [INFO ] Invariant cache hit.
[2024-05-27 20:26:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:26:36] [INFO ] Implicit Places using invariants and state equation in 8393 ms returned []
Implicit Place search using SMT with State Equation took 8456 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:26:36] [INFO ] Invariant cache hit.
[2024-05-27 20:26:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 44416ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 44459ms
Finished structural reductions in LTL mode , in 1 iterations and 85175 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 465 ms :[p0, p0, (OR (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 2357 ms.
Product exploration explored 100000 steps with 50000 reset in 2021 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X p2), (X p3), (X (NOT (OR (AND p0 p3) (AND p0 p2)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (OR (AND p0 p3) (AND p0 p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 31 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLFireability-01 finished in 90189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((!p0||G(F(!p1))))) U G(p2)))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 83 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:27:25] [INFO ] Invariant cache hit.
[2024-05-27 20:27:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34206ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34230ms
[2024-05-27 20:28:00] [INFO ] Invariant cache hit.
[2024-05-27 20:28:00] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-27 20:28:00] [INFO ] Invariant cache hit.
[2024-05-27 20:28:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:28:33] [INFO ] Performed 153/170 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-27 20:29:03] [INFO ] Performed 163/170 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-27 20:29:35] [INFO ] Performed 165/170 implicitness test of which 0 returned IMPLICIT in 93 seconds.
[2024-05-27 20:30:07] [INFO ] Performed 167/170 implicitness test of which 0 returned IMPLICIT in 125 seconds.
[2024-05-27 20:30:07] [INFO ] Timeout of Implicit test with SMT after 125 seconds.
[2024-05-27 20:30:07] [INFO ] Implicit Places using invariants and state equation in 127316 ms returned []
Implicit Place search using SMT with State Equation took 127425 ms to find 0 implicit places.
[2024-05-27 20:30:07] [INFO ] Redundant transitions in 63 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:30:07] [INFO ] Invariant cache hit.
[2024-05-27 20:30:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43645ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43674ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 205503 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (AND p1 p0), (AND p1 p0 p2)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-03
Stuttering criterion allowed to conclude after 312 steps with 50 reset in 37 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-03 finished in 205726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(!p1)||(G(F(p0)) U p2))))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:30:51] [INFO ] Invariant cache hit.
[2024-05-27 20:30:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33593ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33618ms
[2024-05-27 20:31:25] [INFO ] Invariant cache hit.
[2024-05-27 20:31:25] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 20:31:25] [INFO ] Invariant cache hit.
[2024-05-27 20:31:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:31:32] [INFO ] Implicit Places using invariants and state equation in 7190 ms returned []
Implicit Place search using SMT with State Equation took 7362 ms to find 0 implicit places.
[2024-05-27 20:31:32] [INFO ] Redundant transitions in 26 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:31:32] [INFO ] Invariant cache hit.
[2024-05-27 20:31:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43824ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 84983 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-04 finished in 85171 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((G(!p0)||X(!p1))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:32:16] [INFO ] Invariant cache hit.
[2024-05-27 20:32:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34463ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34486ms
[2024-05-27 20:32:51] [INFO ] Invariant cache hit.
[2024-05-27 20:32:51] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-27 20:32:51] [INFO ] Invariant cache hit.
[2024-05-27 20:32:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:32:59] [INFO ] Implicit Places using invariants and state equation in 7768 ms returned []
Implicit Place search using SMT with State Equation took 7913 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:32:59] [INFO ] Invariant cache hit.
[2024-05-27 20:32:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43901ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43927ms
Finished structural reductions in LTL mode , in 1 iterations and 86344 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, p1, (AND p1 p0), (AND p1 p0), (AND p0 p1), p0]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 68 steps with 22 reset in 3 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-05 finished in 86604 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((G(F(!p0))||G(p1))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:33:43] [INFO ] Invariant cache hit.
[2024-05-27 20:33:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33129ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33165ms
[2024-05-27 20:34:16] [INFO ] Invariant cache hit.
[2024-05-27 20:34:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 20:34:16] [INFO ] Invariant cache hit.
[2024-05-27 20:34:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:35:04] [INFO ] Performed 154/170 implicitness test of which 0 returned IMPLICIT in 45 seconds.
[2024-05-27 20:35:41] [INFO ] Performed 163/170 implicitness test of which 0 returned IMPLICIT in 82 seconds.
[2024-05-27 20:36:17] [INFO ] Performed 166/170 implicitness test of which 0 returned IMPLICIT in 118 seconds.
[2024-05-27 20:36:49] [INFO ] Performed 168/170 implicitness test of which 0 returned IMPLICIT in 150 seconds.
[2024-05-27 20:36:49] [INFO ] Timeout of Implicit test with SMT after 150 seconds.
[2024-05-27 20:36:49] [INFO ] Implicit Places using invariants and state equation in 152557 ms returned []
Implicit Place search using SMT with State Equation took 152654 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:36:49] [INFO ] Invariant cache hit.
[2024-05-27 20:36:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42190ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42208ms
Finished structural reductions in LTL mode , in 1 iterations and 228051 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-07
Product exploration explored 100000 steps with 11953 reset in 2682 ms.
Product exploration explored 100000 steps with 11950 reset in 2473 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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (4770 resets) in 1114 ms. (35 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (356 resets) in 7007 ms. (5 steps per ms) remains 1/1 properties
[2024-05-27 20:37:39] [INFO ] Invariant cache hit.
[2024-05-27 20:37:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 148/2055 variables, and 28 constraints, problems are : Problem set: 1 solved, 0 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 19/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2388ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:37:42] [INFO ] Invariant cache hit.
[2024-05-27 20:37:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33033ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33054ms
[2024-05-27 20:38:15] [INFO ] Invariant cache hit.
[2024-05-27 20:38:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 20:38:15] [INFO ] Invariant cache hit.
[2024-05-27 20:38:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:38:49] [INFO ] Performed 154/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-27 20:39:26] [INFO ] Performed 166/170 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2024-05-27 20:40:01] [INFO ] Performed 169/170 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2024-05-27 20:40:01] [INFO ] Implicit Places using invariants and state equation in 106025 ms returned []
Implicit Place search using SMT with State Equation took 106087 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:40:01] [INFO ] Invariant cache hit.
[2024-05-27 20:40:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41815ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41832ms
Finished structural reductions in LTL mode , in 1 iterations and 180986 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Product exploration explored 100000 steps with 11960 reset in 761 ms.
Product exploration explored 100000 steps with 11916 reset in 630 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:40:46] [INFO ] Invariant cache hit.
[2024-05-27 20:40:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31985ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32008ms
[2024-05-27 20:41:18] [INFO ] Redundant transitions in 26 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:41:18] [INFO ] Invariant cache hit.
[2024-05-27 20:41:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42163ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42182ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74340 ms. Remains : 170/170 places, 1885/1885 transitions.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:42:00] [INFO ] Invariant cache hit.
[2024-05-27 20:42:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31969ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 31985ms
[2024-05-27 20:42:32] [INFO ] Invariant cache hit.
[2024-05-27 20:42:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-27 20:42:32] [INFO ] Invariant cache hit.
[2024-05-27 20:42:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:43:05] [INFO ] Performed 154/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 20:43:40] [INFO ] Performed 160/170 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-05-27 20:44:12] [INFO ] Performed 162/170 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-05-27 20:44:44] [INFO ] Performed 164/170 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-05-27 20:44:44] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-05-27 20:44:44] [INFO ] Implicit Places using invariants and state equation in 131989 ms returned []
Implicit Place search using SMT with State Equation took 132056 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:44:44] [INFO ] Invariant cache hit.
[2024-05-27 20:44:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42856ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42875ms
Finished structural reductions in LTL mode , in 1 iterations and 206928 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLFireability-07 finished in 704291 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((X(G(p0))||(p1&&F(!p1)))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:45:27] [INFO ] Invariant cache hit.
[2024-05-27 20:45:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32716ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32748ms
[2024-05-27 20:46:00] [INFO ] Invariant cache hit.
[2024-05-27 20:46:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-27 20:46:00] [INFO ] Invariant cache hit.
[2024-05-27 20:46:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:46:32] [INFO ] Performed 153/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 20:47:07] [INFO ] Performed 161/170 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-05-27 20:47:39] [INFO ] Performed 163/170 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-05-27 20:48:11] [INFO ] Performed 165/170 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-05-27 20:48:11] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-05-27 20:48:11] [INFO ] Implicit Places using invariants and state equation in 131481 ms returned []
Implicit Place search using SMT with State Equation took 131548 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:48:11] [INFO ] Invariant cache hit.
[2024-05-27 20:48:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 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 0.0)
(s7 0.0)
(s8 1.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 1.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 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.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 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.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 1.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 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.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 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 2.0)
(s128 1.0)
(s129 2.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42665ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42683ms
Finished structural reductions in LTL mode , in 1 iterations and 207000 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p0) p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-08 finished in 207313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 195 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:48:55] [INFO ] Invariant cache hit.
[2024-05-27 20:48:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31647ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 31668ms
[2024-05-27 20:49:26] [INFO ] Invariant cache hit.
[2024-05-27 20:49:27] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-27 20:49:27] [INFO ] Invariant cache hit.
[2024-05-27 20:49:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:49:54] [INFO ] Implicit Places using invariants and state equation in 26889 ms returned []
Implicit Place search using SMT with State Equation took 27214 ms to find 0 implicit places.
[2024-05-27 20:49:54] [INFO ] Redundant transitions in 26 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:49:54] [INFO ] Invariant cache hit.
[2024-05-27 20:49:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41552ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41568ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 100691 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 1312 ms.
Product exploration explored 100000 steps with 50000 reset in 1110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLFireability-09 finished in 103212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(F(p1))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:50:38] [INFO ] Invariant cache hit.
[2024-05-27 20:50:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32327ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32352ms
[2024-05-27 20:51:10] [INFO ] Invariant cache hit.
[2024-05-27 20:51:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 20:51:10] [INFO ] Invariant cache hit.
[2024-05-27 20:51:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:51:57] [INFO ] Performed 164/170 implicitness test of which 0 returned IMPLICIT in 45 seconds.
[2024-05-27 20:52:29] [INFO ] Performed 166/170 implicitness test of which 0 returned IMPLICIT in 77 seconds.
[2024-05-27 20:53:01] [INFO ] Performed 168/170 implicitness test of which 0 returned IMPLICIT in 109 seconds.
[2024-05-27 20:53:05] [INFO ] Implicit Places using invariants and state equation in 114426 ms returned []
Implicit Place search using SMT with State Equation took 114505 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:53:05] [INFO ] Invariant cache hit.
[2024-05-27 20:53:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41958ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41990ms
Finished structural reductions in LTL mode , in 1 iterations and 188863 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-10
Stuttering criterion allowed to conclude after 24 steps with 3 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-10 finished in 189030 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(G(!p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:53:47] [INFO ] Invariant cache hit.
[2024-05-27 20:53:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32844ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32869ms
[2024-05-27 20:54:20] [INFO ] Invariant cache hit.
[2024-05-27 20:54:20] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-27 20:54:20] [INFO ] Invariant cache hit.
[2024-05-27 20:54:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:54:47] [INFO ] Implicit Places using invariants and state equation in 27056 ms returned []
Implicit Place search using SMT with State Equation took 27459 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:54:47] [INFO ] Invariant cache hit.
[2024-05-27 20:54:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41785ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41819ms
Finished structural reductions in LTL mode , in 1 iterations and 102171 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-11 finished in 102285 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((F(p0)&&G((X(G((X(p0) U p2)))||p1)))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:55:29] [INFO ] Invariant cache hit.
[2024-05-27 20:55:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31831ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 31848ms
[2024-05-27 20:56:01] [INFO ] Invariant cache hit.
[2024-05-27 20:56:01] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-27 20:56:01] [INFO ] Invariant cache hit.
[2024-05-27 20:56:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:56:28] [INFO ] Implicit Places using invariants and state equation in 26616 ms returned []
Implicit Place search using SMT with State Equation took 26865 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:56:28] [INFO ] Invariant cache hit.
[2024-05-27 20:56:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42507ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42525ms
Finished structural reductions in LTL mode , in 1 iterations and 101256 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-12
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-12 finished in 101645 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(((!p1 U (X(!p2)||G(!p1)))&&p0))))'
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:57:11] [INFO ] Invariant cache hit.
[2024-05-27 20:57:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32621ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32643ms
[2024-05-27 20:57:43] [INFO ] Invariant cache hit.
[2024-05-27 20:57:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 20:57:43] [INFO ] Invariant cache hit.
[2024-05-27 20:57:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:57:56] [INFO ] Implicit Places using invariants and state equation in 12239 ms returned []
Implicit Place search using SMT with State Equation took 12310 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:57:56] [INFO ] Invariant cache hit.
[2024-05-27 20:57:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42930ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42946ms
Finished structural reductions in LTL mode , in 1 iterations and 87913 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-14
Product exploration timeout after 85280 steps with 10187 reset in 10001 ms.
Stack based approach found an accepted trace after 1798 steps with 213 reset with depth 9 and stack size 9 in 208 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-14 finished in 98241 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((X((p1&&X((X(p3)||p2))))||p0)))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:58:49] [INFO ] Invariant cache hit.
[2024-05-27 20:58:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31821ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 31839ms
[2024-05-27 20:59:21] [INFO ] Invariant cache hit.
[2024-05-27 20:59:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 20:59:21] [INFO ] Invariant cache hit.
[2024-05-27 20:59:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:59:34] [INFO ] Implicit Places using invariants and state equation in 12748 ms returned []
Implicit Place search using SMT with State Equation took 12828 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:59:34] [INFO ] Invariant cache hit.
[2024-05-27 20:59:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42337ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42356ms
Finished structural reductions in LTL mode , in 1 iterations and 87033 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLFireability-15 finished in 87337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||G(p1))))'
Found a Lengthening insensitive property : PhilosophersDyn-COL-10-LTLFireability-07
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 34 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 21:00:17] [INFO ] Invariant cache hit.
[2024-05-27 21:00:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32329ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32361ms
[2024-05-27 21:00:49] [INFO ] Invariant cache hit.
[2024-05-27 21:00:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 21:00:49] [INFO ] Invariant cache hit.
[2024-05-27 21:00:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 21:01:35] [INFO ] Performed 153/170 implicitness test of which 0 returned IMPLICIT in 43 seconds.
[2024-05-27 21:02:10] [INFO ] Performed 157/170 implicitness test of which 0 returned IMPLICIT in 78 seconds.
[2024-05-27 21:02:44] [INFO ] Performed 161/170 implicitness test of which 0 returned IMPLICIT in 113 seconds.
[2024-05-27 21:03:24] [INFO ] Performed 165/170 implicitness test of which 0 returned IMPLICIT in 152 seconds.
[2024-05-27 21:03:24] [INFO ] Timeout of Implicit test with SMT after 152 seconds.
[2024-05-27 21:03:24] [INFO ] Implicit Places using invariants and state equation in 154560 ms returned []
Implicit Place search using SMT with State Equation took 154635 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 21:03:24] [INFO ] Invariant cache hit.
[2024-05-27 21:03:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42268ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42286ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 229323 ms. Remains : 170/170 places, 1885/1885 transitions.
Running random walk in product with property : PhilosophersDyn-COL-10-LTLFireability-07
Product exploration explored 100000 steps with 11962 reset in 2768 ms.
Product exploration explored 100000 steps with 11957 reset in 2427 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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (4782 resets) in 671 ms. (59 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (357 resets) in 6352 ms. (6 steps per ms) remains 1/1 properties
[2024-05-27 21:04:14] [INFO ] Invariant cache hit.
[2024-05-27 21:04:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 148/2055 variables, and 28 constraints, problems are : Problem set: 1 solved, 0 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 19/30 constraints, State Equation: 0/170 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1638ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 21:04:16] [INFO ] Invariant cache hit.
[2024-05-27 21:04:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33406ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33438ms
[2024-05-27 21:04:49] [INFO ] Invariant cache hit.
[2024-05-27 21:04:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 21:04:50] [INFO ] Invariant cache hit.
[2024-05-27 21:04:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 21:05:37] [INFO ] Performed 154/170 implicitness test of which 0 returned IMPLICIT in 45 seconds.
[2024-05-27 21:06:09] [INFO ] Performed 156/170 implicitness test of which 0 returned IMPLICIT in 77 seconds.
[2024-05-27 21:06:41] [INFO ] Performed 158/170 implicitness test of which 0 returned IMPLICIT in 109 seconds.
[2024-05-27 21:07:13] [INFO ] Performed 160/170 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2024-05-27 21:07:13] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2024-05-27 21:07:13] [INFO ] Implicit Places using invariants and state equation in 143921 ms returned []
Implicit Place search using SMT with State Equation took 143984 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-27 21:07:13] [INFO ] Invariant cache hit.
[2024-05-27 21:07:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42502ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42521ms
Finished structural reductions in LTL mode , in 1 iterations and 219960 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Product exploration explored 100000 steps with 11965 reset in 792 ms.
Product exploration explored 100000 steps with 11984 reset in 613 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 122 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 21:07:59] [INFO ] Invariant cache hit.
[2024-05-27 21:07:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 8
TRANSITIONS: 7
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 2
COLOR VARS: 4
ARCS: 33
LOADING TIME: 0.175

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 170
TRANSITIONS: 2310
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 18190
UNFOLDING TIME: 0.427

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.162
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.953
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1860
MODEL NAME: /home/mcc/execution/model
170 places, 2310 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

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="PhilosophersDyn-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PhilosophersDyn-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445000012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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